/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:40:07,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:40:07,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:40:07,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:40:07,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:40:07,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:40:07,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:40:07,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:40:07,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:40:07,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:40:07,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:40:07,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:40:07,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:40:07,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:40:07,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:40:07,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:40:07,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:40:07,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:40:07,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:40:07,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:40:07,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:40:07,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:40:07,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:40:07,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:40:07,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:40:07,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:40:07,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:40:07,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:40:07,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:40:07,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:40:07,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:40:07,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:40:07,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:40:07,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:40:07,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:40:07,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:40:07,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:40:07,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:40:07,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:40:07,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:40:07,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:40:07,246 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:40:07,260 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:40:07,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:40:07,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:40:07,261 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:40:07,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:40:07,262 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:40:07,262 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:40:07,262 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:40:07,262 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:40:07,262 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:40:07,262 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:40:07,263 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:40:07,263 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:40:07,263 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:40:07,263 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:40:07,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:40:07,263 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:40:07,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:40:07,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:40:07,264 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:40:07,264 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:40:07,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:40:07,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:40:07,265 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:40:07,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:40:07,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:40:07,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:40:07,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:40:07,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:40:07,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:40:07,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:40:07,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:40:07,445 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:40:07,446 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:40:07,447 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:40:07,507 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Vstyz1/tmp/1bb0833c94ea4e22b8ca8d620deb9750/FLAG6b05d72aa [2020-07-01 12:40:07,848 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:40:07,849 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:40:07,849 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:40:07,863 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Vstyz1/tmp/1bb0833c94ea4e22b8ca8d620deb9750/FLAG6b05d72aa [2020-07-01 12:40:08,254 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_Vstyz1/tmp/1bb0833c94ea4e22b8ca8d620deb9750 [2020-07-01 12:40:08,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:40:08,266 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:40:08,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:40:08,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:40:08,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:40:08,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bd70e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08, skipping insertion in model container [2020-07-01 12:40:08,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:40:08,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:40:08,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:40:08,549 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:40:08,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:40:08,583 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:40:08,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08 WrapperNode [2020-07-01 12:40:08,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:40:08,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:40:08,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:40:08,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:40:08,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:40:08,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:40:08,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:40:08,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:40:08,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:40:08,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:40:08,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:40:08,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:40:08,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:40:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:40:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:40:08,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:40:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:40:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:40:08,914 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:40:08,914 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:40:08,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:08 BoogieIcfgContainer [2020-07-01 12:40:08,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:40:08,919 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:40:08,919 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:40:08,921 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:40:08,922 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:08" (1/1) ... [2020-07-01 12:40:08,936 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 19 edges [2020-07-01 12:40:08,937 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:40:08,938 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:40:08,939 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:40:08,939 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:40:08,941 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:40:08,942 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:40:08,942 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:40:08,958 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:40:08,977 INFO L200 BlockEncoder]: SBE split 4 edges [2020-07-01 12:40:08,981 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:40:08,983 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:40:09,001 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-07-01 12:40:09,004 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:40:09,005 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:40:09,005 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:40:09,005 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:40:09,006 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:40:09,006 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 15 edges [2020-07-01 12:40:09,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:40:09 BasicIcfg [2020-07-01 12:40:09,007 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:40:09,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:40:09,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:40:09,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:40:09,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:40:08" (1/4) ... [2020-07-01 12:40:09,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d74905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:40:09, skipping insertion in model container [2020-07-01 12:40:09,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (2/4) ... [2020-07-01 12:40:09,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d74905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:40:09, skipping insertion in model container [2020-07-01 12:40:09,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:08" (3/4) ... [2020-07-01 12:40:09,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d74905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:40:09, skipping insertion in model container [2020-07-01 12:40:09,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:40:09" (4/4) ... [2020-07-01 12:40:09,016 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:40:09,028 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:40:09,036 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-01 12:40:09,050 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-01 12:40:09,073 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:40:09,073 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:40:09,074 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:40:09,074 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:40:09,074 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:40:09,074 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:40:09,074 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:40:09,074 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:40:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-07-01 12:40:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:40:09,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:09,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:09,096 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash 456233926, now seen corresponding path program 1 times [2020-07-01 12:40:09,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:09,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219305412] [2020-07-01 12:40:09,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:09,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219305412] [2020-07-01 12:40:09,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:09,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:40:09,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804320339] [2020-07-01 12:40:09,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:40:09,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:09,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:09,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:09,297 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-07-01 12:40:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:09,343 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-07-01 12:40:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:09,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:40:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:09,357 INFO L225 Difference]: With dead ends: 14 [2020-07-01 12:40:09,357 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 12:40:09,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 12:40:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 12:40:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 12:40:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-07-01 12:40:09,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 7 [2020-07-01 12:40:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:09,395 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-07-01 12:40:09,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:40:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2020-07-01 12:40:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:40:09,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:09,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:09,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:40:09,397 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash 456263717, now seen corresponding path program 1 times [2020-07-01 12:40:09,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:09,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272843871] [2020-07-01 12:40:09,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:09,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272843871] [2020-07-01 12:40:09,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:09,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:09,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324708465] [2020-07-01 12:40:09,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:09,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:09,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:09,457 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2020-07-01 12:40:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:09,507 INFO L93 Difference]: Finished difference Result 9 states and 14 transitions. [2020-07-01 12:40:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:09,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:40:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:09,509 INFO L225 Difference]: With dead ends: 9 [2020-07-01 12:40:09,509 INFO L226 Difference]: Without dead ends: 8 [2020-07-01 12:40:09,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:09,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-01 12:40:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-01 12:40:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 12:40:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-07-01 12:40:09,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2020-07-01 12:40:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:09,513 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-07-01 12:40:09,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-07-01 12:40:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:40:09,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:09,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:09,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:40:09,514 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 456263719, now seen corresponding path program 1 times [2020-07-01 12:40:09,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:09,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425864356] [2020-07-01 12:40:09,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:09,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425864356] [2020-07-01 12:40:09,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:09,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:40:09,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844930211] [2020-07-01 12:40:09,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:40:09,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:40:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:09,587 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 5 states. [2020-07-01 12:40:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:09,662 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-01 12:40:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:09,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:40:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:09,663 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:40:09,663 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:40:09,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:40:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:40:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:40:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-01 12:40:09,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 7 [2020-07-01 12:40:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:09,668 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-01 12:40:09,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:40:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-01 12:40:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:09,669 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:09,669 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:09,669 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:40:09,669 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1018841848, now seen corresponding path program 1 times [2020-07-01 12:40:09,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:09,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820293775] [2020-07-01 12:40:09,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:09,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820293775] [2020-07-01 12:40:09,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183902867] [2020-07-01 12:40:09,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:09,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:40:09,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:09,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:40:09,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-01 12:40:09,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693410423] [2020-07-01 12:40:09,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:40:09,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:40:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:40:09,825 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 6 states. [2020-07-01 12:40:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:09,905 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2020-07-01 12:40:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:40:09,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:40:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:09,907 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:40:09,907 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:40:09,907 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:40:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:40:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-01 12:40:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:40:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-01 12:40:09,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2020-07-01 12:40:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:09,913 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-01 12:40:09,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:40:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-01 12:40:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:09,914 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:09,914 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:10,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:10,115 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1018841817, now seen corresponding path program 1 times [2020-07-01 12:40:10,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:10,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415284574] [2020-07-01 12:40:10,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:10,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415284574] [2020-07-01 12:40:10,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869985138] [2020-07-01 12:40:10,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:10,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:40:10,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:10,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:40:10,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:40:10,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940640799] [2020-07-01 12:40:10,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:40:10,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:40:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:10,203 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 5 states. [2020-07-01 12:40:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:10,261 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-01 12:40:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:10,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:40:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:10,265 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:40:10,265 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:40:10,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:40:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:40:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-01 12:40:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:40:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-07-01 12:40:10,271 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 10 [2020-07-01 12:40:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:10,272 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-01 12:40:10,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:40:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2020-07-01 12:40:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:10,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:10,273 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:10,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:10,474 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1017918296, now seen corresponding path program 1 times [2020-07-01 12:40:10,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:10,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479583953] [2020-07-01 12:40:10,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:40:10,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479583953] [2020-07-01 12:40:10,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:10,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:40:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496244401] [2020-07-01 12:40:10,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:40:10,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:40:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:10,512 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 5 states. [2020-07-01 12:40:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:10,563 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-01 12:40:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:10,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:40:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:10,582 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:40:10,582 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:40:10,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:40:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:40:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:40:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-01 12:40:10,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 10 [2020-07-01 12:40:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:10,586 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-01 12:40:10,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:40:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-01 12:40:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:10,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:10,587 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:10,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:40:10,588 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -522373516, now seen corresponding path program 1 times [2020-07-01 12:40:10,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:10,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221642479] [2020-07-01 12:40:10,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:10,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221642479] [2020-07-01 12:40:10,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583919147] [2020-07-01 12:40:10,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:10,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-01 12:40:10,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:10,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:40:10,781 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:40:10,790 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:40:10,791 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:40:10,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-01 12:40:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:10,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:40:10,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2020-07-01 12:40:10,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876195999] [2020-07-01 12:40:10,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 12:40:10,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:10,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 12:40:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:40:10,889 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 13 states. [2020-07-01 12:40:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:11,017 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-01 12:40:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:40:11,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2020-07-01 12:40:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:11,018 INFO L225 Difference]: With dead ends: 16 [2020-07-01 12:40:11,018 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 12:40:11,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:40:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 12:40:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-01 12:40:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:40:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-01 12:40:11,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2020-07-01 12:40:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:11,022 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-01 12:40:11,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 12:40:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-01 12:40:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:11,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:11,023 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:11,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:11,224 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:11,225 INFO L82 PathProgramCache]: Analyzing trace with hash -522373515, now seen corresponding path program 1 times [2020-07-01 12:40:11,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:11,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299656094] [2020-07-01 12:40:11,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:11,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299656094] [2020-07-01 12:40:11,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092736352] [2020-07-01 12:40:11,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:11,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:40:11,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:11,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:40:11,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-01 12:40:11,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437998309] [2020-07-01 12:40:11,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:40:11,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:11,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:40:11,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:11,333 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 7 states. [2020-07-01 12:40:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:11,390 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-01 12:40:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:40:11,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-01 12:40:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:11,391 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:40:11,391 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:40:11,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:40:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:40:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:40:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:40:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-01 12:40:11,395 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2020-07-01 12:40:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:11,395 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-01 12:40:11,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:40:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-01 12:40:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:40:11,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:11,396 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2020-07-01 12:40:11,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:11,598 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:40:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1362704485, now seen corresponding path program 2 times [2020-07-01 12:40:11,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:11,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688306485] [2020-07-01 12:40:11,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:40:11,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688306485] [2020-07-01 12:40:11,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513555955] [2020-07-01 12:40:11,708 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:11,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:40:11,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:40:11,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-01 12:40:11,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:11,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:40:11,777 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:40:11,783 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:40:11,784 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:40:11,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-01 12:40:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:11,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:40:11,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-07-01 12:40:11,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575848193] [2020-07-01 12:40:11,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:40:11,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:11,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:40:11,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:40:11,894 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2020-07-01 12:40:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:12,072 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-01 12:40:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:40:12,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-07-01 12:40:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:12,072 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:40:12,072 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:40:12,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2020-07-01 12:40:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:40:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:40:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:40:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:40:12,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-01 12:40:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:12,074 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:40:12,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:40:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:40:12,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:40:12,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:12,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:40:12,404 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:40:12,404 INFO L268 CegarLoopResult]: For program point L23-1(lines 17 30) no Hoare annotation was computed. [2020-07-01 12:40:12,404 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-01 12:40:12,404 INFO L268 CegarLoopResult]: For program point L20-2(lines 17 30) no Hoare annotation was computed. [2020-07-01 12:40:12,404 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:40:12,404 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 14) no Hoare annotation was computed. [2020-07-01 12:40:12,405 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 14) the Hoare annotation is: (let ((.cse5 (<= 0 ULTIMATE.start_cbzero_~length)) (.cse0 (<= 1 ULTIMATE.start_main_~n~0)) (.cse1 (= 1 (select |#valid| ULTIMATE.start_cbzero_~p~0.base))) (.cse2 (<= 1 ULTIMATE.start_main_~length~0)) (.cse3 (select |#length| ULTIMATE.start_cbzero_~p~0.base)) (.cse4 (<= 1 |#StackHeapBarrier|))) (or (and (<= 1 ULTIMATE.start_cbzero_~p~0.offset) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cbzero_~length ULTIMATE.start_cbzero_~p~0.offset) .cse3) .cse4 .cse5) (and .cse1 .cse2 .cse4 (<= ULTIMATE.start_main_~n~0 1) (<= ULTIMATE.start_cbzero_~length 0) .cse5) (and (= 0 ULTIMATE.start_cbzero_~p~0.offset) .cse0 .cse1 .cse2 (<= ULTIMATE.start_cbzero_~length .cse3) (<= 1 ULTIMATE.start_cbzero_~length) .cse4))) [2020-07-01 12:40:12,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:40:12,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:40:12,407 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:40:12,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:12,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:12,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:12,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:12,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:12,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:12,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:12,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:12,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:12,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:12,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:40:12 BasicIcfg [2020-07-01 12:40:12,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:40:12,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:40:12,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:40:12,431 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:40:12,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:40:12,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:40:08" (1/5) ... [2020-07-01 12:40:12,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ab268d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:40:12, skipping insertion in model container [2020-07-01 12:40:12,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:40:12,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:08" (2/5) ... [2020-07-01 12:40:12,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ab268d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:40:12, skipping insertion in model container [2020-07-01 12:40:12,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:40:12,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:08" (3/5) ... [2020-07-01 12:40:12,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ab268d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:40:12, skipping insertion in model container [2020-07-01 12:40:12,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:40:12,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:40:09" (4/5) ... [2020-07-01 12:40:12,434 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ab268d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:40:12, skipping insertion in model container [2020-07-01 12:40:12,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:40:12,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:40:12" (5/5) ... [2020-07-01 12:40:12,436 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:40:12,458 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:40:12,458 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:40:12,458 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:40:12,458 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:40:12,458 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:40:12,458 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:40:12,458 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:40:12,459 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:40:12,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-01 12:40:12,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:40:12,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:40:12,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:40:12,470 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:40:12,470 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:40:12,470 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:40:12,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-01 12:40:12,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:40:12,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:40:12,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:40:12,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:40:12,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:40:12,477 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [74] ULTIMATE.startENTRY-->L20: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_10| 0 0) |v_#valid_9|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_5|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~length~0] 11#L20true [45] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 9#L20-2true [61] L20-2-->L23-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 6#L23-1true [67] L23-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_1 v_ULTIMATE.start_cbzero_~b.offset_1) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= |v_ULTIMATE.start_cbzero_#in~b.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_ULTIMATE.start_cbzero_#in~b.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cbzero_#in~length_1| v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_cbzero_~length_1 |v_ULTIMATE.start_cbzero_#in~length_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_cbzero_~b.base_1 |v_ULTIMATE.start_cbzero_#in~b.base_1|) (>= v_ULTIMATE.start_main_~length~0_8 v_ULTIMATE.start_main_~n~0_8) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4|)) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc4.base_4| v_ULTIMATE.start_main_~length~0_8)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_cbzero_~b.offset_1 |v_ULTIMATE.start_cbzero_#in~b.offset_1|) (= v_ULTIMATE.start_cbzero_~p~0.base_1 v_ULTIMATE.start_cbzero_~b.base_1) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4| 1) |v_#valid_5|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cbzero_#in~b.offset=|v_ULTIMATE.start_cbzero_#in~b.offset_1|, ULTIMATE.start_cbzero_~b.base=v_ULTIMATE.start_cbzero_~b.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_1|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_2|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_2|, ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_1, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_1, #valid=|v_#valid_5|, ULTIMATE.start_cbzero_~b.offset=v_ULTIMATE.start_cbzero_~b.offset_1, #length=|v_#length_1|, ULTIMATE.start_cbzero_#in~length=|v_ULTIMATE.start_cbzero_#in~length_1|, ULTIMATE.start_cbzero_#in~b.base=|v_ULTIMATE.start_cbzero_#in~b.base_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cbzero_#in~b.offset, ULTIMATE.start_cbzero_~b.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_~length, #valid, ULTIMATE.start_cbzero_~b.offset, #length, ULTIMATE.start_cbzero_#in~length, ULTIMATE.start_cbzero_#in~b.base] 3#L13-3true [2020-07-01 12:40:12,477 INFO L796 eck$LassoCheckResult]: Loop: 3#L13-3true [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 8#L13-1true [68] L13-1-->L14: Formula: (and (< 0 |v_ULTIMATE.start_cbzero_#t~post0_6|) (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 10#L14true [77] L14-->L13-3: Formula: (and (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|))) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 3#L13-3true [2020-07-01 12:40:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash 3173258, now seen corresponding path program 1 times [2020-07-01 12:40:12,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:12,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371860217] [2020-07-01 12:40:12,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:12,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:40:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash 78104, now seen corresponding path program 1 times [2020-07-01 12:40:12,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:12,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507274103] [2020-07-01 12:40:12,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:12,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:40:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 45296879, now seen corresponding path program 1 times [2020-07-01 12:40:12,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:12,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358579157] [2020-07-01 12:40:12,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:12,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:40:12,693 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-07-01 12:40:12,768 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:40:12,768 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:40:12,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:40:12,769 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:40:12,769 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:40:12,769 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:12,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:40:12,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:40:12,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 12:40:12,770 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:40:12,770 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:40:12,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:12,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:40:13,270 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:40:13,275 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:13,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:40:13,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:40:13,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:40:13,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:40:13,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:40:13,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:40:13,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:40:13,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:40:13,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:13,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:40:13,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:40:13,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:40:13,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:40:13,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:40:13,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:40:13,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:40:13,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:40:13,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:13,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:40:13,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:40:13,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:40:13,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:40:13,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:40:13,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:40:13,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:40:13,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:13,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:40:13,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:40:13,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:40:13,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:40:13,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:40:13,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:40:13,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:40:13,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:13,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:40:13,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:40:13,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:40:13,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:40:13,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:40:13,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:40:13,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:40:13,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:40:13,525 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-01 12:40:13,526 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:40:13,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:40:13,545 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 12:40:13,545 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:40:13,546 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cbzero_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_1) = -1*ULTIMATE.start_cbzero_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_1 Supporting invariants [] [2020-07-01 12:40:13,592 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-01 12:40:13,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:13,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 12:40:13,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:13,649 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:40:13,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:13,739 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 12:40:13,739 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-07-01 12:40:13,743 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-07-01 12:40:13,744 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. [2020-07-01 12:40:13,836 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 19 states and 32 transitions. Complement of second has 6 states. [2020-07-01 12:40:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 12:40:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 12:40:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-01 12:40:13,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-01 12:40:13,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:40:13,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-01 12:40:13,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:40:13,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-01 12:40:13,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:40:13,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 32 transitions. [2020-07-01 12:40:13,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:40:13,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 7 states and 10 transitions. [2020-07-01 12:40:13,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-01 12:40:13,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-01 12:40:13,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-01 12:40:13,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:40:13,853 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 12:40:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-01 12:40:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-01 12:40:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 12:40:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-01 12:40:13,855 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 12:40:13,855 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 12:40:13,856 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 12:40:13,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-01 12:40:13,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:40:13,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:40:13,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:40:13,857 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:40:13,857 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:40:13,857 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L20: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_10| 0 0) |v_#valid_9|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_5|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~length~0] 100#L20 [45] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 103#L20-2 [61] L20-2-->L23-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 101#L23-1 [66] L23-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_1 v_ULTIMATE.start_cbzero_~b.offset_1) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= |v_ULTIMATE.start_cbzero_#in~b.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_ULTIMATE.start_cbzero_#in~b.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cbzero_#in~length_1| v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_cbzero_~length_1 |v_ULTIMATE.start_cbzero_#in~length_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_cbzero_~b.base_1 |v_ULTIMATE.start_cbzero_#in~b.base_1|) (>= v_ULTIMATE.start_main_~length~0_8 v_ULTIMATE.start_main_~n~0_8) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4|)) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc4.base_4| v_ULTIMATE.start_main_~length~0_8)) (= v_ULTIMATE.start_cbzero_~b.offset_1 |v_ULTIMATE.start_cbzero_#in~b.offset_1|) (= v_ULTIMATE.start_cbzero_~p~0.base_1 v_ULTIMATE.start_cbzero_~b.base_1) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4| 1) |v_#valid_5|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cbzero_#in~b.offset=|v_ULTIMATE.start_cbzero_#in~b.offset_1|, ULTIMATE.start_cbzero_~b.base=v_ULTIMATE.start_cbzero_~b.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_1|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_2|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_2|, ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_1, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_1, #valid=|v_#valid_5|, ULTIMATE.start_cbzero_~b.offset=v_ULTIMATE.start_cbzero_~b.offset_1, #length=|v_#length_1|, ULTIMATE.start_cbzero_#in~length=|v_ULTIMATE.start_cbzero_#in~length_1|, ULTIMATE.start_cbzero_#in~b.base=|v_ULTIMATE.start_cbzero_#in~b.base_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cbzero_#in~b.offset, ULTIMATE.start_cbzero_~b.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_~length, #valid, ULTIMATE.start_cbzero_~b.offset, #length, ULTIMATE.start_cbzero_#in~length, ULTIMATE.start_cbzero_#in~b.base] 97#L13-3 [2020-07-01 12:40:13,858 INFO L796 eck$LassoCheckResult]: Loop: 97#L13-3 [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 98#L13-1 [68] L13-1-->L14: Formula: (and (< 0 |v_ULTIMATE.start_cbzero_#t~post0_6|) (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 102#L14 [77] L14-->L13-3: Formula: (and (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|))) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 97#L13-3 [2020-07-01 12:40:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash 3173257, now seen corresponding path program 1 times [2020-07-01 12:40:13,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:13,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093629317] [2020-07-01 12:40:13,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:13,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093629317] [2020-07-01 12:40:13,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:13,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 12:40:13,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107891690] [2020-07-01 12:40:13,879 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:40:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 78104, now seen corresponding path program 2 times [2020-07-01 12:40:13,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:13,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506802219] [2020-07-01 12:40:13,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:40:13,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:40:13,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:13,948 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-01 12:40:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:13,951 INFO L93 Difference]: Finished difference Result 4 states and 5 transitions. [2020-07-01 12:40:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:13,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 5 transitions. [2020-07-01 12:40:13,954 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:40:13,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 0 states and 0 transitions. [2020-07-01 12:40:13,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 12:40:13,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 12:40:13,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 12:40:13,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:40:13,954 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:40:13,954 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:40:13,954 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:40:13,955 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 12:40:13,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:40:13,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:40:13,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 12:40:13,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:40:13 BasicIcfg [2020-07-01 12:40:13,961 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 12:40:13,963 INFO L168 Benchmark]: Toolchain (without parser) took 5696.60 ms. Allocated memory was 649.6 MB in the beginning and 774.9 MB in the end (delta: 125.3 MB). Free memory was 557.3 MB in the beginning and 721.6 MB in the end (delta: -164.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:40:13,963 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:40:13,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.27 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 557.3 MB in the beginning and 653.4 MB in the end (delta: -96.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:40:13,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.34 ms. Allocated memory is still 691.5 MB. Free memory was 653.4 MB in the beginning and 652.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:40:13,965 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 691.5 MB. Free memory was 652.0 MB in the beginning and 650.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:40:13,965 INFO L168 Benchmark]: RCFGBuilder took 271.22 ms. Allocated memory is still 691.5 MB. Free memory was 650.7 MB in the beginning and 631.2 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:40:13,966 INFO L168 Benchmark]: BlockEncodingV2 took 88.25 ms. Allocated memory is still 691.5 MB. Free memory was 631.2 MB in the beginning and 624.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:40:13,966 INFO L168 Benchmark]: TraceAbstraction took 3419.01 ms. Allocated memory was 691.5 MB in the beginning and 753.4 MB in the end (delta: 61.9 MB). Free memory was 624.5 MB in the beginning and 623.6 MB in the end (delta: 881.8 kB). Peak memory consumption was 62.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:40:13,967 INFO L168 Benchmark]: BuchiAutomizer took 1533.54 ms. Allocated memory was 753.4 MB in the beginning and 774.9 MB in the end (delta: 21.5 MB). Free memory was 623.6 MB in the beginning and 721.6 MB in the end (delta: -98.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:40:13,970 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 19 edges - StatisticsResult: Encoded RCFG 9 locations, 15 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 316.27 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 557.3 MB in the beginning and 653.4 MB in the end (delta: -96.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.34 ms. Allocated memory is still 691.5 MB. Free memory was 653.4 MB in the beginning and 652.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 691.5 MB. Free memory was 652.0 MB in the beginning and 650.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 271.22 ms. Allocated memory is still 691.5 MB. Free memory was 650.7 MB in the beginning and 631.2 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 88.25 ms. Allocated memory is still 691.5 MB. Free memory was 631.2 MB in the beginning and 624.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3419.01 ms. Allocated memory was 691.5 MB in the beginning and 753.4 MB in the end (delta: 61.9 MB). Free memory was 624.5 MB in the beginning and 623.6 MB in the end (delta: 881.8 kB). Peak memory consumption was 62.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1533.54 ms. Allocated memory was 753.4 MB in the beginning and 774.9 MB in the end (delta: 21.5 MB). Free memory was 623.6 MB in the beginning and 721.6 MB in the end (delta: -98.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-07-01 12:40:13,977 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:13,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:13,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:13,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:13,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:13,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:13,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:13,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:40:13,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:40:13,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((1 <= p && 1 <= n) && 1 == \valid[p]) && 1 <= length) && length + p <= unknown-#length-unknown[p]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 <= length) || (((((1 == \valid[p] && 1 <= length) && 1 <= unknown-#StackHeapBarrier-unknown) && n <= 1) && length <= 0) && 0 <= length)) || ((((((0 == p && 1 <= n) && 1 == \valid[p]) && 1 <= length) && length <= unknown-#length-unknown[p]) && 1 <= length) && 1 <= unknown-#StackHeapBarrier-unknown) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 SDtfs, 51 SDslu, 166 SDs, 0 SdLazy, 338 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 76 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 99 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 4875 SizeOfPredicates, 34 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 14/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 43 SDslu, 5 SDs, 0 SdLazy, 31 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp95 ukn94 mio100 lsp59 div100 bol100 ite100 ukn100 eq192 hnf88 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 12:40:05.002 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_Vstyz1/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:40:14.205 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check