/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:52,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:52,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:52,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:52,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:52,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:52,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:52,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:52,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:52,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:52,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:52,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:52,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:52,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:52,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:52,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:52,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:52,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:52,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:52,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:52,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:52,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:52,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:52,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:52,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:52,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:52,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:52,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:52,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:52,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:52,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:52,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:52,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:52,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:52,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:52,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:52,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:52,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:52,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:52,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:52,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:52,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:25:52,679 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:52,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:52,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:52,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:52,685 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:52,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:52,685 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:52,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:52,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:52,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:52,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:52,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:52,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:52,687 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:52,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:52,687 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:52,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:52,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:52,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:52,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:52,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:52,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:52,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:52,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:52,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:52,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:52,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:52,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:52,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:52,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:53,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:53,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:53,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:53,046 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:53,046 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:53,047 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i [2020-07-10 15:25:53,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4503b83/006622e203974278a637a1367b62c73a/FLAGd99107f3b [2020-07-10 15:25:53,670 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:53,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i [2020-07-10 15:25:53,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4503b83/006622e203974278a637a1367b62c73a/FLAGd99107f3b [2020-07-10 15:25:54,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4503b83/006622e203974278a637a1367b62c73a [2020-07-10 15:25:54,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:54,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:54,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:54,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:54,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:54,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1b5dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:54,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:54,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:54,290 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:54,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:54,347 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:54,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54 WrapperNode [2020-07-10 15:25:54,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:54,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:54,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:54,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:54,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:54,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:54,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2020-07-10 15:25:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2020-07-10 15:25:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:55,139 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:55,140 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:25:55,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:55 BoogieIcfgContainer [2020-07-10 15:25:55,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:55,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:55,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:55,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:55,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:54" (1/3) ... [2020-07-10 15:25:55,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4337043d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:55, skipping insertion in model container [2020-07-10 15:25:55,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (2/3) ... [2020-07-10 15:25:55,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4337043d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:55, skipping insertion in model container [2020-07-10 15:25:55,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:55" (3/3) ... [2020-07-10 15:25:55,156 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2020-07-10 15:25:55,169 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:55,179 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:55,196 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:55,222 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:55,223 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:55,223 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:55,223 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:55,223 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:55,223 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:55,224 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:55,224 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-10 15:25:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:25:55,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:55,250 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:55,251 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2020-07-10 15:25:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:55,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201542878] [2020-07-10 15:25:55,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201542878] [2020-07-10 15:25:55,423 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-10 15:25:55,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999388493] [2020-07-10 15:25:55,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 15:25:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-10 15:25:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:55,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2020-07-10 15:25:55,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {40#true} is VALID [2020-07-10 15:25:55,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:25:55,697 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #78#return; {40#true} is VALID [2020-07-10 15:25:55,698 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2020-07-10 15:25:55,698 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {40#true} is VALID [2020-07-10 15:25:55,699 INFO L263 TraceCheckUtils]: 6: Hoare triple {40#true} call init_nondet(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2020-07-10 15:25:55,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {40#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {40#true} is VALID [2020-07-10 15:25:55,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} assume !(~i~0 < 5); {40#true} is VALID [2020-07-10 15:25:55,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:25:55,701 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #82#return; {40#true} is VALID [2020-07-10 15:25:55,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {40#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {40#true} is VALID [2020-07-10 15:25:55,703 INFO L263 TraceCheckUtils]: 12: Hoare triple {40#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2020-07-10 15:25:55,707 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {40#true} is VALID [2020-07-10 15:25:55,710 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-10 15:25:55,711 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {41#false} is VALID [2020-07-10 15:25:55,711 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:25:55,711 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {41#false} {40#true} #84#return; {41#false} is VALID [2020-07-10 15:25:55,712 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {41#false} is VALID [2020-07-10 15:25:55,712 INFO L263 TraceCheckUtils]: 19: Hoare triple {41#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2020-07-10 15:25:55,713 INFO L280 TraceCheckUtils]: 20: Hoare triple {41#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {41#false} is VALID [2020-07-10 15:25:55,713 INFO L280 TraceCheckUtils]: 21: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-10 15:25:55,714 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {41#false} is VALID [2020-07-10 15:25:55,714 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:25:55,715 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {41#false} {41#false} #86#return; {41#false} is VALID [2020-07-10 15:25:55,716 INFO L280 TraceCheckUtils]: 25: Hoare triple {41#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {41#false} is VALID [2020-07-10 15:25:55,716 INFO L280 TraceCheckUtils]: 26: Hoare triple {41#false} assume !(~i~2 < 4); {41#false} is VALID [2020-07-10 15:25:55,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {41#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {41#false} is VALID [2020-07-10 15:25:55,717 INFO L263 TraceCheckUtils]: 28: Hoare triple {41#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2020-07-10 15:25:55,717 INFO L280 TraceCheckUtils]: 29: Hoare triple {41#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {41#false} is VALID [2020-07-10 15:25:55,718 INFO L280 TraceCheckUtils]: 30: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-10 15:25:55,718 INFO L280 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {41#false} is VALID [2020-07-10 15:25:55,718 INFO L280 TraceCheckUtils]: 32: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:25:55,719 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {41#false} {41#false} #88#return; {41#false} is VALID [2020-07-10 15:25:55,719 INFO L280 TraceCheckUtils]: 34: Hoare triple {41#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {41#false} is VALID [2020-07-10 15:25:55,719 INFO L280 TraceCheckUtils]: 35: Hoare triple {41#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {41#false} is VALID [2020-07-10 15:25:55,720 INFO L280 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-10 15:25:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-10 15:25:55,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:55,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:25:55,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745891578] [2020-07-10 15:25:55,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-07-10 15:25:55,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:55,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:25:55,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:25:55,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:25:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:25:55,860 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-10 15:25:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,024 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2020-07-10 15:25:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:25:56,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-07-10 15:25:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:25:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2020-07-10 15:25:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:25:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2020-07-10 15:25:56,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2020-07-10 15:25:56,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,231 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:25:56,232 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:25:56,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:25:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:25:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 15:25:56,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 15:25:56,292 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 15:25:56,292 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 15:25:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,299 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:25:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:25:56,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,301 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 15:25:56,301 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 15:25:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,308 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:25:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:25:56,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:25:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-10 15:25:56,319 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2020-07-10 15:25:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,320 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-10 15:25:56,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:25:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:25:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:25:56,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,323 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:56,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-10 15:25:56,538 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2020-07-10 15:25:56,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232105183] [2020-07-10 15:25:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,578 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:25:56,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55958375] [2020-07-10 15:25:56,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 15:25:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:56,758 INFO L263 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2020-07-10 15:25:56,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {344#true} is VALID [2020-07-10 15:25:56,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-10 15:25:56,759 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #78#return; {344#true} is VALID [2020-07-10 15:25:56,759 INFO L263 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret12 := main(); {344#true} is VALID [2020-07-10 15:25:56,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {344#true} is VALID [2020-07-10 15:25:56,760 INFO L263 TraceCheckUtils]: 6: Hoare triple {344#true} call init_nondet(~#x~0.base, ~#x~0.offset); {344#true} is VALID [2020-07-10 15:25:56,761 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {370#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:56,762 INFO L280 TraceCheckUtils]: 8: Hoare triple {370#(<= init_nondet_~i~0 0)} assume !(~i~0 < 5); {345#false} is VALID [2020-07-10 15:25:56,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-10 15:25:56,763 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {345#false} {344#true} #82#return; {345#false} is VALID [2020-07-10 15:25:56,763 INFO L280 TraceCheckUtils]: 11: Hoare triple {345#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {345#false} is VALID [2020-07-10 15:25:56,764 INFO L263 TraceCheckUtils]: 12: Hoare triple {345#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-10 15:25:56,764 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {345#false} is VALID [2020-07-10 15:25:56,764 INFO L280 TraceCheckUtils]: 14: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-10 15:25:56,765 INFO L280 TraceCheckUtils]: 15: Hoare triple {345#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {345#false} is VALID [2020-07-10 15:25:56,765 INFO L280 TraceCheckUtils]: 16: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-10 15:25:56,766 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {345#false} {345#false} #84#return; {345#false} is VALID [2020-07-10 15:25:56,766 INFO L280 TraceCheckUtils]: 18: Hoare triple {345#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {345#false} is VALID [2020-07-10 15:25:56,766 INFO L263 TraceCheckUtils]: 19: Hoare triple {345#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-10 15:25:56,767 INFO L280 TraceCheckUtils]: 20: Hoare triple {345#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {345#false} is VALID [2020-07-10 15:25:56,767 INFO L280 TraceCheckUtils]: 21: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-10 15:25:56,767 INFO L280 TraceCheckUtils]: 22: Hoare triple {345#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {345#false} is VALID [2020-07-10 15:25:56,768 INFO L280 TraceCheckUtils]: 23: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-10 15:25:56,768 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {345#false} {345#false} #86#return; {345#false} is VALID [2020-07-10 15:25:56,768 INFO L280 TraceCheckUtils]: 25: Hoare triple {345#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {345#false} is VALID [2020-07-10 15:25:56,769 INFO L280 TraceCheckUtils]: 26: Hoare triple {345#false} assume !(~i~2 < 4); {345#false} is VALID [2020-07-10 15:25:56,769 INFO L280 TraceCheckUtils]: 27: Hoare triple {345#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {345#false} is VALID [2020-07-10 15:25:56,769 INFO L263 TraceCheckUtils]: 28: Hoare triple {345#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-10 15:25:56,770 INFO L280 TraceCheckUtils]: 29: Hoare triple {345#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {345#false} is VALID [2020-07-10 15:25:56,770 INFO L280 TraceCheckUtils]: 30: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-10 15:25:56,770 INFO L280 TraceCheckUtils]: 31: Hoare triple {345#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {345#false} is VALID [2020-07-10 15:25:56,771 INFO L280 TraceCheckUtils]: 32: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-10 15:25:56,771 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {345#false} {345#false} #88#return; {345#false} is VALID [2020-07-10 15:25:56,771 INFO L280 TraceCheckUtils]: 34: Hoare triple {345#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {345#false} is VALID [2020-07-10 15:25:56,772 INFO L280 TraceCheckUtils]: 35: Hoare triple {345#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {345#false} is VALID [2020-07-10 15:25:56,772 INFO L280 TraceCheckUtils]: 36: Hoare triple {345#false} assume !false; {345#false} is VALID [2020-07-10 15:25:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:25:56,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232105183] [2020-07-10 15:25:56,775 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:25:56,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55958375] [2020-07-10 15:25:56,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:56,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:56,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661111798] [2020-07-10 15:25:56,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 15:25:56,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:56,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:56,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:56,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:56,822 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2020-07-10 15:25:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,940 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-07-10 15:25:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:56,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 15:25:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-10 15:25:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-10 15:25:56,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2020-07-10 15:25:57,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,064 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:25:57,065 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 15:25:57,066 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-10 15:25:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 15:25:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-10 15:25:57,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-10 15:25:57,084 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-10 15:25:57,084 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-10 15:25:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,089 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-10 15:25:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-10 15:25:57,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,091 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-10 15:25:57,091 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-10 15:25:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,096 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-10 15:25:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-10 15:25:57,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:25:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-07-10 15:25:57,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2020-07-10 15:25:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,102 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-10 15:25:57,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-10 15:25:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 15:25:57,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,104 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:57,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:57,320 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,322 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2020-07-10 15:25:57,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316383358] [2020-07-10 15:25:57,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,343 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:25:57,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186850492] [2020-07-10 15:25:57,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 15:25:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:57,489 INFO L263 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2020-07-10 15:25:57,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2020-07-10 15:25:57,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-10 15:25:57,491 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #78#return; {648#true} is VALID [2020-07-10 15:25:57,491 INFO L263 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret12 := main(); {648#true} is VALID [2020-07-10 15:25:57,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {648#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {648#true} is VALID [2020-07-10 15:25:57,492 INFO L263 TraceCheckUtils]: 6: Hoare triple {648#true} call init_nondet(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2020-07-10 15:25:57,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {648#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {648#true} is VALID [2020-07-10 15:25:57,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {648#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {648#true} is VALID [2020-07-10 15:25:57,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {648#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {648#true} is VALID [2020-07-10 15:25:57,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(~i~0 < 5); {648#true} is VALID [2020-07-10 15:25:57,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-10 15:25:57,495 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {648#true} {648#true} #82#return; {648#true} is VALID [2020-07-10 15:25:57,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {648#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {648#true} is VALID [2020-07-10 15:25:57,496 INFO L263 TraceCheckUtils]: 14: Hoare triple {648#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2020-07-10 15:25:57,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {648#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {698#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:25:57,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {698#(<= rangesum_~i~1 0)} assume !(~i~1 < 5); {649#false} is VALID [2020-07-10 15:25:57,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {649#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {649#false} is VALID [2020-07-10 15:25:57,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-10 15:25:57,499 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {649#false} {648#true} #84#return; {649#false} is VALID [2020-07-10 15:25:57,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {649#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {649#false} is VALID [2020-07-10 15:25:57,500 INFO L263 TraceCheckUtils]: 21: Hoare triple {649#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2020-07-10 15:25:57,501 INFO L280 TraceCheckUtils]: 22: Hoare triple {649#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {649#false} is VALID [2020-07-10 15:25:57,501 INFO L280 TraceCheckUtils]: 23: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2020-07-10 15:25:57,501 INFO L280 TraceCheckUtils]: 24: Hoare triple {649#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {649#false} is VALID [2020-07-10 15:25:57,502 INFO L280 TraceCheckUtils]: 25: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-10 15:25:57,502 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {649#false} {649#false} #86#return; {649#false} is VALID [2020-07-10 15:25:57,503 INFO L280 TraceCheckUtils]: 27: Hoare triple {649#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {649#false} is VALID [2020-07-10 15:25:57,503 INFO L280 TraceCheckUtils]: 28: Hoare triple {649#false} assume !(~i~2 < 4); {649#false} is VALID [2020-07-10 15:25:57,503 INFO L280 TraceCheckUtils]: 29: Hoare triple {649#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {649#false} is VALID [2020-07-10 15:25:57,504 INFO L263 TraceCheckUtils]: 30: Hoare triple {649#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2020-07-10 15:25:57,504 INFO L280 TraceCheckUtils]: 31: Hoare triple {649#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {649#false} is VALID [2020-07-10 15:25:57,504 INFO L280 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2020-07-10 15:25:57,505 INFO L280 TraceCheckUtils]: 33: Hoare triple {649#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {649#false} is VALID [2020-07-10 15:25:57,505 INFO L280 TraceCheckUtils]: 34: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-10 15:25:57,506 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {649#false} {649#false} #88#return; {649#false} is VALID [2020-07-10 15:25:57,506 INFO L280 TraceCheckUtils]: 36: Hoare triple {649#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {649#false} is VALID [2020-07-10 15:25:57,506 INFO L280 TraceCheckUtils]: 37: Hoare triple {649#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {649#false} is VALID [2020-07-10 15:25:57,507 INFO L280 TraceCheckUtils]: 38: Hoare triple {649#false} assume !false; {649#false} is VALID [2020-07-10 15:25:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:25:57,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316383358] [2020-07-10 15:25:57,512 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:25:57,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186850492] [2020-07-10 15:25:57,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:57,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:57,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137033165] [2020-07-10 15:25:57,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-10 15:25:57,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:57,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:57,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:57,574 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2020-07-10 15:25:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,720 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-10 15:25:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:57,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-10 15:25:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-10 15:25:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-10 15:25:57,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2020-07-10 15:25:57,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,830 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:25:57,831 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:25:57,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-10 15:25:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:25:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-10 15:25:57,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-10 15:25:57,846 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-10 15:25:57,846 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-10 15:25:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,849 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-10 15:25:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-10 15:25:57,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,850 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-10 15:25:57,850 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-10 15:25:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,854 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-10 15:25:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-10 15:25:57,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:25:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-07-10 15:25:57,859 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2020-07-10 15:25:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,860 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-07-10 15:25:57,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-10 15:25:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:25:57,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,862 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:58,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,077 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2020-07-10 15:25:58,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963940555] [2020-07-10 15:25:58,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,099 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:25:58,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408717190] [2020-07-10 15:25:58,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 15:25:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:58,274 INFO L263 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2020-07-10 15:25:58,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {963#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {963#true} is VALID [2020-07-10 15:25:58,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-10 15:25:58,275 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #78#return; {963#true} is VALID [2020-07-10 15:25:58,276 INFO L263 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret12 := main(); {963#true} is VALID [2020-07-10 15:25:58,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {963#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {963#true} is VALID [2020-07-10 15:25:58,277 INFO L263 TraceCheckUtils]: 6: Hoare triple {963#true} call init_nondet(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-10 15:25:58,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {963#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {963#true} is VALID [2020-07-10 15:25:58,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {963#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {963#true} is VALID [2020-07-10 15:25:58,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {963#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {963#true} is VALID [2020-07-10 15:25:58,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {963#true} assume !(~i~0 < 5); {963#true} is VALID [2020-07-10 15:25:58,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-10 15:25:58,279 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {963#true} {963#true} #82#return; {963#true} is VALID [2020-07-10 15:25:58,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {963#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {963#true} is VALID [2020-07-10 15:25:58,279 INFO L263 TraceCheckUtils]: 14: Hoare triple {963#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-10 15:25:58,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {963#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {963#true} is VALID [2020-07-10 15:25:58,280 INFO L280 TraceCheckUtils]: 16: Hoare triple {963#true} assume !!(~i~1 < 5); {963#true} is VALID [2020-07-10 15:25:58,280 INFO L280 TraceCheckUtils]: 17: Hoare triple {963#true} assume !(~i~1 > 2); {963#true} is VALID [2020-07-10 15:25:58,280 INFO L280 TraceCheckUtils]: 18: Hoare triple {963#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {963#true} is VALID [2020-07-10 15:25:58,281 INFO L280 TraceCheckUtils]: 19: Hoare triple {963#true} assume !(~i~1 < 5); {963#true} is VALID [2020-07-10 15:25:58,281 INFO L280 TraceCheckUtils]: 20: Hoare triple {963#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {963#true} is VALID [2020-07-10 15:25:58,281 INFO L280 TraceCheckUtils]: 21: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-10 15:25:58,281 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {963#true} {963#true} #84#return; {963#true} is VALID [2020-07-10 15:25:58,282 INFO L280 TraceCheckUtils]: 23: Hoare triple {963#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {963#true} is VALID [2020-07-10 15:25:58,282 INFO L263 TraceCheckUtils]: 24: Hoare triple {963#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-10 15:25:58,282 INFO L280 TraceCheckUtils]: 25: Hoare triple {963#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {963#true} is VALID [2020-07-10 15:25:58,283 INFO L280 TraceCheckUtils]: 26: Hoare triple {963#true} assume !!(~i~1 < 5); {963#true} is VALID [2020-07-10 15:25:58,283 INFO L280 TraceCheckUtils]: 27: Hoare triple {963#true} assume !(~i~1 > 2); {963#true} is VALID [2020-07-10 15:25:58,283 INFO L280 TraceCheckUtils]: 28: Hoare triple {963#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {963#true} is VALID [2020-07-10 15:25:58,283 INFO L280 TraceCheckUtils]: 29: Hoare triple {963#true} assume !(~i~1 < 5); {963#true} is VALID [2020-07-10 15:25:58,284 INFO L280 TraceCheckUtils]: 30: Hoare triple {963#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {963#true} is VALID [2020-07-10 15:25:58,284 INFO L280 TraceCheckUtils]: 31: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-10 15:25:58,285 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {963#true} {963#true} #86#return; {963#true} is VALID [2020-07-10 15:25:58,293 INFO L280 TraceCheckUtils]: 33: Hoare triple {963#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1067#(<= main_~i~2 0)} is VALID [2020-07-10 15:25:58,300 INFO L280 TraceCheckUtils]: 34: Hoare triple {1067#(<= main_~i~2 0)} assume !(~i~2 < 4); {964#false} is VALID [2020-07-10 15:25:58,300 INFO L280 TraceCheckUtils]: 35: Hoare triple {964#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {964#false} is VALID [2020-07-10 15:25:58,301 INFO L263 TraceCheckUtils]: 36: Hoare triple {964#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {964#false} is VALID [2020-07-10 15:25:58,301 INFO L280 TraceCheckUtils]: 37: Hoare triple {964#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {964#false} is VALID [2020-07-10 15:25:58,301 INFO L280 TraceCheckUtils]: 38: Hoare triple {964#false} assume !!(~i~1 < 5); {964#false} is VALID [2020-07-10 15:25:58,301 INFO L280 TraceCheckUtils]: 39: Hoare triple {964#false} assume !(~i~1 > 2); {964#false} is VALID [2020-07-10 15:25:58,301 INFO L280 TraceCheckUtils]: 40: Hoare triple {964#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {964#false} is VALID [2020-07-10 15:25:58,302 INFO L280 TraceCheckUtils]: 41: Hoare triple {964#false} assume !(~i~1 < 5); {964#false} is VALID [2020-07-10 15:25:58,302 INFO L280 TraceCheckUtils]: 42: Hoare triple {964#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {964#false} is VALID [2020-07-10 15:25:58,302 INFO L280 TraceCheckUtils]: 43: Hoare triple {964#false} assume true; {964#false} is VALID [2020-07-10 15:25:58,302 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {964#false} {964#false} #88#return; {964#false} is VALID [2020-07-10 15:25:58,303 INFO L280 TraceCheckUtils]: 45: Hoare triple {964#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {964#false} is VALID [2020-07-10 15:25:58,303 INFO L280 TraceCheckUtils]: 46: Hoare triple {964#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {964#false} is VALID [2020-07-10 15:25:58,303 INFO L280 TraceCheckUtils]: 47: Hoare triple {964#false} assume !false; {964#false} is VALID [2020-07-10 15:25:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-10 15:25:58,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963940555] [2020-07-10 15:25:58,306 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:25:58,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408717190] [2020-07-10 15:25:58,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:58,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:58,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582273900] [2020-07-10 15:25:58,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-10 15:25:58,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:58,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:58,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:58,366 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2020-07-10 15:25:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,618 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-10 15:25:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:58,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-10 15:25:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-10 15:25:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-10 15:25:58,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2020-07-10 15:25:58,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,700 INFO L225 Difference]: With dead ends: 52 [2020-07-10 15:25:58,700 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:25:58,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-10 15:25:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:25:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-10 15:25:58,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:58,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-10 15:25:58,714 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-10 15:25:58,714 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-10 15:25:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,718 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:25:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:25:58,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,720 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-10 15:25:58,720 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-10 15:25:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,727 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:25:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:25:58,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:58,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:25:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2020-07-10 15:25:58,733 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 48 [2020-07-10 15:25:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:58,734 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2020-07-10 15:25:58,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-10 15:25:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:25:58,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:58,735 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:58,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,945 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,946 INFO L82 PathProgramCache]: Analyzing trace with hash 494084840, now seen corresponding path program 1 times [2020-07-10 15:25:58,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831299988] [2020-07-10 15:25:58,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,965 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:25:58,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472213702] [2020-07-10 15:25:58,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 15:25:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:25:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:59,126 INFO L263 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2020-07-10 15:25:59,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {1307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1307#true} is VALID [2020-07-10 15:25:59,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-10 15:25:59,127 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #78#return; {1307#true} is VALID [2020-07-10 15:25:59,127 INFO L263 TraceCheckUtils]: 4: Hoare triple {1307#true} call #t~ret12 := main(); {1307#true} is VALID [2020-07-10 15:25:59,127 INFO L280 TraceCheckUtils]: 5: Hoare triple {1307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1307#true} is VALID [2020-07-10 15:25:59,128 INFO L263 TraceCheckUtils]: 6: Hoare triple {1307#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1307#true} is VALID [2020-07-10 15:25:59,128 INFO L280 TraceCheckUtils]: 7: Hoare triple {1307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1307#true} is VALID [2020-07-10 15:25:59,128 INFO L280 TraceCheckUtils]: 8: Hoare triple {1307#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1307#true} is VALID [2020-07-10 15:25:59,128 INFO L280 TraceCheckUtils]: 9: Hoare triple {1307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1307#true} is VALID [2020-07-10 15:25:59,129 INFO L280 TraceCheckUtils]: 10: Hoare triple {1307#true} assume !(~i~0 < 5); {1307#true} is VALID [2020-07-10 15:25:59,129 INFO L280 TraceCheckUtils]: 11: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-10 15:25:59,129 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1307#true} {1307#true} #82#return; {1307#true} is VALID [2020-07-10 15:25:59,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {1307#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1307#true} is VALID [2020-07-10 15:25:59,130 INFO L263 TraceCheckUtils]: 14: Hoare triple {1307#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1307#true} is VALID [2020-07-10 15:25:59,131 INFO L280 TraceCheckUtils]: 15: Hoare triple {1307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:59,132 INFO L280 TraceCheckUtils]: 16: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !!(~i~1 < 5); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:59,133 INFO L280 TraceCheckUtils]: 17: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !(~i~1 > 2); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:59,133 INFO L280 TraceCheckUtils]: 18: Hoare triple {1357#(= 0 rangesum_~cnt~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:59,134 INFO L280 TraceCheckUtils]: 19: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !(~i~1 < 5); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-10 15:25:59,135 INFO L280 TraceCheckUtils]: 20: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {1308#false} is VALID [2020-07-10 15:25:59,135 INFO L280 TraceCheckUtils]: 21: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-10 15:25:59,135 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1308#false} {1307#true} #84#return; {1308#false} is VALID [2020-07-10 15:25:59,136 INFO L280 TraceCheckUtils]: 23: Hoare triple {1308#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1308#false} is VALID [2020-07-10 15:25:59,136 INFO L263 TraceCheckUtils]: 24: Hoare triple {1308#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1308#false} is VALID [2020-07-10 15:25:59,136 INFO L280 TraceCheckUtils]: 25: Hoare triple {1308#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1308#false} is VALID [2020-07-10 15:25:59,137 INFO L280 TraceCheckUtils]: 26: Hoare triple {1308#false} assume !!(~i~1 < 5); {1308#false} is VALID [2020-07-10 15:25:59,137 INFO L280 TraceCheckUtils]: 27: Hoare triple {1308#false} assume !(~i~1 > 2); {1308#false} is VALID [2020-07-10 15:25:59,137 INFO L280 TraceCheckUtils]: 28: Hoare triple {1308#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1308#false} is VALID [2020-07-10 15:25:59,137 INFO L280 TraceCheckUtils]: 29: Hoare triple {1308#false} assume !(~i~1 < 5); {1308#false} is VALID [2020-07-10 15:25:59,138 INFO L280 TraceCheckUtils]: 30: Hoare triple {1308#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {1308#false} is VALID [2020-07-10 15:25:59,138 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-10 15:25:59,138 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1308#false} {1308#false} #86#return; {1308#false} is VALID [2020-07-10 15:25:59,138 INFO L280 TraceCheckUtils]: 33: Hoare triple {1308#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1308#false} is VALID [2020-07-10 15:25:59,139 INFO L280 TraceCheckUtils]: 34: Hoare triple {1308#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1308#false} is VALID [2020-07-10 15:25:59,139 INFO L280 TraceCheckUtils]: 35: Hoare triple {1308#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1308#false} is VALID [2020-07-10 15:25:59,139 INFO L280 TraceCheckUtils]: 36: Hoare triple {1308#false} assume !(~i~2 < 4); {1308#false} is VALID [2020-07-10 15:25:59,140 INFO L280 TraceCheckUtils]: 37: Hoare triple {1308#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1308#false} is VALID [2020-07-10 15:25:59,140 INFO L263 TraceCheckUtils]: 38: Hoare triple {1308#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1308#false} is VALID [2020-07-10 15:25:59,140 INFO L280 TraceCheckUtils]: 39: Hoare triple {1308#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1308#false} is VALID [2020-07-10 15:25:59,140 INFO L280 TraceCheckUtils]: 40: Hoare triple {1308#false} assume !!(~i~1 < 5); {1308#false} is VALID [2020-07-10 15:25:59,141 INFO L280 TraceCheckUtils]: 41: Hoare triple {1308#false} assume !(~i~1 > 2); {1308#false} is VALID [2020-07-10 15:25:59,141 INFO L280 TraceCheckUtils]: 42: Hoare triple {1308#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1308#false} is VALID [2020-07-10 15:25:59,141 INFO L280 TraceCheckUtils]: 43: Hoare triple {1308#false} assume !(~i~1 < 5); {1308#false} is VALID [2020-07-10 15:25:59,142 INFO L280 TraceCheckUtils]: 44: Hoare triple {1308#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {1308#false} is VALID [2020-07-10 15:25:59,142 INFO L280 TraceCheckUtils]: 45: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-10 15:25:59,142 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1308#false} {1308#false} #88#return; {1308#false} is VALID [2020-07-10 15:25:59,142 INFO L280 TraceCheckUtils]: 47: Hoare triple {1308#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1308#false} is VALID [2020-07-10 15:25:59,143 INFO L280 TraceCheckUtils]: 48: Hoare triple {1308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1308#false} is VALID [2020-07-10 15:25:59,143 INFO L280 TraceCheckUtils]: 49: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2020-07-10 15:25:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-10 15:25:59,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831299988] [2020-07-10 15:25:59,161 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:25:59,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472213702] [2020-07-10 15:25:59,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:59,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:59,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585670352] [2020-07-10 15:25:59,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 15:25:59,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:59,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:59,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:59,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:59,215 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2020-07-10 15:25:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,331 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2020-07-10 15:25:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:59,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 15:25:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-10 15:25:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-10 15:25:59,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-10 15:25:59,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,446 INFO L225 Difference]: With dead ends: 63 [2020-07-10 15:25:59,446 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:25:59,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-10 15:25:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:25:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-10 15:25:59,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:59,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-10 15:25:59,469 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-10 15:25:59,470 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-10 15:25:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,473 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-10 15:25:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-10 15:25:59,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,473 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-10 15:25:59,474 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-10 15:25:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,476 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-10 15:25:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-10 15:25:59,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:59,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:25:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 15:25:59,480 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 50 [2020-07-10 15:25:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:59,480 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 15:25:59,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 15:25:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:25:59,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:59,483 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:59,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:59,692 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2020-07-10 15:25:59,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:59,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891040845] [2020-07-10 15:25:59,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {1722#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1687#true} is VALID [2020-07-10 15:25:59,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:25:59,811 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-10 15:25:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {1723#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1724#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:59,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {1724#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1724#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:25:59,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {1724#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1725#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:25:59,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-10 15:25:59,874 INFO L280 TraceCheckUtils]: 4: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:25:59,875 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-10 15:25:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1687#true} is VALID [2020-07-10 15:25:59,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:25:59,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-10 15:25:59,903 INFO L280 TraceCheckUtils]: 3: Hoare triple {1687#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1687#true} is VALID [2020-07-10 15:25:59,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:25:59,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-10 15:25:59,904 INFO L280 TraceCheckUtils]: 6: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:25:59,905 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1687#true} {1688#false} #84#return; {1688#false} is VALID [2020-07-10 15:25:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:25:59,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:25:59,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:00,002 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1727#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:00,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {1727#(<= rangesum_~i~1 1)} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-10 15:26:00,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,005 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-10 15:26:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1687#true} is VALID [2020-07-10 15:26:00,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:26:00,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-10 15:26:00,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {1687#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1687#true} is VALID [2020-07-10 15:26:00,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:26:00,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-10 15:26:00,049 INFO L280 TraceCheckUtils]: 6: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:26:00,050 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1687#true} {1688#false} #88#return; {1688#false} is VALID [2020-07-10 15:26:00,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1722#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:00,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {1722#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1687#true} is VALID [2020-07-10 15:26:00,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:26:00,053 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-10 15:26:00,054 INFO L263 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret12 := main(); {1687#true} is VALID [2020-07-10 15:26:00,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1687#true} is VALID [2020-07-10 15:26:00,056 INFO L263 TraceCheckUtils]: 6: Hoare triple {1687#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1723#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:00,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {1723#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1724#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:00,059 INFO L280 TraceCheckUtils]: 8: Hoare triple {1724#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1724#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:00,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {1724#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1725#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:00,063 INFO L280 TraceCheckUtils]: 10: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-10 15:26:00,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,064 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-10 15:26:00,064 INFO L280 TraceCheckUtils]: 13: Hoare triple {1688#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1688#false} is VALID [2020-07-10 15:26:00,064 INFO L263 TraceCheckUtils]: 14: Hoare triple {1688#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-10 15:26:00,065 INFO L280 TraceCheckUtils]: 15: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1687#true} is VALID [2020-07-10 15:26:00,065 INFO L280 TraceCheckUtils]: 16: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:26:00,065 INFO L280 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-10 15:26:00,066 INFO L280 TraceCheckUtils]: 18: Hoare triple {1687#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1687#true} is VALID [2020-07-10 15:26:00,066 INFO L280 TraceCheckUtils]: 19: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:26:00,066 INFO L280 TraceCheckUtils]: 20: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-10 15:26:00,066 INFO L280 TraceCheckUtils]: 21: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:26:00,067 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1687#true} {1688#false} #84#return; {1688#false} is VALID [2020-07-10 15:26:00,067 INFO L280 TraceCheckUtils]: 23: Hoare triple {1688#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1688#false} is VALID [2020-07-10 15:26:00,067 INFO L263 TraceCheckUtils]: 24: Hoare triple {1688#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-10 15:26:00,068 INFO L280 TraceCheckUtils]: 25: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:00,069 INFO L280 TraceCheckUtils]: 26: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:00,070 INFO L280 TraceCheckUtils]: 27: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:00,072 INFO L280 TraceCheckUtils]: 28: Hoare triple {1726#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1727#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:00,073 INFO L280 TraceCheckUtils]: 29: Hoare triple {1727#(<= rangesum_~i~1 1)} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,073 INFO L280 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-10 15:26:00,073 INFO L280 TraceCheckUtils]: 31: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,074 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-10 15:26:00,074 INFO L280 TraceCheckUtils]: 33: Hoare triple {1688#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1688#false} is VALID [2020-07-10 15:26:00,074 INFO L280 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1688#false} is VALID [2020-07-10 15:26:00,075 INFO L280 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1688#false} is VALID [2020-07-10 15:26:00,075 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~i~2 < 4); {1688#false} is VALID [2020-07-10 15:26:00,075 INFO L280 TraceCheckUtils]: 37: Hoare triple {1688#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1688#false} is VALID [2020-07-10 15:26:00,075 INFO L263 TraceCheckUtils]: 38: Hoare triple {1688#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-10 15:26:00,076 INFO L280 TraceCheckUtils]: 39: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1687#true} is VALID [2020-07-10 15:26:00,076 INFO L280 TraceCheckUtils]: 40: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:26:00,076 INFO L280 TraceCheckUtils]: 41: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-10 15:26:00,077 INFO L280 TraceCheckUtils]: 42: Hoare triple {1687#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1687#true} is VALID [2020-07-10 15:26:00,077 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-10 15:26:00,077 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-10 15:26:00,077 INFO L280 TraceCheckUtils]: 45: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:26:00,078 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1687#true} {1688#false} #88#return; {1688#false} is VALID [2020-07-10 15:26:00,078 INFO L280 TraceCheckUtils]: 47: Hoare triple {1688#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1688#false} is VALID [2020-07-10 15:26:00,078 INFO L280 TraceCheckUtils]: 48: Hoare triple {1688#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1688#false} is VALID [2020-07-10 15:26:00,078 INFO L280 TraceCheckUtils]: 49: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2020-07-10 15:26:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:26:00,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891040845] [2020-07-10 15:26:00,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721206885] [2020-07-10 15:26:00,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:00,233 INFO L263 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2020-07-10 15:26:00,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1687#true} is VALID [2020-07-10 15:26:00,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-10 15:26:00,234 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-10 15:26:00,234 INFO L263 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret12 := main(); {1687#true} is VALID [2020-07-10 15:26:00,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1687#true} is VALID [2020-07-10 15:26:00,234 INFO L263 TraceCheckUtils]: 6: Hoare triple {1687#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-10 15:26:00,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {1687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1724#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:00,241 INFO L280 TraceCheckUtils]: 8: Hoare triple {1724#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1724#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:00,243 INFO L280 TraceCheckUtils]: 9: Hoare triple {1724#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1725#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:00,244 INFO L280 TraceCheckUtils]: 10: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-10 15:26:00,244 INFO L280 TraceCheckUtils]: 11: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,244 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-10 15:26:00,245 INFO L280 TraceCheckUtils]: 13: Hoare triple {1688#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1688#false} is VALID [2020-07-10 15:26:00,245 INFO L263 TraceCheckUtils]: 14: Hoare triple {1688#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-10 15:26:00,245 INFO L280 TraceCheckUtils]: 15: Hoare triple {1688#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1688#false} is VALID [2020-07-10 15:26:00,245 INFO L280 TraceCheckUtils]: 16: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,246 INFO L280 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-10 15:26:00,246 INFO L280 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2020-07-10 15:26:00,246 INFO L280 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,246 INFO L280 TraceCheckUtils]: 20: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-10 15:26:00,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,247 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1688#false} {1688#false} #84#return; {1688#false} is VALID [2020-07-10 15:26:00,247 INFO L280 TraceCheckUtils]: 23: Hoare triple {1688#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1688#false} is VALID [2020-07-10 15:26:00,247 INFO L263 TraceCheckUtils]: 24: Hoare triple {1688#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-10 15:26:00,247 INFO L280 TraceCheckUtils]: 25: Hoare triple {1688#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1688#false} is VALID [2020-07-10 15:26:00,247 INFO L280 TraceCheckUtils]: 26: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,248 INFO L280 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-10 15:26:00,248 INFO L280 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2020-07-10 15:26:00,248 INFO L280 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,248 INFO L280 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-10 15:26:00,248 INFO L280 TraceCheckUtils]: 31: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,248 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-10 15:26:00,249 INFO L280 TraceCheckUtils]: 33: Hoare triple {1688#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1688#false} is VALID [2020-07-10 15:26:00,249 INFO L280 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1688#false} is VALID [2020-07-10 15:26:00,249 INFO L280 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1688#false} is VALID [2020-07-10 15:26:00,249 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~i~2 < 4); {1688#false} is VALID [2020-07-10 15:26:00,249 INFO L280 TraceCheckUtils]: 37: Hoare triple {1688#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1688#false} is VALID [2020-07-10 15:26:00,249 INFO L263 TraceCheckUtils]: 38: Hoare triple {1688#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-10 15:26:00,250 INFO L280 TraceCheckUtils]: 39: Hoare triple {1688#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1688#false} is VALID [2020-07-10 15:26:00,250 INFO L280 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,250 INFO L280 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-10 15:26:00,250 INFO L280 TraceCheckUtils]: 42: Hoare triple {1688#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2020-07-10 15:26:00,250 INFO L280 TraceCheckUtils]: 43: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-10 15:26:00,251 INFO L280 TraceCheckUtils]: 44: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-10 15:26:00,251 INFO L280 TraceCheckUtils]: 45: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-10 15:26:00,251 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1688#false} {1688#false} #88#return; {1688#false} is VALID [2020-07-10 15:26:00,251 INFO L280 TraceCheckUtils]: 47: Hoare triple {1688#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1688#false} is VALID [2020-07-10 15:26:00,252 INFO L280 TraceCheckUtils]: 48: Hoare triple {1688#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1688#false} is VALID [2020-07-10 15:26:00,252 INFO L280 TraceCheckUtils]: 49: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2020-07-10 15:26:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-10 15:26:00,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 8 [2020-07-10 15:26:00,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141133226] [2020-07-10 15:26:00,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-07-10 15:26:00,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:00,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:26:00,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:26:00,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:26:00,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:26:00,324 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 8 states. [2020-07-10 15:26:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,491 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2020-07-10 15:26:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:26:01,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-07-10 15:26:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:26:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-10 15:26:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:26:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-10 15:26:01,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-10 15:26:01,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:01,621 INFO L225 Difference]: With dead ends: 76 [2020-07-10 15:26:01,622 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 15:26:01,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 15:26:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-10 15:26:01,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:01,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-10 15:26:01,680 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-10 15:26:01,681 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-10 15:26:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,685 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 15:26:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 15:26:01,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:01,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:01,687 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-10 15:26:01,687 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-10 15:26:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:01,690 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 15:26:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 15:26:01,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:01,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:01,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:01,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:26:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-10 15:26:01,696 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 50 [2020-07-10 15:26:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:01,697 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-10 15:26:01,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:26:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-10 15:26:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-10 15:26:01,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:01,700 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:01,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,908 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1369912335, now seen corresponding path program 2 times [2020-07-10 15:26:01,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:01,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979791722] [2020-07-10 15:26:01,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {2198#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2152#true} is VALID [2020-07-10 15:26:01,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:01,996 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-10 15:26:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {2199#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2200#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:02,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {2200#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2200#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:02,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {2200#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2201#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:02,049 INFO L280 TraceCheckUtils]: 3: Hoare triple {2201#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2201#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:02,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {2201#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2202#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:02,050 INFO L280 TraceCheckUtils]: 5: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-10 15:26:02,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-10 15:26:02,051 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-10 15:26:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2152#true} is VALID [2020-07-10 15:26:02,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,070 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-10 15:26:02,070 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,070 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #84#return; {2153#false} is VALID [2020-07-10 15:26:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2152#true} is VALID [2020-07-10 15:26:02,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,086 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,086 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,087 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-10 15:26:02,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,087 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #86#return; {2153#false} is VALID [2020-07-10 15:26:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2152#true} is VALID [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-10 15:26:02,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,099 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #88#return; {2153#false} is VALID [2020-07-10 15:26:02,101 INFO L263 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2198#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:02,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {2198#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2152#true} is VALID [2020-07-10 15:26:02,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,101 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-10 15:26:02,102 INFO L263 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret12 := main(); {2152#true} is VALID [2020-07-10 15:26:02,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2152#true} is VALID [2020-07-10 15:26:02,103 INFO L263 TraceCheckUtils]: 6: Hoare triple {2152#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2199#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:02,104 INFO L280 TraceCheckUtils]: 7: Hoare triple {2199#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2200#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:02,104 INFO L280 TraceCheckUtils]: 8: Hoare triple {2200#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2200#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:02,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {2200#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2201#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:02,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {2201#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2201#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:02,107 INFO L280 TraceCheckUtils]: 11: Hoare triple {2201#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2202#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:02,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-10 15:26:02,108 INFO L280 TraceCheckUtils]: 13: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-10 15:26:02,108 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-10 15:26:02,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {2153#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2153#false} is VALID [2020-07-10 15:26:02,109 INFO L263 TraceCheckUtils]: 16: Hoare triple {2153#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-10 15:26:02,109 INFO L280 TraceCheckUtils]: 17: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2152#true} is VALID [2020-07-10 15:26:02,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,109 INFO L280 TraceCheckUtils]: 19: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,110 INFO L280 TraceCheckUtils]: 21: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,110 INFO L280 TraceCheckUtils]: 22: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,110 INFO L280 TraceCheckUtils]: 23: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,111 INFO L280 TraceCheckUtils]: 25: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-10 15:26:02,111 INFO L280 TraceCheckUtils]: 26: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,111 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2152#true} {2153#false} #84#return; {2153#false} is VALID [2020-07-10 15:26:02,111 INFO L280 TraceCheckUtils]: 28: Hoare triple {2153#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2153#false} is VALID [2020-07-10 15:26:02,112 INFO L263 TraceCheckUtils]: 29: Hoare triple {2153#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-10 15:26:02,112 INFO L280 TraceCheckUtils]: 30: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2152#true} is VALID [2020-07-10 15:26:02,112 INFO L280 TraceCheckUtils]: 31: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,112 INFO L280 TraceCheckUtils]: 32: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,113 INFO L280 TraceCheckUtils]: 33: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,113 INFO L280 TraceCheckUtils]: 34: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,113 INFO L280 TraceCheckUtils]: 35: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,113 INFO L280 TraceCheckUtils]: 36: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,113 INFO L280 TraceCheckUtils]: 37: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,114 INFO L280 TraceCheckUtils]: 38: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-10 15:26:02,114 INFO L280 TraceCheckUtils]: 39: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,114 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2152#true} {2153#false} #86#return; {2153#false} is VALID [2020-07-10 15:26:02,114 INFO L280 TraceCheckUtils]: 41: Hoare triple {2153#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2153#false} is VALID [2020-07-10 15:26:02,114 INFO L280 TraceCheckUtils]: 42: Hoare triple {2153#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2153#false} is VALID [2020-07-10 15:26:02,115 INFO L280 TraceCheckUtils]: 43: Hoare triple {2153#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2153#false} is VALID [2020-07-10 15:26:02,115 INFO L280 TraceCheckUtils]: 44: Hoare triple {2153#false} assume !(~i~2 < 4); {2153#false} is VALID [2020-07-10 15:26:02,115 INFO L280 TraceCheckUtils]: 45: Hoare triple {2153#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2153#false} is VALID [2020-07-10 15:26:02,115 INFO L263 TraceCheckUtils]: 46: Hoare triple {2153#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-10 15:26:02,116 INFO L280 TraceCheckUtils]: 47: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2152#true} is VALID [2020-07-10 15:26:02,116 INFO L280 TraceCheckUtils]: 48: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,116 INFO L280 TraceCheckUtils]: 49: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,116 INFO L280 TraceCheckUtils]: 50: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,117 INFO L280 TraceCheckUtils]: 51: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,117 INFO L280 TraceCheckUtils]: 52: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-10 15:26:02,117 INFO L280 TraceCheckUtils]: 53: Hoare triple {2152#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2152#true} is VALID [2020-07-10 15:26:02,118 INFO L280 TraceCheckUtils]: 54: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-10 15:26:02,118 INFO L280 TraceCheckUtils]: 55: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-10 15:26:02,118 INFO L280 TraceCheckUtils]: 56: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,118 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2152#true} {2153#false} #88#return; {2153#false} is VALID [2020-07-10 15:26:02,119 INFO L280 TraceCheckUtils]: 58: Hoare triple {2153#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2153#false} is VALID [2020-07-10 15:26:02,119 INFO L280 TraceCheckUtils]: 59: Hoare triple {2153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2153#false} is VALID [2020-07-10 15:26:02,119 INFO L280 TraceCheckUtils]: 60: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2020-07-10 15:26:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-10 15:26:02,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979791722] [2020-07-10 15:26:02,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185276951] [2020-07-10 15:26:02,125 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:02,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:02,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:02,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:02,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2020-07-10 15:26:02,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2152#true} is VALID [2020-07-10 15:26:02,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-10 15:26:02,297 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-10 15:26:02,297 INFO L263 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret12 := main(); {2152#true} is VALID [2020-07-10 15:26:02,297 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2152#true} is VALID [2020-07-10 15:26:02,298 INFO L263 TraceCheckUtils]: 6: Hoare triple {2152#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-10 15:26:02,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2200#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:02,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {2200#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2200#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:02,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {2200#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2201#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:02,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {2201#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2201#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:02,303 INFO L280 TraceCheckUtils]: 11: Hoare triple {2201#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2202#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:02,304 INFO L280 TraceCheckUtils]: 12: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-10 15:26:02,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-10 15:26:02,305 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-10 15:26:02,305 INFO L280 TraceCheckUtils]: 15: Hoare triple {2153#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2153#false} is VALID [2020-07-10 15:26:02,305 INFO L263 TraceCheckUtils]: 16: Hoare triple {2153#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-10 15:26:02,306 INFO L280 TraceCheckUtils]: 17: Hoare triple {2153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2153#false} is VALID [2020-07-10 15:26:02,306 INFO L280 TraceCheckUtils]: 18: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-10 15:26:02,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {2153#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2153#false} is VALID [2020-07-10 15:26:02,307 INFO L280 TraceCheckUtils]: 21: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,307 INFO L280 TraceCheckUtils]: 22: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-10 15:26:02,307 INFO L280 TraceCheckUtils]: 23: Hoare triple {2153#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2153#false} is VALID [2020-07-10 15:26:02,307 INFO L280 TraceCheckUtils]: 24: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,308 INFO L280 TraceCheckUtils]: 25: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-10 15:26:02,308 INFO L280 TraceCheckUtils]: 26: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-10 15:26:02,308 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2153#false} {2153#false} #84#return; {2153#false} is VALID [2020-07-10 15:26:02,308 INFO L280 TraceCheckUtils]: 28: Hoare triple {2153#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2153#false} is VALID [2020-07-10 15:26:02,309 INFO L263 TraceCheckUtils]: 29: Hoare triple {2153#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-10 15:26:02,309 INFO L280 TraceCheckUtils]: 30: Hoare triple {2153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2153#false} is VALID [2020-07-10 15:26:02,309 INFO L280 TraceCheckUtils]: 31: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,309 INFO L280 TraceCheckUtils]: 32: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-10 15:26:02,310 INFO L280 TraceCheckUtils]: 33: Hoare triple {2153#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2153#false} is VALID [2020-07-10 15:26:02,310 INFO L280 TraceCheckUtils]: 34: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,310 INFO L280 TraceCheckUtils]: 35: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-10 15:26:02,310 INFO L280 TraceCheckUtils]: 36: Hoare triple {2153#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2153#false} is VALID [2020-07-10 15:26:02,311 INFO L280 TraceCheckUtils]: 37: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,311 INFO L280 TraceCheckUtils]: 38: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-10 15:26:02,311 INFO L280 TraceCheckUtils]: 39: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-10 15:26:02,311 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2153#false} {2153#false} #86#return; {2153#false} is VALID [2020-07-10 15:26:02,312 INFO L280 TraceCheckUtils]: 41: Hoare triple {2153#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2153#false} is VALID [2020-07-10 15:26:02,312 INFO L280 TraceCheckUtils]: 42: Hoare triple {2153#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2153#false} is VALID [2020-07-10 15:26:02,312 INFO L280 TraceCheckUtils]: 43: Hoare triple {2153#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2153#false} is VALID [2020-07-10 15:26:02,312 INFO L280 TraceCheckUtils]: 44: Hoare triple {2153#false} assume !(~i~2 < 4); {2153#false} is VALID [2020-07-10 15:26:02,325 INFO L280 TraceCheckUtils]: 45: Hoare triple {2153#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2153#false} is VALID [2020-07-10 15:26:02,326 INFO L263 TraceCheckUtils]: 46: Hoare triple {2153#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-10 15:26:02,326 INFO L280 TraceCheckUtils]: 47: Hoare triple {2153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2153#false} is VALID [2020-07-10 15:26:02,326 INFO L280 TraceCheckUtils]: 48: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,327 INFO L280 TraceCheckUtils]: 49: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-10 15:26:02,327 INFO L280 TraceCheckUtils]: 50: Hoare triple {2153#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2153#false} is VALID [2020-07-10 15:26:02,327 INFO L280 TraceCheckUtils]: 51: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,327 INFO L280 TraceCheckUtils]: 52: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-10 15:26:02,328 INFO L280 TraceCheckUtils]: 53: Hoare triple {2153#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2153#false} is VALID [2020-07-10 15:26:02,328 INFO L280 TraceCheckUtils]: 54: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-10 15:26:02,328 INFO L280 TraceCheckUtils]: 55: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-10 15:26:02,328 INFO L280 TraceCheckUtils]: 56: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-10 15:26:02,328 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2153#false} {2153#false} #88#return; {2153#false} is VALID [2020-07-10 15:26:02,329 INFO L280 TraceCheckUtils]: 58: Hoare triple {2153#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2153#false} is VALID [2020-07-10 15:26:02,329 INFO L280 TraceCheckUtils]: 59: Hoare triple {2153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2153#false} is VALID [2020-07-10 15:26:02,329 INFO L280 TraceCheckUtils]: 60: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2020-07-10 15:26:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-10 15:26:02,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:02,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2020-07-10 15:26:02,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081145408] [2020-07-10 15:26:02,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-07-10 15:26:02,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:02,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:26:02,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:02,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:26:02,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:26:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:02,407 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 7 states. [2020-07-10 15:26:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,081 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2020-07-10 15:26:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:26:03,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-07-10 15:26:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-10 15:26:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-10 15:26:03,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2020-07-10 15:26:03,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,193 INFO L225 Difference]: With dead ends: 80 [2020-07-10 15:26:03,193 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:26:03,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:26:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:26:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-10 15:26:03,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-10 15:26:03,231 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-10 15:26:03,232 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-10 15:26:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,234 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 15:26:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-07-10 15:26:03,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,236 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-10 15:26:03,236 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-10 15:26:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,238 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 15:26:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-07-10 15:26:03,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:26:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-10 15:26:03,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 61 [2020-07-10 15:26:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,242 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-10 15:26:03,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:26:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-10 15:26:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-10 15:26:03,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,244 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:03,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:03,459 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash 190779759, now seen corresponding path program 3 times [2020-07-10 15:26:03,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:03,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381602197] [2020-07-10 15:26:03,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {2717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2669#true} is VALID [2020-07-10 15:26:03,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,545 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-10 15:26:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {2718#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2719#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:03,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {2719#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2719#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:03,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {2719#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2720#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:03,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {2720#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2720#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:03,630 INFO L280 TraceCheckUtils]: 4: Hoare triple {2720#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2721#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:03,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {2721#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2721#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:03,635 INFO L280 TraceCheckUtils]: 6: Hoare triple {2721#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2722#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:03,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {2722#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2670#false} is VALID [2020-07-10 15:26:03,636 INFO L280 TraceCheckUtils]: 8: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-10 15:26:03,636 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2670#false} {2669#true} #82#return; {2670#false} is VALID [2020-07-10 15:26:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,648 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,649 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #84#return; {2670#false} is VALID [2020-07-10 15:26:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,661 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,661 INFO L280 TraceCheckUtils]: 6: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,662 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #86#return; {2670#false} is VALID [2020-07-10 15:26:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,674 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,676 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #88#return; {2670#false} is VALID [2020-07-10 15:26:03,678 INFO L263 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:03,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {2717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2669#true} is VALID [2020-07-10 15:26:03,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,679 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-10 15:26:03,679 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret12 := main(); {2669#true} is VALID [2020-07-10 15:26:03,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2669#true} is VALID [2020-07-10 15:26:03,681 INFO L263 TraceCheckUtils]: 6: Hoare triple {2669#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2718#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:26:03,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {2718#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2719#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:03,683 INFO L280 TraceCheckUtils]: 8: Hoare triple {2719#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2719#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:03,684 INFO L280 TraceCheckUtils]: 9: Hoare triple {2719#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2720#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:03,685 INFO L280 TraceCheckUtils]: 10: Hoare triple {2720#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2720#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:03,686 INFO L280 TraceCheckUtils]: 11: Hoare triple {2720#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2721#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:03,686 INFO L280 TraceCheckUtils]: 12: Hoare triple {2721#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2721#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:03,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {2721#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2722#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:03,688 INFO L280 TraceCheckUtils]: 14: Hoare triple {2722#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2670#false} is VALID [2020-07-10 15:26:03,689 INFO L280 TraceCheckUtils]: 15: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-10 15:26:03,689 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2670#false} {2669#true} #82#return; {2670#false} is VALID [2020-07-10 15:26:03,689 INFO L280 TraceCheckUtils]: 17: Hoare triple {2670#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2670#false} is VALID [2020-07-10 15:26:03,690 INFO L263 TraceCheckUtils]: 18: Hoare triple {2670#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,690 INFO L280 TraceCheckUtils]: 19: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,690 INFO L280 TraceCheckUtils]: 20: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,690 INFO L280 TraceCheckUtils]: 21: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,691 INFO L280 TraceCheckUtils]: 22: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,691 INFO L280 TraceCheckUtils]: 23: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,691 INFO L280 TraceCheckUtils]: 24: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,691 INFO L280 TraceCheckUtils]: 25: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,691 INFO L280 TraceCheckUtils]: 26: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,692 INFO L280 TraceCheckUtils]: 27: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,692 INFO L280 TraceCheckUtils]: 28: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,692 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2669#true} {2670#false} #84#return; {2670#false} is VALID [2020-07-10 15:26:03,692 INFO L280 TraceCheckUtils]: 30: Hoare triple {2670#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2670#false} is VALID [2020-07-10 15:26:03,693 INFO L263 TraceCheckUtils]: 31: Hoare triple {2670#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,693 INFO L280 TraceCheckUtils]: 32: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,693 INFO L280 TraceCheckUtils]: 33: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,694 INFO L280 TraceCheckUtils]: 34: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,694 INFO L280 TraceCheckUtils]: 35: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,694 INFO L280 TraceCheckUtils]: 36: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,694 INFO L280 TraceCheckUtils]: 37: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,694 INFO L280 TraceCheckUtils]: 38: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,695 INFO L280 TraceCheckUtils]: 39: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,695 INFO L280 TraceCheckUtils]: 40: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,695 INFO L280 TraceCheckUtils]: 41: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,695 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2669#true} {2670#false} #86#return; {2670#false} is VALID [2020-07-10 15:26:03,696 INFO L280 TraceCheckUtils]: 43: Hoare triple {2670#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2670#false} is VALID [2020-07-10 15:26:03,696 INFO L280 TraceCheckUtils]: 44: Hoare triple {2670#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2670#false} is VALID [2020-07-10 15:26:03,696 INFO L280 TraceCheckUtils]: 45: Hoare triple {2670#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2670#false} is VALID [2020-07-10 15:26:03,696 INFO L280 TraceCheckUtils]: 46: Hoare triple {2670#false} assume !(~i~2 < 4); {2670#false} is VALID [2020-07-10 15:26:03,697 INFO L280 TraceCheckUtils]: 47: Hoare triple {2670#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2670#false} is VALID [2020-07-10 15:26:03,697 INFO L263 TraceCheckUtils]: 48: Hoare triple {2670#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,697 INFO L280 TraceCheckUtils]: 49: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,697 INFO L280 TraceCheckUtils]: 50: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,698 INFO L280 TraceCheckUtils]: 51: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,698 INFO L280 TraceCheckUtils]: 52: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,698 INFO L280 TraceCheckUtils]: 53: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,698 INFO L280 TraceCheckUtils]: 54: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,699 INFO L280 TraceCheckUtils]: 55: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,699 INFO L280 TraceCheckUtils]: 56: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,699 INFO L280 TraceCheckUtils]: 57: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,699 INFO L280 TraceCheckUtils]: 58: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,699 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2669#true} {2670#false} #88#return; {2670#false} is VALID [2020-07-10 15:26:03,700 INFO L280 TraceCheckUtils]: 60: Hoare triple {2670#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2670#false} is VALID [2020-07-10 15:26:03,700 INFO L280 TraceCheckUtils]: 61: Hoare triple {2670#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2670#false} is VALID [2020-07-10 15:26:03,700 INFO L280 TraceCheckUtils]: 62: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2020-07-10 15:26:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-10 15:26:03,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381602197] [2020-07-10 15:26:03,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776199196] [2020-07-10 15:26:03,705 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:03,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:26:03,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:03,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:03,878 INFO L263 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2020-07-10 15:26:03,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2669#true} is VALID [2020-07-10 15:26:03,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-10 15:26:03,879 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret12 := main(); {2669#true} is VALID [2020-07-10 15:26:03,879 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2669#true} is VALID [2020-07-10 15:26:03,880 INFO L263 TraceCheckUtils]: 6: Hoare triple {2669#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2669#true} is VALID [2020-07-10 15:26:03,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2669#true} is VALID [2020-07-10 15:26:03,880 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2669#true} is VALID [2020-07-10 15:26:03,880 INFO L280 TraceCheckUtils]: 10: Hoare triple {2669#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2669#true} is VALID [2020-07-10 15:26:03,880 INFO L280 TraceCheckUtils]: 11: Hoare triple {2669#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2669#true} is VALID [2020-07-10 15:26:03,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {2669#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2669#true} is VALID [2020-07-10 15:26:03,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {2669#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2669#true} is VALID [2020-07-10 15:26:03,881 INFO L280 TraceCheckUtils]: 14: Hoare triple {2669#true} assume !(~i~0 < 5); {2669#true} is VALID [2020-07-10 15:26:03,881 INFO L280 TraceCheckUtils]: 15: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,882 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2669#true} {2669#true} #82#return; {2669#true} is VALID [2020-07-10 15:26:03,882 INFO L280 TraceCheckUtils]: 17: Hoare triple {2669#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2669#true} is VALID [2020-07-10 15:26:03,882 INFO L263 TraceCheckUtils]: 18: Hoare triple {2669#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,882 INFO L280 TraceCheckUtils]: 19: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,882 INFO L280 TraceCheckUtils]: 20: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,883 INFO L280 TraceCheckUtils]: 21: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,883 INFO L280 TraceCheckUtils]: 22: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,883 INFO L280 TraceCheckUtils]: 23: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,883 INFO L280 TraceCheckUtils]: 24: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,884 INFO L280 TraceCheckUtils]: 25: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,884 INFO L280 TraceCheckUtils]: 26: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,884 INFO L280 TraceCheckUtils]: 27: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,884 INFO L280 TraceCheckUtils]: 28: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,884 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2669#true} {2669#true} #84#return; {2669#true} is VALID [2020-07-10 15:26:03,885 INFO L280 TraceCheckUtils]: 30: Hoare triple {2669#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2669#true} is VALID [2020-07-10 15:26:03,885 INFO L263 TraceCheckUtils]: 31: Hoare triple {2669#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,885 INFO L280 TraceCheckUtils]: 32: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,885 INFO L280 TraceCheckUtils]: 33: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,886 INFO L280 TraceCheckUtils]: 34: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,886 INFO L280 TraceCheckUtils]: 35: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,886 INFO L280 TraceCheckUtils]: 36: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,886 INFO L280 TraceCheckUtils]: 37: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,886 INFO L280 TraceCheckUtils]: 38: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,887 INFO L280 TraceCheckUtils]: 39: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,887 INFO L280 TraceCheckUtils]: 40: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-10 15:26:03,887 INFO L280 TraceCheckUtils]: 41: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-10 15:26:03,887 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2669#true} {2669#true} #86#return; {2669#true} is VALID [2020-07-10 15:26:03,888 INFO L280 TraceCheckUtils]: 43: Hoare triple {2669#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2669#true} is VALID [2020-07-10 15:26:03,888 INFO L280 TraceCheckUtils]: 44: Hoare triple {2669#true} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2669#true} is VALID [2020-07-10 15:26:03,888 INFO L280 TraceCheckUtils]: 45: Hoare triple {2669#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2669#true} is VALID [2020-07-10 15:26:03,888 INFO L280 TraceCheckUtils]: 46: Hoare triple {2669#true} assume !(~i~2 < 4); {2669#true} is VALID [2020-07-10 15:26:03,888 INFO L280 TraceCheckUtils]: 47: Hoare triple {2669#true} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2669#true} is VALID [2020-07-10 15:26:03,888 INFO L263 TraceCheckUtils]: 48: Hoare triple {2669#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-10 15:26:03,889 INFO L280 TraceCheckUtils]: 49: Hoare triple {2669#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2669#true} is VALID [2020-07-10 15:26:03,889 INFO L280 TraceCheckUtils]: 50: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,889 INFO L280 TraceCheckUtils]: 51: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-10 15:26:03,889 INFO L280 TraceCheckUtils]: 52: Hoare triple {2669#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2669#true} is VALID [2020-07-10 15:26:03,890 INFO L280 TraceCheckUtils]: 53: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-10 15:26:03,890 INFO L280 TraceCheckUtils]: 54: Hoare triple {2669#true} assume !(~i~1 > 2); {2888#(<= rangesum_~i~1 2)} is VALID [2020-07-10 15:26:03,892 INFO L280 TraceCheckUtils]: 55: Hoare triple {2888#(<= rangesum_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2892#(<= rangesum_~i~1 3)} is VALID [2020-07-10 15:26:03,892 INFO L280 TraceCheckUtils]: 56: Hoare triple {2892#(<= rangesum_~i~1 3)} assume !(~i~1 < 5); {2670#false} is VALID [2020-07-10 15:26:03,893 INFO L280 TraceCheckUtils]: 57: Hoare triple {2670#false} assume !(0 != ~cnt~0);#res := 0; {2670#false} is VALID [2020-07-10 15:26:03,893 INFO L280 TraceCheckUtils]: 58: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-10 15:26:03,893 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2670#false} {2669#true} #88#return; {2670#false} is VALID [2020-07-10 15:26:03,894 INFO L280 TraceCheckUtils]: 60: Hoare triple {2670#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2670#false} is VALID [2020-07-10 15:26:03,894 INFO L280 TraceCheckUtils]: 61: Hoare triple {2670#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2670#false} is VALID [2020-07-10 15:26:03,894 INFO L280 TraceCheckUtils]: 62: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2020-07-10 15:26:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-07-10 15:26:03,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:03,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2020-07-10 15:26:03,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539845909] [2020-07-10 15:26:03,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-07-10 15:26:03,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:03,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:03,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:03,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:03,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:26:03,955 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2020-07-10 15:26:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,221 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-10 15:26:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:04,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-07-10 15:26:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-10 15:26:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-10 15:26:04,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2020-07-10 15:26:04,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:04,317 INFO L225 Difference]: With dead ends: 78 [2020-07-10 15:26:04,317 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 15:26:04,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:26:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 15:26:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-07-10 15:26:04,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:04,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 45 states. [2020-07-10 15:26:04,358 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 45 states. [2020-07-10 15:26:04,358 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 45 states. [2020-07-10 15:26:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,361 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-10 15:26:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-10 15:26:04,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,362 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 50 states. [2020-07-10 15:26:04,362 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 50 states. [2020-07-10 15:26:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,364 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-10 15:26:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-10 15:26:04,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:04,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:26:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-07-10 15:26:04,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 63 [2020-07-10 15:26:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:04,367 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-07-10 15:26:04,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-07-10 15:26:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-10 15:26:04,368 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:04,368 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:04,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-10 15:26:04,570 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1896448358, now seen corresponding path program 1 times [2020-07-10 15:26:04,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:04,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574036174] [2020-07-10 15:26:04,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {3243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3186#true} is VALID [2020-07-10 15:26:04,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {3186#true} assume true; {3186#true} is VALID [2020-07-10 15:26:04,626 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3186#true} {3186#true} #78#return; {3186#true} is VALID [2020-07-10 15:26:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {3244#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3245#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:04,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {3245#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3245#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:04,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {3245#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3246#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:04,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {3246#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3246#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:04,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {3246#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:04,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {3247#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3247#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:04,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {3247#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3248#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:04,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {3248#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {3187#false} is VALID [2020-07-10 15:26:04,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-10 15:26:04,713 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3187#false} {3186#true} #82#return; {3187#false} is VALID [2020-07-10 15:26:04,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574036174] [2020-07-10 15:26:04,718 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-10 15:26:04,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373681134] [2020-07-10 15:26:04,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:26:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:04,881 INFO L263 TraceCheckUtils]: 0: Hoare triple {3186#true} call ULTIMATE.init(); {3186#true} is VALID [2020-07-10 15:26:04,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {3186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3186#true} is VALID [2020-07-10 15:26:04,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {3186#true} assume true; {3186#true} is VALID [2020-07-10 15:26:04,882 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3186#true} {3186#true} #78#return; {3186#true} is VALID [2020-07-10 15:26:04,882 INFO L263 TraceCheckUtils]: 4: Hoare triple {3186#true} call #t~ret12 := main(); {3186#true} is VALID [2020-07-10 15:26:04,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {3186#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {3186#true} is VALID [2020-07-10 15:26:04,883 INFO L263 TraceCheckUtils]: 6: Hoare triple {3186#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3186#true} is VALID [2020-07-10 15:26:04,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {3186#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3245#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:04,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {3245#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3245#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:04,893 INFO L280 TraceCheckUtils]: 9: Hoare triple {3245#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3246#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:04,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {3246#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3246#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:04,895 INFO L280 TraceCheckUtils]: 11: Hoare triple {3246#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3247#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:04,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {3247#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3247#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:04,897 INFO L280 TraceCheckUtils]: 13: Hoare triple {3247#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3248#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:04,898 INFO L280 TraceCheckUtils]: 14: Hoare triple {3248#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {3187#false} is VALID [2020-07-10 15:26:04,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-10 15:26:04,898 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3187#false} {3186#true} #82#return; {3187#false} is VALID [2020-07-10 15:26:04,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {3187#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3187#false} is VALID [2020-07-10 15:26:04,899 INFO L263 TraceCheckUtils]: 18: Hoare triple {3187#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-10 15:26:04,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {3187#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3187#false} is VALID [2020-07-10 15:26:04,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,899 INFO L280 TraceCheckUtils]: 21: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-10 15:26:04,899 INFO L280 TraceCheckUtils]: 22: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,900 INFO L280 TraceCheckUtils]: 23: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,900 INFO L280 TraceCheckUtils]: 24: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-10 15:26:04,900 INFO L280 TraceCheckUtils]: 25: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,900 INFO L280 TraceCheckUtils]: 26: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,901 INFO L280 TraceCheckUtils]: 27: Hoare triple {3187#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3187#false} is VALID [2020-07-10 15:26:04,901 INFO L280 TraceCheckUtils]: 28: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,901 INFO L280 TraceCheckUtils]: 29: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,901 INFO L280 TraceCheckUtils]: 30: Hoare triple {3187#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3187#false} is VALID [2020-07-10 15:26:04,901 INFO L280 TraceCheckUtils]: 31: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-10 15:26:04,901 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3187#false} {3187#false} #84#return; {3187#false} is VALID [2020-07-10 15:26:04,902 INFO L280 TraceCheckUtils]: 33: Hoare triple {3187#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3187#false} is VALID [2020-07-10 15:26:04,902 INFO L263 TraceCheckUtils]: 34: Hoare triple {3187#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-10 15:26:04,902 INFO L280 TraceCheckUtils]: 35: Hoare triple {3187#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3187#false} is VALID [2020-07-10 15:26:04,902 INFO L280 TraceCheckUtils]: 36: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,903 INFO L280 TraceCheckUtils]: 37: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-10 15:26:04,903 INFO L280 TraceCheckUtils]: 38: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,903 INFO L280 TraceCheckUtils]: 39: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,903 INFO L280 TraceCheckUtils]: 40: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-10 15:26:04,903 INFO L280 TraceCheckUtils]: 41: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,904 INFO L280 TraceCheckUtils]: 42: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,904 INFO L280 TraceCheckUtils]: 43: Hoare triple {3187#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3187#false} is VALID [2020-07-10 15:26:04,904 INFO L280 TraceCheckUtils]: 44: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,904 INFO L280 TraceCheckUtils]: 45: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,904 INFO L280 TraceCheckUtils]: 46: Hoare triple {3187#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3187#false} is VALID [2020-07-10 15:26:04,905 INFO L280 TraceCheckUtils]: 47: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-10 15:26:04,905 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3187#false} {3187#false} #86#return; {3187#false} is VALID [2020-07-10 15:26:04,905 INFO L280 TraceCheckUtils]: 49: Hoare triple {3187#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3187#false} is VALID [2020-07-10 15:26:04,905 INFO L280 TraceCheckUtils]: 50: Hoare triple {3187#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3187#false} is VALID [2020-07-10 15:26:04,905 INFO L280 TraceCheckUtils]: 51: Hoare triple {3187#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3187#false} is VALID [2020-07-10 15:26:04,906 INFO L280 TraceCheckUtils]: 52: Hoare triple {3187#false} assume !(~i~2 < 4); {3187#false} is VALID [2020-07-10 15:26:04,906 INFO L280 TraceCheckUtils]: 53: Hoare triple {3187#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3187#false} is VALID [2020-07-10 15:26:04,906 INFO L263 TraceCheckUtils]: 54: Hoare triple {3187#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-10 15:26:04,906 INFO L280 TraceCheckUtils]: 55: Hoare triple {3187#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3187#false} is VALID [2020-07-10 15:26:04,906 INFO L280 TraceCheckUtils]: 56: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,907 INFO L280 TraceCheckUtils]: 57: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-10 15:26:04,907 INFO L280 TraceCheckUtils]: 58: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,907 INFO L280 TraceCheckUtils]: 59: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,907 INFO L280 TraceCheckUtils]: 60: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-10 15:26:04,907 INFO L280 TraceCheckUtils]: 61: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,908 INFO L280 TraceCheckUtils]: 62: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,908 INFO L280 TraceCheckUtils]: 63: Hoare triple {3187#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3187#false} is VALID [2020-07-10 15:26:04,908 INFO L280 TraceCheckUtils]: 64: Hoare triple {3187#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3187#false} is VALID [2020-07-10 15:26:04,908 INFO L280 TraceCheckUtils]: 65: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-10 15:26:04,909 INFO L280 TraceCheckUtils]: 66: Hoare triple {3187#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3187#false} is VALID [2020-07-10 15:26:04,909 INFO L280 TraceCheckUtils]: 67: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-10 15:26:04,909 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3187#false} {3187#false} #88#return; {3187#false} is VALID [2020-07-10 15:26:04,909 INFO L280 TraceCheckUtils]: 69: Hoare triple {3187#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3187#false} is VALID [2020-07-10 15:26:04,910 INFO L280 TraceCheckUtils]: 70: Hoare triple {3187#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3187#false} is VALID [2020-07-10 15:26:04,910 INFO L280 TraceCheckUtils]: 71: Hoare triple {3187#false} assume !false; {3187#false} is VALID [2020-07-10 15:26:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-07-10 15:26:04,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:04,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:26:04,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952446989] [2020-07-10 15:26:04,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-07-10 15:26:04,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:04,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:26:04,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:04,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:26:04,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:26:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:26:04,973 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2020-07-10 15:26:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,257 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2020-07-10 15:26:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:05,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-07-10 15:26:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-10 15:26:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-10 15:26:05,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-10 15:26:05,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:05,381 INFO L225 Difference]: With dead ends: 78 [2020-07-10 15:26:05,382 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:26:05,383 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:26:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:26:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-10 15:26:05,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:05,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-10 15:26:05,419 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-10 15:26:05,419 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-10 15:26:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,422 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-10 15:26:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-10 15:26:05,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:05,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:05,423 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-10 15:26:05,423 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-10 15:26:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,426 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-10 15:26:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-10 15:26:05,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:05,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:05,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:05,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:26:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-10 15:26:05,442 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 72 [2020-07-10 15:26:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:05,442 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-10 15:26:05,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:26:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-10 15:26:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-10 15:26:05,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:05,444 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:05,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:05,651 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2135261480, now seen corresponding path program 2 times [2020-07-10 15:26:05,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:05,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119340561] [2020-07-10 15:26:05,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:05,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {3796#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3737#true} is VALID [2020-07-10 15:26:05,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {3737#true} assume true; {3737#true} is VALID [2020-07-10 15:26:05,700 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3737#true} {3737#true} #78#return; {3737#true} is VALID [2020-07-10 15:26:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:05,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {3797#(= |#memory_int| |old(#memory_int)|)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3798#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:05,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {3798#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3798#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:05,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {3798#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3799#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:05,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {3799#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3799#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:05,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {3799#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3800#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:05,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {3800#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3800#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:05,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {3800#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3801#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:05,828 INFO L280 TraceCheckUtils]: 7: Hoare triple {3801#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3801#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:05,829 INFO L280 TraceCheckUtils]: 8: Hoare triple {3801#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3802#(<= init_nondet_~i~0 4)} is VALID [2020-07-10 15:26:05,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {3802#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {3738#false} is VALID [2020-07-10 15:26:05,830 INFO L280 TraceCheckUtils]: 10: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-10 15:26:05,830 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3738#false} {3737#true} #82#return; {3738#false} is VALID [2020-07-10 15:26:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:05,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {3737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:05,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {3803#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:05,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {3803#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:05,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {3803#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:05,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {3804#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:05,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {3804#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:05,914 INFO L280 TraceCheckUtils]: 6: Hoare triple {3804#(<= rangesum_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3805#(<= rangesum_~i~1 2)} is VALID [2020-07-10 15:26:05,915 INFO L280 TraceCheckUtils]: 7: Hoare triple {3805#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {3805#(<= rangesum_~i~1 2)} is VALID [2020-07-10 15:26:05,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {3805#(<= rangesum_~i~1 2)} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3738#false} is VALID [2020-07-10 15:26:05,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:05,915 INFO L280 TraceCheckUtils]: 10: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:05,916 INFO L280 TraceCheckUtils]: 11: Hoare triple {3738#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3738#false} is VALID [2020-07-10 15:26:05,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-10 15:26:05,916 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3738#false} {3738#false} #84#return; {3738#false} is VALID [2020-07-10 15:26:05,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119340561] [2020-07-10 15:26:05,921 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-10 15:26:05,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129772920] [2020-07-10 15:26:05,922 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:05,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:05,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:05,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:26:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:06,111 INFO L263 TraceCheckUtils]: 0: Hoare triple {3737#true} call ULTIMATE.init(); {3737#true} is VALID [2020-07-10 15:26:06,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {3737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3737#true} is VALID [2020-07-10 15:26:06,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {3737#true} assume true; {3737#true} is VALID [2020-07-10 15:26:06,112 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3737#true} {3737#true} #78#return; {3737#true} is VALID [2020-07-10 15:26:06,112 INFO L263 TraceCheckUtils]: 4: Hoare triple {3737#true} call #t~ret12 := main(); {3737#true} is VALID [2020-07-10 15:26:06,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {3737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {3737#true} is VALID [2020-07-10 15:26:06,112 INFO L263 TraceCheckUtils]: 6: Hoare triple {3737#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3737#true} is VALID [2020-07-10 15:26:06,113 INFO L280 TraceCheckUtils]: 7: Hoare triple {3737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3798#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:06,113 INFO L280 TraceCheckUtils]: 8: Hoare triple {3798#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3798#(<= init_nondet_~i~0 0)} is VALID [2020-07-10 15:26:06,114 INFO L280 TraceCheckUtils]: 9: Hoare triple {3798#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3799#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:06,114 INFO L280 TraceCheckUtils]: 10: Hoare triple {3799#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3799#(<= init_nondet_~i~0 1)} is VALID [2020-07-10 15:26:06,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {3799#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3800#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:06,116 INFO L280 TraceCheckUtils]: 12: Hoare triple {3800#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3800#(<= init_nondet_~i~0 2)} is VALID [2020-07-10 15:26:06,117 INFO L280 TraceCheckUtils]: 13: Hoare triple {3800#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3801#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:06,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {3801#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3801#(<= init_nondet_~i~0 3)} is VALID [2020-07-10 15:26:06,118 INFO L280 TraceCheckUtils]: 15: Hoare triple {3801#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3802#(<= init_nondet_~i~0 4)} is VALID [2020-07-10 15:26:06,119 INFO L280 TraceCheckUtils]: 16: Hoare triple {3802#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {3738#false} is VALID [2020-07-10 15:26:06,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-10 15:26:06,119 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3738#false} {3737#true} #82#return; {3738#false} is VALID [2020-07-10 15:26:06,119 INFO L280 TraceCheckUtils]: 19: Hoare triple {3738#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3738#false} is VALID [2020-07-10 15:26:06,120 INFO L263 TraceCheckUtils]: 20: Hoare triple {3738#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-10 15:26:06,120 INFO L280 TraceCheckUtils]: 21: Hoare triple {3738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3738#false} is VALID [2020-07-10 15:26:06,120 INFO L280 TraceCheckUtils]: 22: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,120 INFO L280 TraceCheckUtils]: 23: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-10 15:26:06,121 INFO L280 TraceCheckUtils]: 24: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,121 INFO L280 TraceCheckUtils]: 25: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,121 INFO L280 TraceCheckUtils]: 26: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-10 15:26:06,122 INFO L280 TraceCheckUtils]: 27: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,122 INFO L280 TraceCheckUtils]: 28: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,122 INFO L280 TraceCheckUtils]: 29: Hoare triple {3738#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3738#false} is VALID [2020-07-10 15:26:06,122 INFO L280 TraceCheckUtils]: 30: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,123 INFO L280 TraceCheckUtils]: 31: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,123 INFO L280 TraceCheckUtils]: 32: Hoare triple {3738#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3738#false} is VALID [2020-07-10 15:26:06,123 INFO L280 TraceCheckUtils]: 33: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-10 15:26:06,123 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3738#false} {3738#false} #84#return; {3738#false} is VALID [2020-07-10 15:26:06,123 INFO L280 TraceCheckUtils]: 35: Hoare triple {3738#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3738#false} is VALID [2020-07-10 15:26:06,124 INFO L263 TraceCheckUtils]: 36: Hoare triple {3738#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-10 15:26:06,124 INFO L280 TraceCheckUtils]: 37: Hoare triple {3738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3738#false} is VALID [2020-07-10 15:26:06,124 INFO L280 TraceCheckUtils]: 38: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,124 INFO L280 TraceCheckUtils]: 39: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-10 15:26:06,124 INFO L280 TraceCheckUtils]: 40: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,125 INFO L280 TraceCheckUtils]: 41: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,125 INFO L280 TraceCheckUtils]: 42: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-10 15:26:06,125 INFO L280 TraceCheckUtils]: 43: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,125 INFO L280 TraceCheckUtils]: 44: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,125 INFO L280 TraceCheckUtils]: 45: Hoare triple {3738#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3738#false} is VALID [2020-07-10 15:26:06,126 INFO L280 TraceCheckUtils]: 46: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,126 INFO L280 TraceCheckUtils]: 47: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,126 INFO L280 TraceCheckUtils]: 48: Hoare triple {3738#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3738#false} is VALID [2020-07-10 15:26:06,126 INFO L280 TraceCheckUtils]: 49: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-10 15:26:06,126 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3738#false} {3738#false} #86#return; {3738#false} is VALID [2020-07-10 15:26:06,126 INFO L280 TraceCheckUtils]: 51: Hoare triple {3738#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3738#false} is VALID [2020-07-10 15:26:06,127 INFO L280 TraceCheckUtils]: 52: Hoare triple {3738#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3738#false} is VALID [2020-07-10 15:26:06,127 INFO L280 TraceCheckUtils]: 53: Hoare triple {3738#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3738#false} is VALID [2020-07-10 15:26:06,127 INFO L280 TraceCheckUtils]: 54: Hoare triple {3738#false} assume !(~i~2 < 4); {3738#false} is VALID [2020-07-10 15:26:06,127 INFO L280 TraceCheckUtils]: 55: Hoare triple {3738#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3738#false} is VALID [2020-07-10 15:26:06,127 INFO L263 TraceCheckUtils]: 56: Hoare triple {3738#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-10 15:26:06,128 INFO L280 TraceCheckUtils]: 57: Hoare triple {3738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3738#false} is VALID [2020-07-10 15:26:06,128 INFO L280 TraceCheckUtils]: 58: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,128 INFO L280 TraceCheckUtils]: 59: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-10 15:26:06,128 INFO L280 TraceCheckUtils]: 60: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,128 INFO L280 TraceCheckUtils]: 61: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,128 INFO L280 TraceCheckUtils]: 62: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-10 15:26:06,129 INFO L280 TraceCheckUtils]: 63: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,129 INFO L280 TraceCheckUtils]: 64: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,129 INFO L280 TraceCheckUtils]: 65: Hoare triple {3738#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3738#false} is VALID [2020-07-10 15:26:06,129 INFO L280 TraceCheckUtils]: 66: Hoare triple {3738#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3738#false} is VALID [2020-07-10 15:26:06,129 INFO L280 TraceCheckUtils]: 67: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-10 15:26:06,130 INFO L280 TraceCheckUtils]: 68: Hoare triple {3738#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3738#false} is VALID [2020-07-10 15:26:06,130 INFO L280 TraceCheckUtils]: 69: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-10 15:26:06,130 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {3738#false} {3738#false} #88#return; {3738#false} is VALID [2020-07-10 15:26:06,130 INFO L280 TraceCheckUtils]: 71: Hoare triple {3738#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3738#false} is VALID [2020-07-10 15:26:06,130 INFO L280 TraceCheckUtils]: 72: Hoare triple {3738#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3738#false} is VALID [2020-07-10 15:26:06,131 INFO L280 TraceCheckUtils]: 73: Hoare triple {3738#false} assume !false; {3738#false} is VALID [2020-07-10 15:26:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-07-10 15:26:06,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:06,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:26:06,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895650939] [2020-07-10 15:26:06,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-07-10 15:26:06,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:06,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:26:06,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:06,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:26:06,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:26:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:26:06,195 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2020-07-10 15:26:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,907 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2020-07-10 15:26:06,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:06,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-07-10 15:26:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-10 15:26:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-10 15:26:06,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-10 15:26:07,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,010 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:26:07,010 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:26:07,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:26:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:26:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-10 15:26:07,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:07,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:07,059 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:07,059 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,061 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:26:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:26:07,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,062 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:07,062 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,065 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:26:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:26:07,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:07,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:26:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-07-10 15:26:07,067 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 74 [2020-07-10 15:26:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:07,068 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-07-10 15:26:07,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:26:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:26:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-10 15:26:07,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:07,075 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:07,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:07,277 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash -293562262, now seen corresponding path program 3 times [2020-07-10 15:26:07,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:07,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537779531] [2020-07-10 15:26:07,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:07,293 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:07,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379125217] [2020-07-10 15:26:07,294 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:07,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:26:07,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:07,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:07,583 INFO L263 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2020-07-10 15:26:07,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {4307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4307#true} is VALID [2020-07-10 15:26:07,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-10 15:26:07,585 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #78#return; {4307#true} is VALID [2020-07-10 15:26:07,585 INFO L263 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret12 := main(); {4307#true} is VALID [2020-07-10 15:26:07,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {4307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {4307#true} is VALID [2020-07-10 15:26:07,585 INFO L263 TraceCheckUtils]: 6: Hoare triple {4307#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-10 15:26:07,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {4307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4307#true} is VALID [2020-07-10 15:26:07,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {4307#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4307#true} is VALID [2020-07-10 15:26:07,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {4307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4307#true} is VALID [2020-07-10 15:26:07,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {4307#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4307#true} is VALID [2020-07-10 15:26:07,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {4307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4307#true} is VALID [2020-07-10 15:26:07,587 INFO L280 TraceCheckUtils]: 12: Hoare triple {4307#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4307#true} is VALID [2020-07-10 15:26:07,588 INFO L280 TraceCheckUtils]: 13: Hoare triple {4307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4307#true} is VALID [2020-07-10 15:26:07,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {4307#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4307#true} is VALID [2020-07-10 15:26:07,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {4307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4307#true} is VALID [2020-07-10 15:26:07,588 INFO L280 TraceCheckUtils]: 16: Hoare triple {4307#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4307#true} is VALID [2020-07-10 15:26:07,589 INFO L280 TraceCheckUtils]: 17: Hoare triple {4307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4307#true} is VALID [2020-07-10 15:26:07,589 INFO L280 TraceCheckUtils]: 18: Hoare triple {4307#true} assume !(~i~0 < 5); {4307#true} is VALID [2020-07-10 15:26:07,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-10 15:26:07,590 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4307#true} {4307#true} #82#return; {4307#true} is VALID [2020-07-10 15:26:07,590 INFO L280 TraceCheckUtils]: 21: Hoare triple {4307#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4307#true} is VALID [2020-07-10 15:26:07,590 INFO L263 TraceCheckUtils]: 22: Hoare triple {4307#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-10 15:26:07,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {4307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4307#true} is VALID [2020-07-10 15:26:07,591 INFO L280 TraceCheckUtils]: 24: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,591 INFO L280 TraceCheckUtils]: 25: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-10 15:26:07,591 INFO L280 TraceCheckUtils]: 26: Hoare triple {4307#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4307#true} is VALID [2020-07-10 15:26:07,591 INFO L280 TraceCheckUtils]: 27: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,592 INFO L280 TraceCheckUtils]: 28: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-10 15:26:07,592 INFO L280 TraceCheckUtils]: 29: Hoare triple {4307#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4307#true} is VALID [2020-07-10 15:26:07,592 INFO L280 TraceCheckUtils]: 30: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,593 INFO L280 TraceCheckUtils]: 31: Hoare triple {4307#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4307#true} is VALID [2020-07-10 15:26:07,593 INFO L280 TraceCheckUtils]: 32: Hoare triple {4307#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4307#true} is VALID [2020-07-10 15:26:07,593 INFO L280 TraceCheckUtils]: 33: Hoare triple {4307#true} assume !(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,594 INFO L280 TraceCheckUtils]: 34: Hoare triple {4307#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4307#true} is VALID [2020-07-10 15:26:07,594 INFO L280 TraceCheckUtils]: 35: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-10 15:26:07,594 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4307#true} {4307#true} #84#return; {4307#true} is VALID [2020-07-10 15:26:07,594 INFO L280 TraceCheckUtils]: 37: Hoare triple {4307#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4307#true} is VALID [2020-07-10 15:26:07,595 INFO L263 TraceCheckUtils]: 38: Hoare triple {4307#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-10 15:26:07,595 INFO L280 TraceCheckUtils]: 39: Hoare triple {4307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4307#true} is VALID [2020-07-10 15:26:07,595 INFO L280 TraceCheckUtils]: 40: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,595 INFO L280 TraceCheckUtils]: 41: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-10 15:26:07,595 INFO L280 TraceCheckUtils]: 42: Hoare triple {4307#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4307#true} is VALID [2020-07-10 15:26:07,596 INFO L280 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,596 INFO L280 TraceCheckUtils]: 44: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-10 15:26:07,596 INFO L280 TraceCheckUtils]: 45: Hoare triple {4307#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4307#true} is VALID [2020-07-10 15:26:07,596 INFO L280 TraceCheckUtils]: 46: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,597 INFO L280 TraceCheckUtils]: 47: Hoare triple {4307#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4307#true} is VALID [2020-07-10 15:26:07,597 INFO L280 TraceCheckUtils]: 48: Hoare triple {4307#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4307#true} is VALID [2020-07-10 15:26:07,597 INFO L280 TraceCheckUtils]: 49: Hoare triple {4307#true} assume !(~i~1 < 5); {4307#true} is VALID [2020-07-10 15:26:07,597 INFO L280 TraceCheckUtils]: 50: Hoare triple {4307#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4307#true} is VALID [2020-07-10 15:26:07,597 INFO L280 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-10 15:26:07,598 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4307#true} {4307#true} #86#return; {4307#true} is VALID [2020-07-10 15:26:07,599 INFO L280 TraceCheckUtils]: 53: Hoare triple {4307#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4471#(<= main_~i~2 0)} is VALID [2020-07-10 15:26:07,599 INFO L280 TraceCheckUtils]: 54: Hoare triple {4471#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4471#(<= main_~i~2 0)} is VALID [2020-07-10 15:26:07,601 INFO L280 TraceCheckUtils]: 55: Hoare triple {4471#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4478#(<= main_~i~2 1)} is VALID [2020-07-10 15:26:07,602 INFO L280 TraceCheckUtils]: 56: Hoare triple {4478#(<= main_~i~2 1)} assume !(~i~2 < 4); {4308#false} is VALID [2020-07-10 15:26:07,602 INFO L280 TraceCheckUtils]: 57: Hoare triple {4308#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {4308#false} is VALID [2020-07-10 15:26:07,603 INFO L263 TraceCheckUtils]: 58: Hoare triple {4308#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4308#false} is VALID [2020-07-10 15:26:07,603 INFO L280 TraceCheckUtils]: 59: Hoare triple {4308#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4308#false} is VALID [2020-07-10 15:26:07,603 INFO L280 TraceCheckUtils]: 60: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-10 15:26:07,603 INFO L280 TraceCheckUtils]: 61: Hoare triple {4308#false} assume !(~i~1 > 2); {4308#false} is VALID [2020-07-10 15:26:07,603 INFO L280 TraceCheckUtils]: 62: Hoare triple {4308#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4308#false} is VALID [2020-07-10 15:26:07,604 INFO L280 TraceCheckUtils]: 63: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-10 15:26:07,604 INFO L280 TraceCheckUtils]: 64: Hoare triple {4308#false} assume !(~i~1 > 2); {4308#false} is VALID [2020-07-10 15:26:07,604 INFO L280 TraceCheckUtils]: 65: Hoare triple {4308#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4308#false} is VALID [2020-07-10 15:26:07,604 INFO L280 TraceCheckUtils]: 66: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-10 15:26:07,604 INFO L280 TraceCheckUtils]: 67: Hoare triple {4308#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4308#false} is VALID [2020-07-10 15:26:07,605 INFO L280 TraceCheckUtils]: 68: Hoare triple {4308#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4308#false} is VALID [2020-07-10 15:26:07,605 INFO L280 TraceCheckUtils]: 69: Hoare triple {4308#false} assume !(~i~1 < 5); {4308#false} is VALID [2020-07-10 15:26:07,605 INFO L280 TraceCheckUtils]: 70: Hoare triple {4308#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4308#false} is VALID [2020-07-10 15:26:07,605 INFO L280 TraceCheckUtils]: 71: Hoare triple {4308#false} assume true; {4308#false} is VALID [2020-07-10 15:26:07,606 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {4308#false} {4308#false} #88#return; {4308#false} is VALID [2020-07-10 15:26:07,606 INFO L280 TraceCheckUtils]: 73: Hoare triple {4308#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4308#false} is VALID [2020-07-10 15:26:07,606 INFO L280 TraceCheckUtils]: 74: Hoare triple {4308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4308#false} is VALID [2020-07-10 15:26:07,608 INFO L280 TraceCheckUtils]: 75: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2020-07-10 15:26:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-07-10 15:26:07,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537779531] [2020-07-10 15:26:07,646 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:07,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379125217] [2020-07-10 15:26:07,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:07,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-10 15:26:07,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293824358] [2020-07-10 15:26:07,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-07-10 15:26:07,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:07,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:07,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:07,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:07,722 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2020-07-10 15:26:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,137 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-07-10 15:26:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:08,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-07-10 15:26:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-10 15:26:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-10 15:26:08,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2020-07-10 15:26:08,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:08,222 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:26:08,222 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:26:08,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:26:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-10 15:26:08,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:08,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:08,266 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:08,266 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,269 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:26:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:26:08,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,270 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-10 15:26:08,270 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-10 15:26:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,272 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:26:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:26:08,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:08,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 15:26:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-07-10 15:26:08,276 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 76 [2020-07-10 15:26:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:08,276 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-07-10 15:26:08,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-07-10 15:26:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-10 15:26:08,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:08,278 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:08,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-10 15:26:08,484 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash 704023820, now seen corresponding path program 4 times [2020-07-10 15:26:08,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:08,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74680146] [2020-07-10 15:26:08,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:08,502 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:08,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657371370] [2020-07-10 15:26:08,503 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:08,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:26:08,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:08,561 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:08,689 INFO L263 TraceCheckUtils]: 0: Hoare triple {4817#true} call ULTIMATE.init(); {4817#true} is VALID [2020-07-10 15:26:08,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {4817#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4817#true} is VALID [2020-07-10 15:26:08,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {4817#true} assume true; {4817#true} is VALID [2020-07-10 15:26:08,690 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4817#true} {4817#true} #78#return; {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L263 TraceCheckUtils]: 4: Hoare triple {4817#true} call #t~ret12 := main(); {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {4817#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L263 TraceCheckUtils]: 6: Hoare triple {4817#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {4817#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {4817#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {4817#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4817#true} is VALID [2020-07-10 15:26:08,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {4817#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {4817#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {4817#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {4817#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {4817#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {4817#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 16: Hoare triple {4817#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4817#true} is VALID [2020-07-10 15:26:08,692 INFO L280 TraceCheckUtils]: 17: Hoare triple {4817#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4817#true} is VALID [2020-07-10 15:26:08,693 INFO L280 TraceCheckUtils]: 18: Hoare triple {4817#true} assume !(~i~0 < 5); {4817#true} is VALID [2020-07-10 15:26:08,693 INFO L280 TraceCheckUtils]: 19: Hoare triple {4817#true} assume true; {4817#true} is VALID [2020-07-10 15:26:08,693 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4817#true} {4817#true} #82#return; {4817#true} is VALID [2020-07-10 15:26:08,693 INFO L280 TraceCheckUtils]: 21: Hoare triple {4817#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4817#true} is VALID [2020-07-10 15:26:08,693 INFO L263 TraceCheckUtils]: 22: Hoare triple {4817#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4817#true} is VALID [2020-07-10 15:26:08,694 INFO L280 TraceCheckUtils]: 23: Hoare triple {4817#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:08,694 INFO L280 TraceCheckUtils]: 24: Hoare triple {4891#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:08,695 INFO L280 TraceCheckUtils]: 25: Hoare triple {4891#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-10 15:26:08,696 INFO L280 TraceCheckUtils]: 26: Hoare triple {4891#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:08,697 INFO L280 TraceCheckUtils]: 27: Hoare triple {4901#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:08,697 INFO L280 TraceCheckUtils]: 28: Hoare triple {4901#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-10 15:26:08,698 INFO L280 TraceCheckUtils]: 29: Hoare triple {4901#(<= rangesum_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4911#(<= rangesum_~i~1 2)} is VALID [2020-07-10 15:26:08,699 INFO L280 TraceCheckUtils]: 30: Hoare triple {4911#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {4911#(<= rangesum_~i~1 2)} is VALID [2020-07-10 15:26:08,700 INFO L280 TraceCheckUtils]: 31: Hoare triple {4911#(<= rangesum_~i~1 2)} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4818#false} is VALID [2020-07-10 15:26:08,700 INFO L280 TraceCheckUtils]: 32: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,700 INFO L280 TraceCheckUtils]: 33: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,700 INFO L280 TraceCheckUtils]: 34: Hoare triple {4818#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 35: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4818#false} {4817#true} #84#return; {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 37: Hoare triple {4818#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L263 TraceCheckUtils]: 38: Hoare triple {4818#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 39: Hoare triple {4818#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 40: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 41: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 42: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 43: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 44: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 45: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 46: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 47: Hoare triple {4818#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4818#false} is VALID [2020-07-10 15:26:08,703 INFO L280 TraceCheckUtils]: 48: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,703 INFO L280 TraceCheckUtils]: 49: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,703 INFO L280 TraceCheckUtils]: 50: Hoare triple {4818#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4818#false} is VALID [2020-07-10 15:26:08,703 INFO L280 TraceCheckUtils]: 51: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-10 15:26:08,704 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4818#false} {4818#false} #86#return; {4818#false} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 53: Hoare triple {4818#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4818#false} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 54: Hoare triple {4818#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4818#false} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 55: Hoare triple {4818#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4818#false} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 56: Hoare triple {4818#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4818#false} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 57: Hoare triple {4818#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4818#false} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 58: Hoare triple {4818#false} assume !(~i~2 < 4); {4818#false} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 59: Hoare triple {4818#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {4818#false} is VALID [2020-07-10 15:26:08,705 INFO L263 TraceCheckUtils]: 60: Hoare triple {4818#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4818#false} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 61: Hoare triple {4818#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4818#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 62: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 63: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 64: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 65: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 66: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 67: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 68: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 69: Hoare triple {4818#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 70: Hoare triple {4818#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 71: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 72: Hoare triple {4818#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4818#false} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 73: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-10 15:26:08,708 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {4818#false} {4818#false} #88#return; {4818#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 75: Hoare triple {4818#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4818#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 76: Hoare triple {4818#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4818#false} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 77: Hoare triple {4818#false} assume !false; {4818#false} is VALID [2020-07-10 15:26:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-07-10 15:26:08,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74680146] [2020-07-10 15:26:08,712 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:08,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657371370] [2020-07-10 15:26:08,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:08,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:26:08,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552922731] [2020-07-10 15:26:08,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-07-10 15:26:08,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:08,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:08,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:08,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:08,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:08,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:08,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:08,780 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2020-07-10 15:26:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,075 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2020-07-10 15:26:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:26:09,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-07-10 15:26:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-10 15:26:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-10 15:26:09,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2020-07-10 15:26:09,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:09,196 INFO L225 Difference]: With dead ends: 82 [2020-07-10 15:26:09,197 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:26:09,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:26:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-10 15:26:09,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:09,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-10 15:26:09,266 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 15:26:09,266 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 15:26:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,269 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-10 15:26:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 15:26:09,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:09,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:09,270 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-10 15:26:09,270 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-10 15:26:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:09,271 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-10 15:26:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 15:26:09,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:09,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:09,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:09,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:26:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-10 15:26:09,274 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 78 [2020-07-10 15:26:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:09,274 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-10 15:26:09,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 15:26:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-10 15:26:09,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:09,275 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 9, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:09,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:09,476 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -40278520, now seen corresponding path program 5 times [2020-07-10 15:26:09,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:09,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956864974] [2020-07-10 15:26:09,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:09,494 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:09,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503590359] [2020-07-10 15:26:09,495 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:09,541 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:09,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:09,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:09,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:09,734 INFO L263 TraceCheckUtils]: 0: Hoare triple {5357#true} call ULTIMATE.init(); {5357#true} is VALID [2020-07-10 15:26:09,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {5357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5357#true} is VALID [2020-07-10 15:26:09,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {5357#true} assume true; {5357#true} is VALID [2020-07-10 15:26:09,734 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5357#true} {5357#true} #78#return; {5357#true} is VALID [2020-07-10 15:26:09,735 INFO L263 TraceCheckUtils]: 4: Hoare triple {5357#true} call #t~ret12 := main(); {5357#true} is VALID [2020-07-10 15:26:09,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {5357#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {5357#true} is VALID [2020-07-10 15:26:09,735 INFO L263 TraceCheckUtils]: 6: Hoare triple {5357#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5357#true} is VALID [2020-07-10 15:26:09,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {5357#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5357#true} is VALID [2020-07-10 15:26:09,735 INFO L280 TraceCheckUtils]: 8: Hoare triple {5357#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5357#true} is VALID [2020-07-10 15:26:09,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {5357#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5357#true} is VALID [2020-07-10 15:26:09,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {5357#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5357#true} is VALID [2020-07-10 15:26:09,736 INFO L280 TraceCheckUtils]: 11: Hoare triple {5357#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5357#true} is VALID [2020-07-10 15:26:09,736 INFO L280 TraceCheckUtils]: 12: Hoare triple {5357#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5357#true} is VALID [2020-07-10 15:26:09,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {5357#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5357#true} is VALID [2020-07-10 15:26:09,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {5357#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5357#true} is VALID [2020-07-10 15:26:09,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {5357#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5357#true} is VALID [2020-07-10 15:26:09,737 INFO L280 TraceCheckUtils]: 16: Hoare triple {5357#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5357#true} is VALID [2020-07-10 15:26:09,737 INFO L280 TraceCheckUtils]: 17: Hoare triple {5357#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5357#true} is VALID [2020-07-10 15:26:09,737 INFO L280 TraceCheckUtils]: 18: Hoare triple {5357#true} assume !(~i~0 < 5); {5357#true} is VALID [2020-07-10 15:26:09,737 INFO L280 TraceCheckUtils]: 19: Hoare triple {5357#true} assume true; {5357#true} is VALID [2020-07-10 15:26:09,738 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5357#true} {5357#true} #82#return; {5357#true} is VALID [2020-07-10 15:26:09,738 INFO L280 TraceCheckUtils]: 21: Hoare triple {5357#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5357#true} is VALID [2020-07-10 15:26:09,738 INFO L263 TraceCheckUtils]: 22: Hoare triple {5357#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5357#true} is VALID [2020-07-10 15:26:09,738 INFO L280 TraceCheckUtils]: 23: Hoare triple {5357#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5357#true} is VALID [2020-07-10 15:26:09,738 INFO L280 TraceCheckUtils]: 24: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-10 15:26:09,739 INFO L280 TraceCheckUtils]: 25: Hoare triple {5357#true} assume !(~i~1 > 2); {5357#true} is VALID [2020-07-10 15:26:09,739 INFO L280 TraceCheckUtils]: 26: Hoare triple {5357#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5357#true} is VALID [2020-07-10 15:26:09,739 INFO L280 TraceCheckUtils]: 27: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-10 15:26:09,739 INFO L280 TraceCheckUtils]: 28: Hoare triple {5357#true} assume !(~i~1 > 2); {5357#true} is VALID [2020-07-10 15:26:09,739 INFO L280 TraceCheckUtils]: 29: Hoare triple {5357#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5357#true} is VALID [2020-07-10 15:26:09,739 INFO L280 TraceCheckUtils]: 30: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-10 15:26:09,740 INFO L280 TraceCheckUtils]: 31: Hoare triple {5357#true} assume !(~i~1 > 2); {5455#(<= rangesum_~i~1 2)} is VALID [2020-07-10 15:26:09,741 INFO L280 TraceCheckUtils]: 32: Hoare triple {5455#(<= rangesum_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5459#(<= rangesum_~i~1 3)} is VALID [2020-07-10 15:26:09,742 INFO L280 TraceCheckUtils]: 33: Hoare triple {5459#(<= rangesum_~i~1 3)} assume !!(~i~1 < 5); {5459#(<= rangesum_~i~1 3)} is VALID [2020-07-10 15:26:09,742 INFO L280 TraceCheckUtils]: 34: Hoare triple {5459#(<= rangesum_~i~1 3)} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5459#(<= rangesum_~i~1 3)} is VALID [2020-07-10 15:26:09,743 INFO L280 TraceCheckUtils]: 35: Hoare triple {5459#(<= rangesum_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5469#(<= rangesum_~i~1 4)} is VALID [2020-07-10 15:26:09,744 INFO L280 TraceCheckUtils]: 36: Hoare triple {5469#(<= rangesum_~i~1 4)} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,744 INFO L280 TraceCheckUtils]: 37: Hoare triple {5358#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5358#false} is VALID [2020-07-10 15:26:09,744 INFO L280 TraceCheckUtils]: 38: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-10 15:26:09,744 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5358#false} {5357#true} #84#return; {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L280 TraceCheckUtils]: 40: Hoare triple {5358#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L263 TraceCheckUtils]: 41: Hoare triple {5358#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L280 TraceCheckUtils]: 42: Hoare triple {5358#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L280 TraceCheckUtils]: 43: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L280 TraceCheckUtils]: 44: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L280 TraceCheckUtils]: 45: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,745 INFO L280 TraceCheckUtils]: 46: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 47: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 48: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 49: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 50: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 51: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 52: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,746 INFO L280 TraceCheckUtils]: 53: Hoare triple {5358#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5358#false} is VALID [2020-07-10 15:26:09,747 INFO L280 TraceCheckUtils]: 54: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,747 INFO L280 TraceCheckUtils]: 55: Hoare triple {5358#false} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,747 INFO L280 TraceCheckUtils]: 56: Hoare triple {5358#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5358#false} is VALID [2020-07-10 15:26:09,747 INFO L280 TraceCheckUtils]: 57: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-10 15:26:09,747 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {5358#false} {5358#false} #86#return; {5358#false} is VALID [2020-07-10 15:26:09,748 INFO L280 TraceCheckUtils]: 59: Hoare triple {5358#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5358#false} is VALID [2020-07-10 15:26:09,748 INFO L280 TraceCheckUtils]: 60: Hoare triple {5358#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5358#false} is VALID [2020-07-10 15:26:09,748 INFO L280 TraceCheckUtils]: 61: Hoare triple {5358#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5358#false} is VALID [2020-07-10 15:26:09,748 INFO L280 TraceCheckUtils]: 62: Hoare triple {5358#false} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5358#false} is VALID [2020-07-10 15:26:09,748 INFO L280 TraceCheckUtils]: 63: Hoare triple {5358#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5358#false} is VALID [2020-07-10 15:26:09,748 INFO L280 TraceCheckUtils]: 64: Hoare triple {5358#false} assume !(~i~2 < 4); {5358#false} is VALID [2020-07-10 15:26:09,749 INFO L280 TraceCheckUtils]: 65: Hoare triple {5358#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {5358#false} is VALID [2020-07-10 15:26:09,749 INFO L263 TraceCheckUtils]: 66: Hoare triple {5358#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5358#false} is VALID [2020-07-10 15:26:09,749 INFO L280 TraceCheckUtils]: 67: Hoare triple {5358#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5358#false} is VALID [2020-07-10 15:26:09,749 INFO L280 TraceCheckUtils]: 68: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,749 INFO L280 TraceCheckUtils]: 69: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-10 15:26:09,750 INFO L280 TraceCheckUtils]: 70: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,750 INFO L280 TraceCheckUtils]: 71: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,750 INFO L280 TraceCheckUtils]: 72: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-10 15:26:09,750 INFO L280 TraceCheckUtils]: 73: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,750 INFO L280 TraceCheckUtils]: 74: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,751 INFO L280 TraceCheckUtils]: 75: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-10 15:26:09,751 INFO L280 TraceCheckUtils]: 76: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,751 INFO L280 TraceCheckUtils]: 77: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,751 INFO L280 TraceCheckUtils]: 78: Hoare triple {5358#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5358#false} is VALID [2020-07-10 15:26:09,751 INFO L280 TraceCheckUtils]: 79: Hoare triple {5358#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5358#false} is VALID [2020-07-10 15:26:09,751 INFO L280 TraceCheckUtils]: 80: Hoare triple {5358#false} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-10 15:26:09,752 INFO L280 TraceCheckUtils]: 81: Hoare triple {5358#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5358#false} is VALID [2020-07-10 15:26:09,752 INFO L280 TraceCheckUtils]: 82: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-10 15:26:09,752 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {5358#false} {5358#false} #88#return; {5358#false} is VALID [2020-07-10 15:26:09,753 INFO L280 TraceCheckUtils]: 84: Hoare triple {5358#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5358#false} is VALID [2020-07-10 15:26:09,753 INFO L280 TraceCheckUtils]: 85: Hoare triple {5358#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5358#false} is VALID [2020-07-10 15:26:09,753 INFO L280 TraceCheckUtils]: 86: Hoare triple {5358#false} assume !false; {5358#false} is VALID [2020-07-10 15:26:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-07-10 15:26:09,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956864974] [2020-07-10 15:26:09,783 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:09,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503590359] [2020-07-10 15:26:09,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:09,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:26:09,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555182604] [2020-07-10 15:26:09,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-07-10 15:26:09,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:09,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:09,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:09,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:09,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:09,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:09,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:09,869 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-10 15:26:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,260 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-10 15:26:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:26:10,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-07-10 15:26:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-10 15:26:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-10 15:26:10,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2020-07-10 15:26:10,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:10,373 INFO L225 Difference]: With dead ends: 88 [2020-07-10 15:26:10,373 INFO L226 Difference]: Without dead ends: 57 [2020-07-10 15:26:10,374 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-10 15:26:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-10 15:26:10,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:10,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-10 15:26:10,425 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-10 15:26:10,425 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-10 15:26:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,432 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-10 15:26:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-10 15:26:10,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:10,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:10,433 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-10 15:26:10,433 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-10 15:26:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:10,436 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-10 15:26:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-10 15:26:10,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:10,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:10,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:10,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 15:26:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-07-10 15:26:10,439 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 87 [2020-07-10 15:26:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:10,439 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-07-10 15:26:10,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-10 15:26:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-10 15:26:10,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:10,441 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:10,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-10 15:26:10,656 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1679580114, now seen corresponding path program 6 times [2020-07-10 15:26:10,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:10,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446557781] [2020-07-10 15:26:10,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:10,696 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:10,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073275035] [2020-07-10 15:26:10,697 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,089 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-10 15:26:11,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:11,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:11,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {5942#true} call ULTIMATE.init(); {5942#true} is VALID [2020-07-10 15:26:11,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {5942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5942#true} is VALID [2020-07-10 15:26:11,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-10 15:26:11,231 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5942#true} {5942#true} #78#return; {5942#true} is VALID [2020-07-10 15:26:11,231 INFO L263 TraceCheckUtils]: 4: Hoare triple {5942#true} call #t~ret12 := main(); {5942#true} is VALID [2020-07-10 15:26:11,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {5942#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {5942#true} is VALID [2020-07-10 15:26:11,231 INFO L263 TraceCheckUtils]: 6: Hoare triple {5942#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {5942#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 8: Hoare triple {5942#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 9: Hoare triple {5942#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 10: Hoare triple {5942#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 11: Hoare triple {5942#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 12: Hoare triple {5942#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5942#true} is VALID [2020-07-10 15:26:11,232 INFO L280 TraceCheckUtils]: 13: Hoare triple {5942#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 14: Hoare triple {5942#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {5942#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 16: Hoare triple {5942#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 17: Hoare triple {5942#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 18: Hoare triple {5942#true} assume !(~i~0 < 5); {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 19: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5942#true} {5942#true} #82#return; {5942#true} is VALID [2020-07-10 15:26:11,233 INFO L280 TraceCheckUtils]: 21: Hoare triple {5942#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L263 TraceCheckUtils]: 22: Hoare triple {5942#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 23: Hoare triple {5942#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 24: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 25: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 26: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 27: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,234 INFO L280 TraceCheckUtils]: 28: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 29: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 30: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 31: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 32: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 33: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 34: Hoare triple {5942#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5942#true} is VALID [2020-07-10 15:26:11,235 INFO L280 TraceCheckUtils]: 35: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 36: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 37: Hoare triple {5942#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 38: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 39: Hoare triple {5942#true} assume !(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 40: Hoare triple {5942#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L280 TraceCheckUtils]: 41: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-10 15:26:11,236 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {5942#true} {5942#true} #84#return; {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 43: Hoare triple {5942#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L263 TraceCheckUtils]: 44: Hoare triple {5942#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 45: Hoare triple {5942#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 46: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 47: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 48: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,237 INFO L280 TraceCheckUtils]: 49: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 50: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 51: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 52: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 53: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 54: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 55: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 56: Hoare triple {5942#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5942#true} is VALID [2020-07-10 15:26:11,238 INFO L280 TraceCheckUtils]: 57: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 58: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 59: Hoare triple {5942#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 60: Hoare triple {5942#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 61: Hoare triple {5942#true} assume !(~i~1 < 5); {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 62: Hoare triple {5942#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L280 TraceCheckUtils]: 63: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-10 15:26:11,239 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {5942#true} {5942#true} #86#return; {5942#true} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 65: Hoare triple {5942#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6142#(<= main_~i~2 0)} is VALID [2020-07-10 15:26:11,240 INFO L280 TraceCheckUtils]: 66: Hoare triple {6142#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6142#(<= main_~i~2 0)} is VALID [2020-07-10 15:26:11,242 INFO L280 TraceCheckUtils]: 67: Hoare triple {6142#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6149#(<= main_~i~2 1)} is VALID [2020-07-10 15:26:11,243 INFO L280 TraceCheckUtils]: 68: Hoare triple {6149#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6149#(<= main_~i~2 1)} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 69: Hoare triple {6149#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6156#(<= main_~i~2 2)} is VALID [2020-07-10 15:26:11,244 INFO L280 TraceCheckUtils]: 70: Hoare triple {6156#(<= main_~i~2 2)} assume !(~i~2 < 4); {5943#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 71: Hoare triple {5943#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {5943#false} is VALID [2020-07-10 15:26:11,245 INFO L263 TraceCheckUtils]: 72: Hoare triple {5943#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5943#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 73: Hoare triple {5943#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5943#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 74: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 75: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-10 15:26:11,245 INFO L280 TraceCheckUtils]: 76: Hoare triple {5943#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 77: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 78: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 79: Hoare triple {5943#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 80: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 81: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 82: Hoare triple {5943#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 83: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-10 15:26:11,246 INFO L280 TraceCheckUtils]: 84: Hoare triple {5943#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 85: Hoare triple {5943#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 86: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 87: Hoare triple {5943#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 88: Hoare triple {5943#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 89: Hoare triple {5943#false} assume !(~i~1 < 5); {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 90: Hoare triple {5943#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5943#false} is VALID [2020-07-10 15:26:11,247 INFO L280 TraceCheckUtils]: 91: Hoare triple {5943#false} assume true; {5943#false} is VALID [2020-07-10 15:26:11,248 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {5943#false} {5943#false} #88#return; {5943#false} is VALID [2020-07-10 15:26:11,248 INFO L280 TraceCheckUtils]: 93: Hoare triple {5943#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5943#false} is VALID [2020-07-10 15:26:11,248 INFO L280 TraceCheckUtils]: 94: Hoare triple {5943#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5943#false} is VALID [2020-07-10 15:26:11,248 INFO L280 TraceCheckUtils]: 95: Hoare triple {5943#false} assume !false; {5943#false} is VALID [2020-07-10 15:26:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-10 15:26:11,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446557781] [2020-07-10 15:26:11,254 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:11,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073275035] [2020-07-10 15:26:11,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:11,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:26:11,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782971194] [2020-07-10 15:26:11,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-07-10 15:26:11,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:11,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:11,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:11,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:11,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:11,318 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2020-07-10 15:26:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,568 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2020-07-10 15:26:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:26:11,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-07-10 15:26:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-10 15:26:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-10 15:26:11,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-10 15:26:11,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,657 INFO L225 Difference]: With dead ends: 86 [2020-07-10 15:26:11,657 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:26:11,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:26:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2020-07-10 15:26:11,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:11,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2020-07-10 15:26:11,709 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2020-07-10 15:26:11,709 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2020-07-10 15:26:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,713 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-07-10 15:26:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-10 15:26:11,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,714 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2020-07-10 15:26:11,714 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2020-07-10 15:26:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,716 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-07-10 15:26:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-10 15:26:11,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:11,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:26:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-10 15:26:11,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 96 [2020-07-10 15:26:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:11,720 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-10 15:26:11,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-10 15:26:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-10 15:26:11,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:11,722 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:11,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,938 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2078244212, now seen corresponding path program 7 times [2020-07-10 15:26:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:11,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686177665] [2020-07-10 15:26:11,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:11,964 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:11,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006281019] [2020-07-10 15:26:11,965 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:12,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:26:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:12,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:12,270 INFO L263 TraceCheckUtils]: 0: Hoare triple {6559#true} call ULTIMATE.init(); {6559#true} is VALID [2020-07-10 15:26:12,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {6559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6559#true} is VALID [2020-07-10 15:26:12,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-10 15:26:12,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6559#true} {6559#true} #78#return; {6559#true} is VALID [2020-07-10 15:26:12,272 INFO L263 TraceCheckUtils]: 4: Hoare triple {6559#true} call #t~ret12 := main(); {6559#true} is VALID [2020-07-10 15:26:12,272 INFO L280 TraceCheckUtils]: 5: Hoare triple {6559#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {6559#true} is VALID [2020-07-10 15:26:12,273 INFO L263 TraceCheckUtils]: 6: Hoare triple {6559#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-10 15:26:12,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {6559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {6559#true} is VALID [2020-07-10 15:26:12,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {6559#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6559#true} is VALID [2020-07-10 15:26:12,274 INFO L280 TraceCheckUtils]: 9: Hoare triple {6559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6559#true} is VALID [2020-07-10 15:26:12,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {6559#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6559#true} is VALID [2020-07-10 15:26:12,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {6559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6559#true} is VALID [2020-07-10 15:26:12,275 INFO L280 TraceCheckUtils]: 12: Hoare triple {6559#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6559#true} is VALID [2020-07-10 15:26:12,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {6559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6559#true} is VALID [2020-07-10 15:26:12,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {6559#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6559#true} is VALID [2020-07-10 15:26:12,275 INFO L280 TraceCheckUtils]: 15: Hoare triple {6559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6559#true} is VALID [2020-07-10 15:26:12,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {6559#true} assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6559#true} is VALID [2020-07-10 15:26:12,275 INFO L280 TraceCheckUtils]: 17: Hoare triple {6559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6559#true} is VALID [2020-07-10 15:26:12,276 INFO L280 TraceCheckUtils]: 18: Hoare triple {6559#true} assume !(~i~0 < 5); {6559#true} is VALID [2020-07-10 15:26:12,276 INFO L280 TraceCheckUtils]: 19: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-10 15:26:12,276 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {6559#true} {6559#true} #82#return; {6559#true} is VALID [2020-07-10 15:26:12,276 INFO L280 TraceCheckUtils]: 21: Hoare triple {6559#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6559#true} is VALID [2020-07-10 15:26:12,276 INFO L263 TraceCheckUtils]: 22: Hoare triple {6559#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-10 15:26:12,277 INFO L280 TraceCheckUtils]: 23: Hoare triple {6559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6559#true} is VALID [2020-07-10 15:26:12,277 INFO L280 TraceCheckUtils]: 24: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-10 15:26:12,277 INFO L280 TraceCheckUtils]: 26: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,277 INFO L280 TraceCheckUtils]: 27: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,278 INFO L280 TraceCheckUtils]: 28: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-10 15:26:12,278 INFO L280 TraceCheckUtils]: 29: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,278 INFO L280 TraceCheckUtils]: 30: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,278 INFO L280 TraceCheckUtils]: 31: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-10 15:26:12,279 INFO L280 TraceCheckUtils]: 32: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,279 INFO L280 TraceCheckUtils]: 33: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,279 INFO L280 TraceCheckUtils]: 34: Hoare triple {6559#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6559#true} is VALID [2020-07-10 15:26:12,280 INFO L280 TraceCheckUtils]: 35: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,280 INFO L280 TraceCheckUtils]: 36: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,280 INFO L280 TraceCheckUtils]: 37: Hoare triple {6559#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6559#true} is VALID [2020-07-10 15:26:12,280 INFO L280 TraceCheckUtils]: 38: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,280 INFO L280 TraceCheckUtils]: 39: Hoare triple {6559#true} assume !(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,281 INFO L280 TraceCheckUtils]: 40: Hoare triple {6559#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6559#true} is VALID [2020-07-10 15:26:12,281 INFO L280 TraceCheckUtils]: 41: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-10 15:26:12,281 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {6559#true} {6559#true} #84#return; {6559#true} is VALID [2020-07-10 15:26:12,281 INFO L280 TraceCheckUtils]: 43: Hoare triple {6559#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6559#true} is VALID [2020-07-10 15:26:12,282 INFO L263 TraceCheckUtils]: 44: Hoare triple {6559#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-10 15:26:12,282 INFO L280 TraceCheckUtils]: 45: Hoare triple {6559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6559#true} is VALID [2020-07-10 15:26:12,282 INFO L280 TraceCheckUtils]: 46: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,282 INFO L280 TraceCheckUtils]: 47: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-10 15:26:12,282 INFO L280 TraceCheckUtils]: 48: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,283 INFO L280 TraceCheckUtils]: 49: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,283 INFO L280 TraceCheckUtils]: 50: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-10 15:26:12,283 INFO L280 TraceCheckUtils]: 51: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,284 INFO L280 TraceCheckUtils]: 52: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,284 INFO L280 TraceCheckUtils]: 53: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-10 15:26:12,284 INFO L280 TraceCheckUtils]: 54: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,285 INFO L280 TraceCheckUtils]: 55: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,285 INFO L280 TraceCheckUtils]: 56: Hoare triple {6559#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6559#true} is VALID [2020-07-10 15:26:12,285 INFO L280 TraceCheckUtils]: 57: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,286 INFO L280 TraceCheckUtils]: 58: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,286 INFO L280 TraceCheckUtils]: 59: Hoare triple {6559#true} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6559#true} is VALID [2020-07-10 15:26:12,286 INFO L280 TraceCheckUtils]: 60: Hoare triple {6559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6559#true} is VALID [2020-07-10 15:26:12,287 INFO L280 TraceCheckUtils]: 61: Hoare triple {6559#true} assume !(~i~1 < 5); {6559#true} is VALID [2020-07-10 15:26:12,287 INFO L280 TraceCheckUtils]: 62: Hoare triple {6559#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6559#true} is VALID [2020-07-10 15:26:12,287 INFO L280 TraceCheckUtils]: 63: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-10 15:26:12,288 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {6559#true} {6559#true} #86#return; {6559#true} is VALID [2020-07-10 15:26:12,289 INFO L280 TraceCheckUtils]: 65: Hoare triple {6559#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6759#(<= main_~i~2 0)} is VALID [2020-07-10 15:26:12,290 INFO L280 TraceCheckUtils]: 66: Hoare triple {6759#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6759#(<= main_~i~2 0)} is VALID [2020-07-10 15:26:12,293 INFO L280 TraceCheckUtils]: 67: Hoare triple {6759#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6766#(<= main_~i~2 1)} is VALID [2020-07-10 15:26:12,294 INFO L280 TraceCheckUtils]: 68: Hoare triple {6766#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6766#(<= main_~i~2 1)} is VALID [2020-07-10 15:26:12,297 INFO L280 TraceCheckUtils]: 69: Hoare triple {6766#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6773#(<= main_~i~2 2)} is VALID [2020-07-10 15:26:12,298 INFO L280 TraceCheckUtils]: 70: Hoare triple {6773#(<= main_~i~2 2)} assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6773#(<= main_~i~2 2)} is VALID [2020-07-10 15:26:12,301 INFO L280 TraceCheckUtils]: 71: Hoare triple {6773#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6780#(<= main_~i~2 3)} is VALID [2020-07-10 15:26:12,302 INFO L280 TraceCheckUtils]: 72: Hoare triple {6780#(<= main_~i~2 3)} assume !(~i~2 < 4); {6560#false} is VALID [2020-07-10 15:26:12,303 INFO L280 TraceCheckUtils]: 73: Hoare triple {6560#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {6560#false} is VALID [2020-07-10 15:26:12,303 INFO L263 TraceCheckUtils]: 74: Hoare triple {6560#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6560#false} is VALID [2020-07-10 15:26:12,303 INFO L280 TraceCheckUtils]: 75: Hoare triple {6560#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6560#false} is VALID [2020-07-10 15:26:12,304 INFO L280 TraceCheckUtils]: 76: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-10 15:26:12,304 INFO L280 TraceCheckUtils]: 77: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-10 15:26:12,304 INFO L280 TraceCheckUtils]: 78: Hoare triple {6560#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6560#false} is VALID [2020-07-10 15:26:12,304 INFO L280 TraceCheckUtils]: 79: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-10 15:26:12,304 INFO L280 TraceCheckUtils]: 80: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-10 15:26:12,305 INFO L280 TraceCheckUtils]: 81: Hoare triple {6560#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6560#false} is VALID [2020-07-10 15:26:12,305 INFO L280 TraceCheckUtils]: 82: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-10 15:26:12,305 INFO L280 TraceCheckUtils]: 83: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-10 15:26:12,305 INFO L280 TraceCheckUtils]: 84: Hoare triple {6560#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6560#false} is VALID [2020-07-10 15:26:12,306 INFO L280 TraceCheckUtils]: 85: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-10 15:26:12,306 INFO L280 TraceCheckUtils]: 86: Hoare triple {6560#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6560#false} is VALID [2020-07-10 15:26:12,306 INFO L280 TraceCheckUtils]: 87: Hoare triple {6560#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6560#false} is VALID [2020-07-10 15:26:12,306 INFO L280 TraceCheckUtils]: 88: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-10 15:26:12,307 INFO L280 TraceCheckUtils]: 89: Hoare triple {6560#false} assume ~i~1 > 2;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6560#false} is VALID [2020-07-10 15:26:12,307 INFO L280 TraceCheckUtils]: 90: Hoare triple {6560#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6560#false} is VALID [2020-07-10 15:26:12,307 INFO L280 TraceCheckUtils]: 91: Hoare triple {6560#false} assume !(~i~1 < 5); {6560#false} is VALID [2020-07-10 15:26:12,307 INFO L280 TraceCheckUtils]: 92: Hoare triple {6560#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6560#false} is VALID [2020-07-10 15:26:12,307 INFO L280 TraceCheckUtils]: 93: Hoare triple {6560#false} assume true; {6560#false} is VALID [2020-07-10 15:26:12,308 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {6560#false} {6560#false} #88#return; {6560#false} is VALID [2020-07-10 15:26:12,308 INFO L280 TraceCheckUtils]: 95: Hoare triple {6560#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6560#false} is VALID [2020-07-10 15:26:12,308 INFO L280 TraceCheckUtils]: 96: Hoare triple {6560#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6560#false} is VALID [2020-07-10 15:26:12,308 INFO L280 TraceCheckUtils]: 97: Hoare triple {6560#false} assume !false; {6560#false} is VALID [2020-07-10 15:26:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-10 15:26:12,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686177665] [2020-07-10 15:26:12,316 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:12,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006281019] [2020-07-10 15:26:12,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:12,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:26:12,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930988287] [2020-07-10 15:26:12,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-10 15:26:12,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:12,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:26:12,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:12,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:26:12,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:26:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:12,397 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2020-07-10 15:26:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:12,667 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2020-07-10 15:26:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:12,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-10 15:26:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-10 15:26:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:26:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-10 15:26:12,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2020-07-10 15:26:12,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:12,786 INFO L225 Difference]: With dead ends: 87 [2020-07-10 15:26:12,786 INFO L226 Difference]: Without dead ends: 61 [2020-07-10 15:26:12,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-10 15:26:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-10 15:26:12,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:12,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2020-07-10 15:26:12,855 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-10 15:26:12,855 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-10 15:26:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:12,858 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-07-10 15:26:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-10 15:26:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:12,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:12,861 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-10 15:26:12,861 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-10 15:26:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:12,864 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-07-10 15:26:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-10 15:26:12,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:12,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:12,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:12,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 15:26:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-07-10 15:26:12,869 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 98 [2020-07-10 15:26:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:12,869 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-07-10 15:26:12,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:26:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-10 15:26:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-10 15:26:12,872 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:12,872 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:13,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-10 15:26:13,086 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:13,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614250, now seen corresponding path program 8 times [2020-07-10 15:26:13,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:13,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560719186] [2020-07-10 15:26:13,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:13,128 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:13,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030634076] [2020-07-10 15:26:13,129 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:13,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:13,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-10 15:26:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:13,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:13,798 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:14,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-10 15:26:14,112 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:14,112 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:14,112 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:14,112 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:14,112 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:26:14,113 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:26:14,114 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:26:14,115 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:26:14,116 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:14,117 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 15:26:14,118 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:14,119 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:14,119 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:14,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:14 BoogieIcfgContainer [2020-07-10 15:26:14,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:14,129 INFO L168 Benchmark]: Toolchain (without parser) took 20101.52 ms. Allocated memory was 136.8 MB in the beginning and 374.9 MB in the end (delta: 238.0 MB). Free memory was 100.4 MB in the beginning and 212.7 MB in the end (delta: -112.3 MB). Peak memory consumption was 125.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:14,130 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:14,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.03 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 88.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:14,131 INFO L168 Benchmark]: Boogie Preprocessor took 148.56 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 88.9 MB in the beginning and 177.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:14,131 INFO L168 Benchmark]: RCFGBuilder took 646.75 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 149.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:14,132 INFO L168 Benchmark]: TraceAbstraction took 18977.44 ms. Allocated memory was 199.8 MB in the beginning and 374.9 MB in the end (delta: 175.1 MB). Free memory was 148.7 MB in the beginning and 212.7 MB in the end (delta: -64.1 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:14,134 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 321.03 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 88.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.56 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 88.9 MB in the beginning and 177.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 646.75 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 149.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18977.44 ms. Allocated memory was 199.8 MB in the beginning and 374.9 MB in the end (delta: 175.1 MB). Free memory was 148.7 MB in the beginning and 212.7 MB in the end (delta: -64.1 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[5]; VAL [x={2:0}] [L32] CALL init_nondet(x) VAL [x={2:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={2:0}, x={2:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={2:0}, x={2:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={2:0}, x={2:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={2:0}, x={2:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={2:0}, x={2:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={2:0}, x={2:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={2:0}, x={2:0}] [L32] RET init_nondet(x) VAL [x={2:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={2:0}] [L38] CALL, EXPR rangesum(x) VAL [x={2:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-2147483640, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=-2147483640, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-2147483640, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=1, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=1, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=1, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=1, x={2:0}, x={2:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={2:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=0, temp=-2147483648, x={2:0}] [L41] CALL, EXPR rangesum(x) VAL [x={2:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-2147483640, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=-2147483640, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-2147483640, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=1, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=1, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=1, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=1, x={2:0}, x={2:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={2:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L47] CALL, EXPR rangesum(x) VAL [x={2:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=2147483641, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=2147483641, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=2147483641, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=-6, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=-6, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=-6, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-3, cnt=2, i=5, ret=-6, x={2:0}, x={2:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=-3, ret=0, ret2=0, temp=-2147483647, x={2:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=-3, temp=-2147483647, x={2:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=-3, temp=-2147483647, x={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.7s, OverallIterations: 16, TraceHistogramMax: 15, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 532 SDtfs, 108 SDslu, 895 SDs, 0 SdLazy, 303 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 974 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1423 NumberOfCodeBlocks, 1252 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1122 ConstructedInterpolants, 0 QuantifiedInterpolants, 89157 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2541 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2223/2300 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...