/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-46f3038-m [2020-07-08 12:44:13,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:13,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:13,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:13,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:13,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:13,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:13,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:13,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:13,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:13,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:13,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:13,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:13,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:13,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:13,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:13,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:13,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:13,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:13,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:13,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:13,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:13,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:13,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:13,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:13,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:13,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:13,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:13,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:13,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:13,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:13,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:13,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:13,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:13,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:13,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:13,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:13,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:13,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:13,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:13,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:13,605 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-08 12:44:13,620 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:13,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:13,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:13,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:13,622 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:13,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:13,622 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:13,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:13,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:13,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:13,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:13,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:13,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:13,624 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:13,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:13,624 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:13,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:13,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:13,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:13,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:13,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:13,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:13,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:13,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:13,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:13,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:13,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:13,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:13,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:13,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:13,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:13,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:13,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:13,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:13,986 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:13,987 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i [2020-07-08 12:44:14,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11726f194/42efee942e514451a1d706f3f9e0d7cf/FLAGc1dc9fd8c [2020-07-08 12:44:14,512 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:14,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i [2020-07-08 12:44:14,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11726f194/42efee942e514451a1d706f3f9e0d7cf/FLAGc1dc9fd8c [2020-07-08 12:44:14,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11726f194/42efee942e514451a1d706f3f9e0d7cf [2020-07-08 12:44:14,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:14,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:14,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:14,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:14,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:14,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:14" (1/1) ... [2020-07-08 12:44:14,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38725cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:14, skipping insertion in model container [2020-07-08 12:44:14,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:14" (1/1) ... [2020-07-08 12:44:14,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:14,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:15,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:15,130 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:15,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:15,178 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:15,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15 WrapperNode [2020-07-08 12:44:15,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:15,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:15,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:15,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:15,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (1/1) ... [2020-07-08 12:44:15,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:15,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:15,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:15,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:15,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (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-08 12:44:15,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:15,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:15,389 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2020-07-08 12:44:15,389 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2020-07-08 12:44:15,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2020-07-08 12:44:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2020-07-08 12:44:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:44:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:15,956 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:15,957 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:44:15,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:15 BoogieIcfgContainer [2020-07-08 12:44:15,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:15,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:15,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:15,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:15,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:14" (1/3) ... [2020-07-08 12:44:15,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef1d336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:15, skipping insertion in model container [2020-07-08 12:44:15,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:15" (2/3) ... [2020-07-08 12:44:15,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef1d336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:15, skipping insertion in model container [2020-07-08 12:44:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:15" (3/3) ... [2020-07-08 12:44:15,980 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2020-07-08 12:44:15,990 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:15,999 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:16,014 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:16,038 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:16,039 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:16,039 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:16,039 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:16,039 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:16,039 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:16,040 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:16,040 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-08 12:44:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:44:16,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:16,065 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-08 12:44:16,065 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2020-07-08 12:44:16,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:16,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104296508] [2020-07-08 12:44:16,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104296508] [2020-07-08 12:44:16,231 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-08 12:44:16,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546757762] [2020-07-08 12:44:16,232 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-08 12:44:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-08 12:44:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:16,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:16,484 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2020-07-08 12:44:16,484 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-08 12:44:16,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-08 12:44:16,485 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #78#return; {40#true} is VALID [2020-07-08 12:44:16,485 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2020-07-08 12:44:16,486 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {40#true} is VALID [2020-07-08 12:44:16,486 INFO L263 TraceCheckUtils]: 6: Hoare triple {40#true} call init_nondet(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2020-07-08 12:44:16,487 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-08 12:44:16,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} assume !(~i~0 < 5); {40#true} is VALID [2020-07-08 12:44:16,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-08 12:44:16,488 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #82#return; {40#true} is VALID [2020-07-08 12:44:16,488 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-08 12:44:16,488 INFO L263 TraceCheckUtils]: 12: Hoare triple {40#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2020-07-08 12:44:16,489 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-08 12:44:16,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-08 12:44:16,490 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-08 12:44:16,491 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-08 12:44:16,491 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {41#false} {40#true} #84#return; {41#false} is VALID [2020-07-08 12:44:16,491 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-08 12:44:16,492 INFO L263 TraceCheckUtils]: 19: Hoare triple {41#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2020-07-08 12:44:16,492 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-08 12:44:16,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-08 12:44:16,493 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-08 12:44:16,493 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-08 12:44:16,493 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {41#false} {41#false} #86#return; {41#false} is VALID [2020-07-08 12:44:16,494 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-08 12:44:16,494 INFO L280 TraceCheckUtils]: 26: Hoare triple {41#false} assume !(~i~2 < 4); {41#false} is VALID [2020-07-08 12:44:16,494 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-08 12:44:16,495 INFO L263 TraceCheckUtils]: 28: Hoare triple {41#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2020-07-08 12:44:16,495 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-08 12:44:16,495 INFO L280 TraceCheckUtils]: 30: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-08 12:44:16,496 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-08 12:44:16,496 INFO L280 TraceCheckUtils]: 32: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-08 12:44:16,496 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {41#false} {41#false} #88#return; {41#false} is VALID [2020-07-08 12:44:16,497 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-08 12:44:16,497 INFO L280 TraceCheckUtils]: 35: Hoare triple {41#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {41#false} is VALID [2020-07-08 12:44:16,497 INFO L280 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-08 12:44:16,504 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-08 12:44:16,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:16,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:44:16,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708770623] [2020-07-08 12:44:16,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-07-08 12:44:16,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:16,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:44:16,576 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-08 12:44:16,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:44:16,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:44:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:44:16,589 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-08 12:44:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:16,691 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2020-07-08 12:44:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:44:16,691 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-07-08 12:44:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:44:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2020-07-08 12:44:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:44:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2020-07-08 12:44:16,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2020-07-08 12:44:16,877 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-08 12:44:16,891 INFO L225 Difference]: With dead ends: 64 [2020-07-08 12:44:16,891 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 12:44:16,896 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-08 12:44:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 12:44:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 12:44:16,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:16,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 12:44:16,941 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 12:44:16,941 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 12:44:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:16,948 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-08 12:44:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-08 12:44:16,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:16,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:16,950 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 12:44:16,950 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 12:44:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:16,956 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-08 12:44:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-08 12:44:16,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:16,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:16,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:16,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:44:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-08 12:44:16,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2020-07-08 12:44:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:16,966 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-08 12:44:16,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:44:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-08 12:44:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:44:16,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:16,969 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-08 12:44:17,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-08 12:44:17,184 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2020-07-08 12:44:17,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:17,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471796484] [2020-07-08 12:44:17,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:17,207 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:17,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470270804] [2020-07-08 12:44:17,208 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-08 12:44:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:17,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-08 12:44:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:17,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:17,374 INFO L263 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2020-07-08 12:44:17,375 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-08 12:44:17,375 INFO L280 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-08 12:44:17,375 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #78#return; {344#true} is VALID [2020-07-08 12:44:17,376 INFO L263 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret12 := main(); {344#true} is VALID [2020-07-08 12:44:17,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {344#true} is VALID [2020-07-08 12:44:17,376 INFO L263 TraceCheckUtils]: 6: Hoare triple {344#true} call init_nondet(~#x~0.base, ~#x~0.offset); {344#true} is VALID [2020-07-08 12:44:17,377 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-08 12:44:17,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {370#(<= init_nondet_~i~0 0)} assume !(~i~0 < 5); {345#false} is VALID [2020-07-08 12:44:17,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-08 12:44:17,379 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {345#false} {344#true} #82#return; {345#false} is VALID [2020-07-08 12:44:17,380 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-08 12:44:17,380 INFO L263 TraceCheckUtils]: 12: Hoare triple {345#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-08 12:44:17,380 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-08 12:44:17,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-08 12:44:17,381 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-08 12:44:17,381 INFO L280 TraceCheckUtils]: 16: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-08 12:44:17,382 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {345#false} {345#false} #84#return; {345#false} is VALID [2020-07-08 12:44:17,382 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-08 12:44:17,382 INFO L263 TraceCheckUtils]: 19: Hoare triple {345#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-08 12:44:17,383 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-08 12:44:17,383 INFO L280 TraceCheckUtils]: 21: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-08 12:44:17,383 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-08 12:44:17,383 INFO L280 TraceCheckUtils]: 23: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-08 12:44:17,384 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {345#false} {345#false} #86#return; {345#false} is VALID [2020-07-08 12:44:17,384 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-08 12:44:17,384 INFO L280 TraceCheckUtils]: 26: Hoare triple {345#false} assume !(~i~2 < 4); {345#false} is VALID [2020-07-08 12:44:17,385 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-08 12:44:17,385 INFO L263 TraceCheckUtils]: 28: Hoare triple {345#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-08 12:44:17,385 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-08 12:44:17,386 INFO L280 TraceCheckUtils]: 30: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-08 12:44:17,386 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-08 12:44:17,386 INFO L280 TraceCheckUtils]: 32: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-08 12:44:17,387 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {345#false} {345#false} #88#return; {345#false} is VALID [2020-07-08 12:44:17,387 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-08 12:44:17,387 INFO L280 TraceCheckUtils]: 35: Hoare triple {345#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {345#false} is VALID [2020-07-08 12:44:17,388 INFO L280 TraceCheckUtils]: 36: Hoare triple {345#false} assume !false; {345#false} is VALID [2020-07-08 12:44:17,390 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-08 12:44:17,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471796484] [2020-07-08 12:44:17,391 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:17,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470270804] [2020-07-08 12:44:17,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:17,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:17,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548688004] [2020-07-08 12:44:17,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-08 12:44:17,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:17,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:17,437 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-08 12:44:17,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:17,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:17,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:17,438 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2020-07-08 12:44:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,119 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-07-08 12:44:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:18,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-08 12:44:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-08 12:44:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-08 12:44:18,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2020-07-08 12:44:18,222 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-08 12:44:18,224 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:44:18,225 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:44:18,226 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-08 12:44:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:44:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-08 12:44:18,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:18,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-08 12:44:18,241 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-08 12:44:18,241 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-08 12:44:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,245 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-08 12:44:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-08 12:44:18,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:18,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:18,246 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-08 12:44:18,246 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-08 12:44:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,250 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-08 12:44:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-08 12:44:18,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:18,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:18,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:18,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:44:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-07-08 12:44:18,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2020-07-08 12:44:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:18,256 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-08 12:44:18,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-08 12:44:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 12:44:18,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:18,259 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-08 12:44:18,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:18,473 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:18,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2020-07-08 12:44:18,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:18,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846234668] [2020-07-08 12:44:18,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:18,494 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:18,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411708443] [2020-07-08 12:44:18,495 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-08 12:44:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-08 12:44:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:18,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:18,635 INFO L263 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2020-07-08 12:44:18,635 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-08 12:44:18,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-08 12:44:18,636 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #78#return; {648#true} is VALID [2020-07-08 12:44:18,637 INFO L263 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret12 := main(); {648#true} is VALID [2020-07-08 12:44:18,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {648#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {648#true} is VALID [2020-07-08 12:44:18,637 INFO L263 TraceCheckUtils]: 6: Hoare triple {648#true} call init_nondet(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2020-07-08 12:44:18,638 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-08 12:44:18,638 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-08 12:44:18,638 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-08 12:44:18,639 INFO L280 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(~i~0 < 5); {648#true} is VALID [2020-07-08 12:44:18,639 INFO L280 TraceCheckUtils]: 11: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-08 12:44:18,639 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {648#true} {648#true} #82#return; {648#true} is VALID [2020-07-08 12:44:18,640 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-08 12:44:18,641 INFO L263 TraceCheckUtils]: 14: Hoare triple {648#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2020-07-08 12:44:18,642 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-08 12:44:18,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {698#(<= rangesum_~i~1 0)} assume !(~i~1 < 5); {649#false} is VALID [2020-07-08 12:44:18,644 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-08 12:44:18,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-08 12:44:18,645 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {649#false} {648#true} #84#return; {649#false} is VALID [2020-07-08 12:44:18,645 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-08 12:44:18,645 INFO L263 TraceCheckUtils]: 21: Hoare triple {649#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2020-07-08 12:44:18,646 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-08 12:44:18,646 INFO L280 TraceCheckUtils]: 23: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2020-07-08 12:44:18,647 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-08 12:44:18,647 INFO L280 TraceCheckUtils]: 25: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-08 12:44:18,648 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {649#false} {649#false} #86#return; {649#false} is VALID [2020-07-08 12:44:18,648 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-08 12:44:18,653 INFO L280 TraceCheckUtils]: 28: Hoare triple {649#false} assume !(~i~2 < 4); {649#false} is VALID [2020-07-08 12:44:18,653 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-08 12:44:18,654 INFO L263 TraceCheckUtils]: 30: Hoare triple {649#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2020-07-08 12:44:18,654 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-08 12:44:18,654 INFO L280 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2020-07-08 12:44:18,654 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-08 12:44:18,655 INFO L280 TraceCheckUtils]: 34: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-08 12:44:18,655 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {649#false} {649#false} #88#return; {649#false} is VALID [2020-07-08 12:44:18,655 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-08 12:44:18,656 INFO L280 TraceCheckUtils]: 37: Hoare triple {649#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {649#false} is VALID [2020-07-08 12:44:18,656 INFO L280 TraceCheckUtils]: 38: Hoare triple {649#false} assume !false; {649#false} is VALID [2020-07-08 12:44:18,672 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-08 12:44:18,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846234668] [2020-07-08 12:44:18,673 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:18,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411708443] [2020-07-08 12:44:18,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:18,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:18,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799548294] [2020-07-08 12:44:18,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-08 12:44:18,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:18,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:18,724 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-08 12:44:18,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:18,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:18,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:18,726 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2020-07-08 12:44:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,864 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-08 12:44:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:18,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-08 12:44:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-08 12:44:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-08 12:44:18,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2020-07-08 12:44:18,955 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-08 12:44:18,957 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:44:18,957 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:44:18,958 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-08 12:44:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:44:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-08 12:44:18,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:18,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-08 12:44:18,971 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-08 12:44:18,971 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-08 12:44:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,974 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-08 12:44:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-08 12:44:18,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:18,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:18,976 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-08 12:44:18,976 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-08 12:44:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:18,979 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-08 12:44:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-08 12:44:18,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:18,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:18,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:18,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 12:44:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-07-08 12:44:18,983 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2020-07-08 12:44:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:18,984 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-07-08 12:44:18,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-08 12:44:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 12:44:18,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:18,986 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-08 12:44:19,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:19,201 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2020-07-08 12:44:19,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:19,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905088350] [2020-07-08 12:44:19,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:19,225 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:19,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150752967] [2020-07-08 12:44:19,226 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-08 12:44:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-08 12:44:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:19,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2020-07-08 12:44:19,357 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-08 12:44:19,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-08 12:44:19,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #78#return; {963#true} is VALID [2020-07-08 12:44:19,358 INFO L263 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret12 := main(); {963#true} is VALID [2020-07-08 12:44:19,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {963#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {963#true} is VALID [2020-07-08 12:44:19,358 INFO L263 TraceCheckUtils]: 6: Hoare triple {963#true} call init_nondet(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-08 12:44:19,358 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-08 12:44:19,359 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-08 12:44:19,359 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-08 12:44:19,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {963#true} assume !(~i~0 < 5); {963#true} is VALID [2020-07-08 12:44:19,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-08 12:44:19,360 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {963#true} {963#true} #82#return; {963#true} is VALID [2020-07-08 12:44:19,360 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-08 12:44:19,360 INFO L263 TraceCheckUtils]: 14: Hoare triple {963#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-08 12:44:19,361 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-08 12:44:19,361 INFO L280 TraceCheckUtils]: 16: Hoare triple {963#true} assume !!(~i~1 < 5); {963#true} is VALID [2020-07-08 12:44:19,361 INFO L280 TraceCheckUtils]: 17: Hoare triple {963#true} assume !(~i~1 > 2); {963#true} is VALID [2020-07-08 12:44:19,362 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-08 12:44:19,362 INFO L280 TraceCheckUtils]: 19: Hoare triple {963#true} assume !(~i~1 < 5); {963#true} is VALID [2020-07-08 12:44:19,362 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-08 12:44:19,362 INFO L280 TraceCheckUtils]: 21: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-08 12:44:19,363 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {963#true} {963#true} #84#return; {963#true} is VALID [2020-07-08 12:44:19,363 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-08 12:44:19,363 INFO L263 TraceCheckUtils]: 24: Hoare triple {963#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-08 12:44:19,363 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-08 12:44:19,364 INFO L280 TraceCheckUtils]: 26: Hoare triple {963#true} assume !!(~i~1 < 5); {963#true} is VALID [2020-07-08 12:44:19,364 INFO L280 TraceCheckUtils]: 27: Hoare triple {963#true} assume !(~i~1 > 2); {963#true} is VALID [2020-07-08 12:44:19,364 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-08 12:44:19,364 INFO L280 TraceCheckUtils]: 29: Hoare triple {963#true} assume !(~i~1 < 5); {963#true} is VALID [2020-07-08 12:44:19,365 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-08 12:44:19,365 INFO L280 TraceCheckUtils]: 31: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-08 12:44:19,365 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {963#true} {963#true} #86#return; {963#true} is VALID [2020-07-08 12:44:19,366 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-08 12:44:19,368 INFO L280 TraceCheckUtils]: 34: Hoare triple {1067#(<= main_~i~2 0)} assume !(~i~2 < 4); {964#false} is VALID [2020-07-08 12:44:19,368 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-08 12:44:19,368 INFO L263 TraceCheckUtils]: 36: Hoare triple {964#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {964#false} is VALID [2020-07-08 12:44:19,369 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-08 12:44:19,369 INFO L280 TraceCheckUtils]: 38: Hoare triple {964#false} assume !!(~i~1 < 5); {964#false} is VALID [2020-07-08 12:44:19,369 INFO L280 TraceCheckUtils]: 39: Hoare triple {964#false} assume !(~i~1 > 2); {964#false} is VALID [2020-07-08 12:44:19,369 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-08 12:44:19,370 INFO L280 TraceCheckUtils]: 41: Hoare triple {964#false} assume !(~i~1 < 5); {964#false} is VALID [2020-07-08 12:44:19,370 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-08 12:44:19,370 INFO L280 TraceCheckUtils]: 43: Hoare triple {964#false} assume true; {964#false} is VALID [2020-07-08 12:44:19,371 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {964#false} {964#false} #88#return; {964#false} is VALID [2020-07-08 12:44:19,371 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-08 12:44:19,371 INFO L280 TraceCheckUtils]: 46: Hoare triple {964#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {964#false} is VALID [2020-07-08 12:44:19,371 INFO L280 TraceCheckUtils]: 47: Hoare triple {964#false} assume !false; {964#false} is VALID [2020-07-08 12:44:19,374 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-08 12:44:19,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905088350] [2020-07-08 12:44:19,374 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:19,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150752967] [2020-07-08 12:44:19,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:19,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:19,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737792061] [2020-07-08 12:44:19,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-08 12:44:19,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:19,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:19,434 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-08 12:44:19,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:19,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:19,435 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2020-07-08 12:44:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:19,530 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-08 12:44:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:19,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-08 12:44:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-08 12:44:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-08 12:44:19,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2020-07-08 12:44:19,599 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-08 12:44:19,602 INFO L225 Difference]: With dead ends: 52 [2020-07-08 12:44:19,602 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 12:44:19,603 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-08 12:44:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 12:44:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-08 12:44:19,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:19,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-08 12:44:19,614 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-08 12:44:19,614 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-08 12:44:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:19,616 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-08 12:44:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-08 12:44:19,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:19,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:19,617 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-08 12:44:19,618 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-08 12:44:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:19,620 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-08 12:44:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-08 12:44:19,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:19,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:19,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:19,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:44:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2020-07-08 12:44:19,624 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 48 [2020-07-08 12:44:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:19,625 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2020-07-08 12:44:19,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-08 12:44:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 12:44:19,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:19,626 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-08 12:44:19,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:19,840 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 494084840, now seen corresponding path program 1 times [2020-07-08 12:44:19,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:19,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004911786] [2020-07-08 12:44:19,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:19,866 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:19,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208952640] [2020-07-08 12:44:19,868 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-08 12:44:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:44:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:19,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:20,001 INFO L263 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2020-07-08 12:44:20,002 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-08 12:44:20,002 INFO L280 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-08 12:44:20,002 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #78#return; {1307#true} is VALID [2020-07-08 12:44:20,002 INFO L263 TraceCheckUtils]: 4: Hoare triple {1307#true} call #t~ret12 := main(); {1307#true} is VALID [2020-07-08 12:44:20,003 INFO L280 TraceCheckUtils]: 5: Hoare triple {1307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1307#true} is VALID [2020-07-08 12:44:20,003 INFO L263 TraceCheckUtils]: 6: Hoare triple {1307#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1307#true} is VALID [2020-07-08 12:44:20,003 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-08 12:44:20,003 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-08 12:44:20,004 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-08 12:44:20,004 INFO L280 TraceCheckUtils]: 10: Hoare triple {1307#true} assume !(~i~0 < 5); {1307#true} is VALID [2020-07-08 12:44:20,004 INFO L280 TraceCheckUtils]: 11: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-08 12:44:20,004 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1307#true} {1307#true} #82#return; {1307#true} is VALID [2020-07-08 12:44:20,004 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-08 12:44:20,005 INFO L263 TraceCheckUtils]: 14: Hoare triple {1307#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1307#true} is VALID [2020-07-08 12:44:20,007 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-08 12:44:20,008 INFO L280 TraceCheckUtils]: 16: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !!(~i~1 < 5); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-08 12:44:20,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !(~i~1 > 2); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-08 12:44:20,009 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-08 12:44:20,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !(~i~1 < 5); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-08 12:44:20,010 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-08 12:44:20,010 INFO L280 TraceCheckUtils]: 21: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-08 12:44:20,010 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1308#false} {1307#true} #84#return; {1308#false} is VALID [2020-07-08 12:44:20,011 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-08 12:44:20,011 INFO L263 TraceCheckUtils]: 24: Hoare triple {1308#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1308#false} is VALID [2020-07-08 12:44:20,011 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-08 12:44:20,011 INFO L280 TraceCheckUtils]: 26: Hoare triple {1308#false} assume !!(~i~1 < 5); {1308#false} is VALID [2020-07-08 12:44:20,012 INFO L280 TraceCheckUtils]: 27: Hoare triple {1308#false} assume !(~i~1 > 2); {1308#false} is VALID [2020-07-08 12:44:20,012 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-08 12:44:20,012 INFO L280 TraceCheckUtils]: 29: Hoare triple {1308#false} assume !(~i~1 < 5); {1308#false} is VALID [2020-07-08 12:44:20,012 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-08 12:44:20,013 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-08 12:44:20,013 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1308#false} {1308#false} #86#return; {1308#false} is VALID [2020-07-08 12:44:20,013 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-08 12:44:20,014 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-08 12:44:20,014 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-08 12:44:20,014 INFO L280 TraceCheckUtils]: 36: Hoare triple {1308#false} assume !(~i~2 < 4); {1308#false} is VALID [2020-07-08 12:44:20,014 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-08 12:44:20,015 INFO L263 TraceCheckUtils]: 38: Hoare triple {1308#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1308#false} is VALID [2020-07-08 12:44:20,015 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-08 12:44:20,015 INFO L280 TraceCheckUtils]: 40: Hoare triple {1308#false} assume !!(~i~1 < 5); {1308#false} is VALID [2020-07-08 12:44:20,015 INFO L280 TraceCheckUtils]: 41: Hoare triple {1308#false} assume !(~i~1 > 2); {1308#false} is VALID [2020-07-08 12:44:20,016 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-08 12:44:20,016 INFO L280 TraceCheckUtils]: 43: Hoare triple {1308#false} assume !(~i~1 < 5); {1308#false} is VALID [2020-07-08 12:44:20,016 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-08 12:44:20,017 INFO L280 TraceCheckUtils]: 45: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-08 12:44:20,017 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1308#false} {1308#false} #88#return; {1308#false} is VALID [2020-07-08 12:44:20,017 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-08 12:44:20,017 INFO L280 TraceCheckUtils]: 48: Hoare triple {1308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1308#false} is VALID [2020-07-08 12:44:20,018 INFO L280 TraceCheckUtils]: 49: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2020-07-08 12:44:20,020 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-08 12:44:20,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004911786] [2020-07-08 12:44:20,021 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:20,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208952640] [2020-07-08 12:44:20,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:20,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:20,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226544458] [2020-07-08 12:44:20,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 12:44:20,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:20,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:20,068 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-08 12:44:20,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:20,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:20,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:20,070 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2020-07-08 12:44:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:20,331 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2020-07-08 12:44:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:20,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 12:44:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-08 12:44:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-08 12:44:20,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-08 12:44:20,419 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-08 12:44:20,421 INFO L225 Difference]: With dead ends: 63 [2020-07-08 12:44:20,421 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 12:44:20,422 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-08 12:44:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 12:44:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-08 12:44:20,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:20,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-08 12:44:20,439 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-08 12:44:20,440 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-08 12:44:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:20,443 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-08 12:44:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-08 12:44:20,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:20,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:20,444 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-08 12:44:20,444 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-08 12:44:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:20,447 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-08 12:44:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-08 12:44:20,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:20,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:20,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:20,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 12:44:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-08 12:44:20,451 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 50 [2020-07-08 12:44:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:20,452 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-08 12:44:20,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-08 12:44:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 12:44:20,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:20,453 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-08 12:44:20,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:20,668 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2020-07-08 12:44:20,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:20,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748313351] [2020-07-08 12:44:20,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,759 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-08 12:44:20,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:20,759 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-08 12:44:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,798 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-08 12:44:20,799 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-08 12:44:20,800 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-08 12:44:20,801 INFO L280 TraceCheckUtils]: 3: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-08 12:44:20,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:20,801 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-08 12:44:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,819 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-08 12:44:20,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-08 12:44:20,820 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-08 12:44:20,820 INFO L280 TraceCheckUtils]: 4: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-08 12:44:20,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:20,821 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1687#true} {1688#false} #84#return; {1688#false} is VALID [2020-07-08 12:44:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,853 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-08 12:44:20,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:20,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:20,856 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-08 12:44:20,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {1727#(<= rangesum_~i~1 1)} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:20,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-08 12:44:20,857 INFO L280 TraceCheckUtils]: 6: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:20,857 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-08 12:44:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,866 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-08 12:44:20,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-08 12:44:20,867 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-08 12:44:20,868 INFO L280 TraceCheckUtils]: 4: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,868 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-08 12:44:20,868 INFO L280 TraceCheckUtils]: 6: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:20,868 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1687#true} {1688#false} #88#return; {1688#false} is VALID [2020-07-08 12:44:20,869 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-08 12:44:20,870 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-08 12:44:20,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:20,870 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-08 12:44:20,870 INFO L263 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret12 := main(); {1687#true} is VALID [2020-07-08 12:44:20,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1687#true} is VALID [2020-07-08 12:44:20,872 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-08 12:44:20,872 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-08 12:44:20,873 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-08 12:44:20,874 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-08 12:44:20,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-08 12:44:20,875 INFO L280 TraceCheckUtils]: 11: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:20,875 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-08 12:44:20,875 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-08 12:44:20,876 INFO L263 TraceCheckUtils]: 14: Hoare triple {1688#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-08 12:44:20,876 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-08 12:44:20,876 INFO L280 TraceCheckUtils]: 16: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,876 INFO L280 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-08 12:44:20,877 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-08 12:44:20,877 INFO L280 TraceCheckUtils]: 19: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,877 INFO L280 TraceCheckUtils]: 20: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-08 12:44:20,877 INFO L280 TraceCheckUtils]: 21: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:20,878 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1687#true} {1688#false} #84#return; {1688#false} is VALID [2020-07-08 12:44:20,878 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-08 12:44:20,878 INFO L263 TraceCheckUtils]: 24: Hoare triple {1688#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-08 12:44:20,879 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-08 12:44:20,879 INFO L280 TraceCheckUtils]: 26: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:20,880 INFO L280 TraceCheckUtils]: 27: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:20,881 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-08 12:44:20,882 INFO L280 TraceCheckUtils]: 29: Hoare triple {1727#(<= rangesum_~i~1 1)} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:20,882 INFO L280 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-08 12:44:20,882 INFO L280 TraceCheckUtils]: 31: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:20,882 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-08 12:44:20,882 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-08 12:44:20,883 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-08 12:44:20,883 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-08 12:44:20,883 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~i~2 < 4); {1688#false} is VALID [2020-07-08 12:44:20,883 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-08 12:44:20,884 INFO L263 TraceCheckUtils]: 38: Hoare triple {1688#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-08 12:44:20,884 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-08 12:44:20,884 INFO L280 TraceCheckUtils]: 40: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,885 INFO L280 TraceCheckUtils]: 41: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-08 12:44:20,885 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-08 12:44:20,885 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-08 12:44:20,885 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-08 12:44:20,886 INFO L280 TraceCheckUtils]: 45: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:20,886 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1687#true} {1688#false} #88#return; {1688#false} is VALID [2020-07-08 12:44:20,886 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-08 12:44:20,886 INFO L280 TraceCheckUtils]: 48: Hoare triple {1688#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1688#false} is VALID [2020-07-08 12:44:20,886 INFO L280 TraceCheckUtils]: 49: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2020-07-08 12:44:20,889 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-08 12:44:20,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748313351] [2020-07-08 12:44:20,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096730339] [2020-07-08 12:44:20,890 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-08 12:44:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:44:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:20,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:21,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2020-07-08 12:44:21,042 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-08 12:44:21,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-08 12:44:21,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-08 12:44:21,043 INFO L263 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret12 := main(); {1687#true} is VALID [2020-07-08 12:44:21,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1687#true} is VALID [2020-07-08 12:44:21,043 INFO L263 TraceCheckUtils]: 6: Hoare triple {1687#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-08 12:44:21,045 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-08 12:44:21,045 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-08 12:44:21,046 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-08 12:44:21,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-08 12:44:21,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:21,048 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-08 12:44:21,048 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-08 12:44:21,048 INFO L263 TraceCheckUtils]: 14: Hoare triple {1688#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-08 12:44:21,049 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-08 12:44:21,049 INFO L280 TraceCheckUtils]: 16: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:21,049 INFO L280 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-08 12:44:21,049 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-08 12:44:21,050 INFO L280 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:21,050 INFO L280 TraceCheckUtils]: 20: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-08 12:44:21,050 INFO L280 TraceCheckUtils]: 21: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:21,050 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1688#false} {1688#false} #84#return; {1688#false} is VALID [2020-07-08 12:44:21,050 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-08 12:44:21,051 INFO L263 TraceCheckUtils]: 24: Hoare triple {1688#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-08 12:44:21,051 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-08 12:44:21,051 INFO L280 TraceCheckUtils]: 26: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:21,051 INFO L280 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-08 12:44:21,052 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-08 12:44:21,052 INFO L280 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:21,052 INFO L280 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-08 12:44:21,052 INFO L280 TraceCheckUtils]: 31: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:21,053 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-08 12:44:21,053 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-08 12:44:21,053 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-08 12:44:21,053 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-08 12:44:21,054 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~i~2 < 4); {1688#false} is VALID [2020-07-08 12:44:21,054 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-08 12:44:21,054 INFO L263 TraceCheckUtils]: 38: Hoare triple {1688#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-08 12:44:21,054 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-08 12:44:21,055 INFO L280 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:21,055 INFO L280 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-08 12:44:21,055 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-08 12:44:21,055 INFO L280 TraceCheckUtils]: 43: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-08 12:44:21,055 INFO L280 TraceCheckUtils]: 44: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-08 12:44:21,056 INFO L280 TraceCheckUtils]: 45: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-08 12:44:21,056 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1688#false} {1688#false} #88#return; {1688#false} is VALID [2020-07-08 12:44:21,056 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-08 12:44:21,056 INFO L280 TraceCheckUtils]: 48: Hoare triple {1688#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1688#false} is VALID [2020-07-08 12:44:21,057 INFO L280 TraceCheckUtils]: 49: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2020-07-08 12:44:21,059 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-08 12:44:21,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:44:21,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 8 [2020-07-08 12:44:21,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857974476] [2020-07-08 12:44:21,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-07-08 12:44:21,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:21,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:44:21,123 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-08 12:44:21,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:44:21,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:44:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:44:21,124 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 8 states. [2020-07-08 12:44:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:21,925 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2020-07-08 12:44:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:44:21,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-07-08 12:44:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:44:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-08 12:44:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:44:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-08 12:44:21,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-08 12:44:22,055 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-08 12:44:22,057 INFO L225 Difference]: With dead ends: 76 [2020-07-08 12:44:22,057 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 12:44:22,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:44:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 12:44:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-08 12:44:22,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:22,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-08 12:44:22,111 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-08 12:44:22,111 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-08 12:44:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:22,114 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 12:44:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 12:44:22,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:22,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:22,115 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-08 12:44:22,124 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-08 12:44:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:22,127 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 12:44:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 12:44:22,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:22,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:22,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:22,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 12:44:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-08 12:44:22,132 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 50 [2020-07-08 12:44:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:22,133 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-08 12:44:22,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:44:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-08 12:44:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-08 12:44:22,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:22,134 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-08 12:44:22,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:22,340 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1369912335, now seen corresponding path program 2 times [2020-07-08 12:44:22,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:22,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473477809] [2020-07-08 12:44:22,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,397 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-08 12:44:22,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,398 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-08 12:44:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,450 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-08 12:44:22,451 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-08 12:44:22,452 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-08 12:44:22,453 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-08 12:44:22,454 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-08 12:44:22,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-08 12:44:22,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-08 12:44:22,456 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-08 12:44:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,466 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-08 12:44:22,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,467 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-08 12:44:22,467 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,468 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,468 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-08 12:44:22,468 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,469 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-08 12:44:22,469 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,469 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #84#return; {2153#false} is VALID [2020-07-08 12:44:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,479 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-08 12:44:22,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,480 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-08 12:44:22,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,481 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-08 12:44:22,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-08 12:44:22,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,482 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #86#return; {2153#false} is VALID [2020-07-08 12:44:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,491 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-08 12:44:22,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,492 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-08 12:44:22,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,492 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-08 12:44:22,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-08 12:44:22,493 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,493 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #88#return; {2153#false} is VALID [2020-07-08 12:44:22,495 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-08 12:44:22,495 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-08 12:44:22,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,495 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-08 12:44:22,496 INFO L263 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret12 := main(); {2152#true} is VALID [2020-07-08 12:44:22,496 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2152#true} is VALID [2020-07-08 12:44:22,497 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-08 12:44:22,498 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-08 12:44:22,498 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-08 12:44:22,500 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-08 12:44:22,500 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-08 12:44:22,501 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-08 12:44:22,502 INFO L280 TraceCheckUtils]: 12: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-08 12:44:22,503 INFO L280 TraceCheckUtils]: 13: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-08 12:44:22,503 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-08 12:44:22,503 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-08 12:44:22,503 INFO L263 TraceCheckUtils]: 16: Hoare triple {2153#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-08 12:44:22,504 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-08 12:44:22,504 INFO L280 TraceCheckUtils]: 18: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,504 INFO L280 TraceCheckUtils]: 19: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,504 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-08 12:44:22,504 INFO L280 TraceCheckUtils]: 21: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,505 INFO L280 TraceCheckUtils]: 22: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,505 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-08 12:44:22,505 INFO L280 TraceCheckUtils]: 24: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,505 INFO L280 TraceCheckUtils]: 25: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-08 12:44:22,506 INFO L280 TraceCheckUtils]: 26: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,506 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2152#true} {2153#false} #84#return; {2153#false} is VALID [2020-07-08 12:44:22,506 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-08 12:44:22,506 INFO L263 TraceCheckUtils]: 29: Hoare triple {2153#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-08 12:44:22,507 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-08 12:44:22,507 INFO L280 TraceCheckUtils]: 31: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,507 INFO L280 TraceCheckUtils]: 32: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,507 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-08 12:44:22,507 INFO L280 TraceCheckUtils]: 34: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,508 INFO L280 TraceCheckUtils]: 35: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,508 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-08 12:44:22,508 INFO L280 TraceCheckUtils]: 37: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,508 INFO L280 TraceCheckUtils]: 38: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-08 12:44:22,509 INFO L280 TraceCheckUtils]: 39: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,509 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2152#true} {2153#false} #86#return; {2153#false} is VALID [2020-07-08 12:44:22,509 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-08 12:44:22,509 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-08 12:44:22,510 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-08 12:44:22,510 INFO L280 TraceCheckUtils]: 44: Hoare triple {2153#false} assume !(~i~2 < 4); {2153#false} is VALID [2020-07-08 12:44:22,510 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-08 12:44:22,510 INFO L263 TraceCheckUtils]: 46: Hoare triple {2153#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-08 12:44:22,511 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-08 12:44:22,511 INFO L280 TraceCheckUtils]: 48: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,511 INFO L280 TraceCheckUtils]: 49: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,511 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-08 12:44:22,511 INFO L280 TraceCheckUtils]: 51: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,512 INFO L280 TraceCheckUtils]: 52: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-08 12:44:22,512 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-08 12:44:22,512 INFO L280 TraceCheckUtils]: 54: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-08 12:44:22,512 INFO L280 TraceCheckUtils]: 55: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-08 12:44:22,513 INFO L280 TraceCheckUtils]: 56: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,513 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2152#true} {2153#false} #88#return; {2153#false} is VALID [2020-07-08 12:44:22,513 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-08 12:44:22,513 INFO L280 TraceCheckUtils]: 59: Hoare triple {2153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2153#false} is VALID [2020-07-08 12:44:22,513 INFO L280 TraceCheckUtils]: 60: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2020-07-08 12:44:22,516 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-08 12:44:22,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473477809] [2020-07-08 12:44:22,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821548239] [2020-07-08 12:44:22,517 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-08 12:44:22,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:44:22,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:22,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:44:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:22,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:22,664 INFO L263 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2020-07-08 12:44:22,665 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-08 12:44:22,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-08 12:44:22,665 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-08 12:44:22,666 INFO L263 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret12 := main(); {2152#true} is VALID [2020-07-08 12:44:22,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2152#true} is VALID [2020-07-08 12:44:22,666 INFO L263 TraceCheckUtils]: 6: Hoare triple {2152#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-08 12:44:22,668 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-08 12:44:22,676 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-08 12:44:22,678 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-08 12:44:22,678 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-08 12:44:22,679 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-08 12:44:22,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-08 12:44:22,680 INFO L280 TraceCheckUtils]: 13: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-08 12:44:22,680 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-08 12:44:22,681 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-08 12:44:22,681 INFO L263 TraceCheckUtils]: 16: Hoare triple {2153#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-08 12:44:22,681 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-08 12:44:22,681 INFO L280 TraceCheckUtils]: 18: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,682 INFO L280 TraceCheckUtils]: 19: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-08 12:44:22,682 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-08 12:44:22,682 INFO L280 TraceCheckUtils]: 21: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-08 12:44:22,683 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-08 12:44:22,683 INFO L280 TraceCheckUtils]: 24: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,683 INFO L280 TraceCheckUtils]: 25: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-08 12:44:22,683 INFO L280 TraceCheckUtils]: 26: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-08 12:44:22,683 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2153#false} {2153#false} #84#return; {2153#false} is VALID [2020-07-08 12:44:22,684 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-08 12:44:22,684 INFO L263 TraceCheckUtils]: 29: Hoare triple {2153#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-08 12:44:22,684 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-08 12:44:22,684 INFO L280 TraceCheckUtils]: 31: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,685 INFO L280 TraceCheckUtils]: 32: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-08 12:44:22,685 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-08 12:44:22,685 INFO L280 TraceCheckUtils]: 34: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,685 INFO L280 TraceCheckUtils]: 35: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-08 12:44:22,685 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-08 12:44:22,686 INFO L280 TraceCheckUtils]: 37: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,686 INFO L280 TraceCheckUtils]: 38: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-08 12:44:22,686 INFO L280 TraceCheckUtils]: 39: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-08 12:44:22,686 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2153#false} {2153#false} #86#return; {2153#false} is VALID [2020-07-08 12:44:22,687 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-08 12:44:22,687 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-08 12:44:22,687 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-08 12:44:22,687 INFO L280 TraceCheckUtils]: 44: Hoare triple {2153#false} assume !(~i~2 < 4); {2153#false} is VALID [2020-07-08 12:44:22,687 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-08 12:44:22,688 INFO L263 TraceCheckUtils]: 46: Hoare triple {2153#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-08 12:44:22,688 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-08 12:44:22,688 INFO L280 TraceCheckUtils]: 48: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,688 INFO L280 TraceCheckUtils]: 49: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-08 12:44:22,689 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-08 12:44:22,689 INFO L280 TraceCheckUtils]: 51: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,689 INFO L280 TraceCheckUtils]: 52: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-08 12:44:22,689 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-08 12:44:22,690 INFO L280 TraceCheckUtils]: 54: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-08 12:44:22,690 INFO L280 TraceCheckUtils]: 55: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-08 12:44:22,690 INFO L280 TraceCheckUtils]: 56: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-08 12:44:22,690 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2153#false} {2153#false} #88#return; {2153#false} is VALID [2020-07-08 12:44:22,690 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-08 12:44:22,691 INFO L280 TraceCheckUtils]: 59: Hoare triple {2153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2153#false} is VALID [2020-07-08 12:44:22,691 INFO L280 TraceCheckUtils]: 60: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2020-07-08 12:44:22,693 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-08 12:44:22,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:44:22,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2020-07-08 12:44:22,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032902325] [2020-07-08 12:44:22,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-07-08 12:44:22,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:22,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:44:22,762 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-08 12:44:22,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:44:22,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:44:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:44:22,764 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 7 states. [2020-07-08 12:44:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:23,413 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2020-07-08 12:44:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:44:23,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-07-08 12:44:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:44:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-08 12:44:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:44:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-08 12:44:23,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2020-07-08 12:44:23,541 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-08 12:44:23,544 INFO L225 Difference]: With dead ends: 80 [2020-07-08 12:44:23,544 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:44:23,545 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-08 12:44:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:44:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-08 12:44:23,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:23,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-08 12:44:23,585 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-08 12:44:23,585 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-08 12:44:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:23,589 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-08 12:44:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-07-08 12:44:23,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:23,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:23,589 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-08 12:44:23,590 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-08 12:44:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:23,592 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-08 12:44:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-07-08 12:44:23,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:23,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:23,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:23,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 12:44:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-08 12:44:23,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 61 [2020-07-08 12:44:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:23,595 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-08 12:44:23,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:44:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 12:44:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 12:44:23,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:23,597 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-08 12:44:23,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:23,810 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 190779759, now seen corresponding path program 3 times [2020-07-08 12:44:23,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:23,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877614566] [2020-07-08 12:44:23,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:23,869 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-08 12:44:23,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:23,869 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-08 12:44:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:23,943 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-08 12:44:23,944 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-08 12:44:23,946 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-08 12:44:23,950 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-08 12:44:23,951 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-08 12:44:23,953 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-08 12:44:23,954 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-08 12:44:23,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {2722#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2670#false} is VALID [2020-07-08 12:44:23,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-08 12:44:23,956 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2670#false} {2669#true} #82#return; {2670#false} is VALID [2020-07-08 12:44:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:23,973 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-08 12:44:23,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:23,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:23,975 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-08 12:44:23,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:23,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:23,976 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-08 12:44:23,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:23,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:23,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:23,977 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #84#return; {2670#false} is VALID [2020-07-08 12:44:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:23,994 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-08 12:44:23,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:23,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:23,995 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-08 12:44:23,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:23,996 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:23,996 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-08 12:44:23,996 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:23,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:23,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:23,997 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #86#return; {2670#false} is VALID [2020-07-08 12:44:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,007 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-08 12:44:24,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,008 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-08 12:44:24,008 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,009 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,009 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-08 12:44:24,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:24,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,010 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #88#return; {2670#false} is VALID [2020-07-08 12:44:24,011 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-08 12:44:24,011 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-08 12:44:24,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,011 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-08 12:44:24,011 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret12 := main(); {2669#true} is VALID [2020-07-08 12:44:24,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2669#true} is VALID [2020-07-08 12:44:24,012 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-08 12:44:24,013 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-08 12:44:24,014 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-08 12:44:24,014 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-08 12:44:24,015 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-08 12:44:24,016 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-08 12:44:24,016 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-08 12:44:24,017 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-08 12:44:24,018 INFO L280 TraceCheckUtils]: 14: Hoare triple {2722#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2670#false} is VALID [2020-07-08 12:44:24,018 INFO L280 TraceCheckUtils]: 15: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-08 12:44:24,018 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2670#false} {2669#true} #82#return; {2670#false} is VALID [2020-07-08 12:44:24,018 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-08 12:44:24,018 INFO L263 TraceCheckUtils]: 18: Hoare triple {2670#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,019 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-08 12:44:24,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,019 INFO L280 TraceCheckUtils]: 21: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,019 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-08 12:44:24,020 INFO L280 TraceCheckUtils]: 23: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,020 INFO L280 TraceCheckUtils]: 24: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,020 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-08 12:44:24,020 INFO L280 TraceCheckUtils]: 26: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,020 INFO L280 TraceCheckUtils]: 27: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:24,020 INFO L280 TraceCheckUtils]: 28: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,021 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2669#true} {2670#false} #84#return; {2670#false} is VALID [2020-07-08 12:44:24,021 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-08 12:44:24,021 INFO L263 TraceCheckUtils]: 31: Hoare triple {2670#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,021 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-08 12:44:24,021 INFO L280 TraceCheckUtils]: 33: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,022 INFO L280 TraceCheckUtils]: 34: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,022 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-08 12:44:24,022 INFO L280 TraceCheckUtils]: 36: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,022 INFO L280 TraceCheckUtils]: 37: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,022 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-08 12:44:24,023 INFO L280 TraceCheckUtils]: 39: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,023 INFO L280 TraceCheckUtils]: 40: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:24,023 INFO L280 TraceCheckUtils]: 41: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,023 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2669#true} {2670#false} #86#return; {2670#false} is VALID [2020-07-08 12:44:24,023 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-08 12:44:24,023 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-08 12:44:24,024 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-08 12:44:24,024 INFO L280 TraceCheckUtils]: 46: Hoare triple {2670#false} assume !(~i~2 < 4); {2670#false} is VALID [2020-07-08 12:44:24,024 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-08 12:44:24,024 INFO L263 TraceCheckUtils]: 48: Hoare triple {2670#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,024 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-08 12:44:24,025 INFO L280 TraceCheckUtils]: 50: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,025 INFO L280 TraceCheckUtils]: 51: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,025 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-08 12:44:24,025 INFO L280 TraceCheckUtils]: 53: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,025 INFO L280 TraceCheckUtils]: 54: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,026 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-08 12:44:24,026 INFO L280 TraceCheckUtils]: 56: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,026 INFO L280 TraceCheckUtils]: 57: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:24,026 INFO L280 TraceCheckUtils]: 58: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,026 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2669#true} {2670#false} #88#return; {2670#false} is VALID [2020-07-08 12:44:24,026 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-08 12:44:24,027 INFO L280 TraceCheckUtils]: 61: Hoare triple {2670#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2670#false} is VALID [2020-07-08 12:44:24,027 INFO L280 TraceCheckUtils]: 62: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2020-07-08 12:44:24,029 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-08 12:44:24,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877614566] [2020-07-08 12:44:24,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294419738] [2020-07-08 12:44:24,030 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-08 12:44:24,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-08 12:44:24,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:24,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:44:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:24,187 INFO L263 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2020-07-08 12:44:24,188 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-08 12:44:24,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,188 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-08 12:44:24,188 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret12 := main(); {2669#true} is VALID [2020-07-08 12:44:24,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2669#true} is VALID [2020-07-08 12:44:24,189 INFO L263 TraceCheckUtils]: 6: Hoare triple {2669#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,189 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-08 12:44:24,189 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-08 12:44:24,189 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-08 12:44:24,189 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-08 12:44:24,190 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-08 12:44:24,190 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-08 12:44:24,190 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-08 12:44:24,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {2669#true} assume !(~i~0 < 5); {2669#true} is VALID [2020-07-08 12:44:24,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,191 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2669#true} {2669#true} #82#return; {2669#true} is VALID [2020-07-08 12:44:24,191 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-08 12:44:24,191 INFO L263 TraceCheckUtils]: 18: Hoare triple {2669#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,191 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-08 12:44:24,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,192 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-08 12:44:24,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,192 INFO L280 TraceCheckUtils]: 24: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,192 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-08 12:44:24,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:24,193 INFO L280 TraceCheckUtils]: 28: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,193 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2669#true} {2669#true} #84#return; {2669#true} is VALID [2020-07-08 12:44:24,193 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-08 12:44:24,194 INFO L263 TraceCheckUtils]: 31: Hoare triple {2669#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,194 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-08 12:44:24,194 INFO L280 TraceCheckUtils]: 33: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,194 INFO L280 TraceCheckUtils]: 34: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,195 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-08 12:44:24,195 INFO L280 TraceCheckUtils]: 36: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,195 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-08 12:44:24,195 INFO L280 TraceCheckUtils]: 39: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,195 INFO L280 TraceCheckUtils]: 40: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-08 12:44:24,196 INFO L280 TraceCheckUtils]: 41: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-08 12:44:24,196 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2669#true} {2669#true} #86#return; {2669#true} is VALID [2020-07-08 12:44:24,196 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-08 12:44:24,196 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-08 12:44:24,196 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-08 12:44:24,197 INFO L280 TraceCheckUtils]: 46: Hoare triple {2669#true} assume !(~i~2 < 4); {2669#true} is VALID [2020-07-08 12:44:24,197 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-08 12:44:24,197 INFO L263 TraceCheckUtils]: 48: Hoare triple {2669#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-08 12:44:24,197 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-08 12:44:24,197 INFO L280 TraceCheckUtils]: 50: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,198 INFO L280 TraceCheckUtils]: 51: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-08 12:44:24,198 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-08 12:44:24,198 INFO L280 TraceCheckUtils]: 53: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-08 12:44:24,199 INFO L280 TraceCheckUtils]: 54: Hoare triple {2669#true} assume !(~i~1 > 2); {2888#(<= rangesum_~i~1 2)} is VALID [2020-07-08 12:44:24,200 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-08 12:44:24,201 INFO L280 TraceCheckUtils]: 56: Hoare triple {2892#(<= rangesum_~i~1 3)} assume !(~i~1 < 5); {2670#false} is VALID [2020-07-08 12:44:24,201 INFO L280 TraceCheckUtils]: 57: Hoare triple {2670#false} assume !(0 != ~cnt~0);#res := 0; {2670#false} is VALID [2020-07-08 12:44:24,202 INFO L280 TraceCheckUtils]: 58: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-08 12:44:24,202 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2670#false} {2669#true} #88#return; {2670#false} is VALID [2020-07-08 12:44:24,202 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-08 12:44:24,202 INFO L280 TraceCheckUtils]: 61: Hoare triple {2670#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2670#false} is VALID [2020-07-08 12:44:24,202 INFO L280 TraceCheckUtils]: 62: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2020-07-08 12:44:24,205 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-08 12:44:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:24,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2020-07-08 12:44:24,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758974091] [2020-07-08 12:44:24,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-07-08 12:44:24,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:24,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:44:24,251 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-08 12:44:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:44:24,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:44:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:44:24,252 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2020-07-08 12:44:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:24,455 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-08 12:44:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:44:24,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-07-08 12:44:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:44:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-08 12:44:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:44:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-08 12:44:24,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2020-07-08 12:44:24,578 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-08 12:44:24,580 INFO L225 Difference]: With dead ends: 78 [2020-07-08 12:44:24,581 INFO L226 Difference]: Without dead ends: 50 [2020-07-08 12:44:24,582 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-08 12:44:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-08 12:44:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-07-08 12:44:24,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:24,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 45 states. [2020-07-08 12:44:24,618 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 45 states. [2020-07-08 12:44:24,618 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 45 states. [2020-07-08 12:44:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:24,621 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-08 12:44:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-08 12:44:24,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:24,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:24,622 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 50 states. [2020-07-08 12:44:24,622 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 50 states. [2020-07-08 12:44:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:24,625 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-08 12:44:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-08 12:44:24,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:24,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:24,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:24,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 12:44:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-07-08 12:44:24,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 63 [2020-07-08 12:44:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:24,629 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-07-08 12:44:24,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:44:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-07-08 12:44:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-08 12:44:24,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:24,630 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-08 12:44:24,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-08 12:44:24,844 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1896448358, now seen corresponding path program 1 times [2020-07-08 12:44:24,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:24,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651951346] [2020-07-08 12:44:24,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,907 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-08 12:44:24,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {3186#true} assume true; {3186#true} is VALID [2020-07-08 12:44:24,907 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3186#true} {3186#true} #78#return; {3186#true} is VALID [2020-07-08 12:44:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:24,988 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-08 12:44:24,989 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-08 12:44:24,990 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-08 12:44:24,991 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-08 12:44:24,992 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-08 12:44:24,992 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-08 12:44:24,993 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-08 12:44:24,993 INFO L280 TraceCheckUtils]: 7: Hoare triple {3248#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {3187#false} is VALID [2020-07-08 12:44:24,993 INFO L280 TraceCheckUtils]: 8: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-08 12:44:24,994 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3187#false} {3186#true} #82#return; {3187#false} is VALID [2020-07-08 12:44:24,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651951346] [2020-07-08 12:44:24,998 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-08 12:44:24,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269842586] [2020-07-08 12:44:24,998 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-08 12:44:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:44:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:25,161 INFO L263 TraceCheckUtils]: 0: Hoare triple {3186#true} call ULTIMATE.init(); {3186#true} is VALID [2020-07-08 12:44:25,161 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-08 12:44:25,161 INFO L280 TraceCheckUtils]: 2: Hoare triple {3186#true} assume true; {3186#true} is VALID [2020-07-08 12:44:25,162 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3186#true} {3186#true} #78#return; {3186#true} is VALID [2020-07-08 12:44:25,162 INFO L263 TraceCheckUtils]: 4: Hoare triple {3186#true} call #t~ret12 := main(); {3186#true} is VALID [2020-07-08 12:44:25,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {3186#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {3186#true} is VALID [2020-07-08 12:44:25,162 INFO L263 TraceCheckUtils]: 6: Hoare triple {3186#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3186#true} is VALID [2020-07-08 12:44:25,163 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-08 12:44:25,164 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-08 12:44:25,164 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-08 12:44:25,165 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-08 12:44:25,165 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-08 12:44:25,166 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-08 12:44:25,166 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-08 12:44:25,167 INFO L280 TraceCheckUtils]: 14: Hoare triple {3248#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {3187#false} is VALID [2020-07-08 12:44:25,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-08 12:44:25,167 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3187#false} {3186#true} #82#return; {3187#false} is VALID [2020-07-08 12:44:25,167 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-08 12:44:25,167 INFO L263 TraceCheckUtils]: 18: Hoare triple {3187#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-08 12:44:25,168 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-08 12:44:25,168 INFO L280 TraceCheckUtils]: 20: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,168 INFO L280 TraceCheckUtils]: 21: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-08 12:44:25,168 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-08 12:44:25,168 INFO L280 TraceCheckUtils]: 23: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,168 INFO L280 TraceCheckUtils]: 24: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-08 12:44:25,168 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-08 12:44:25,168 INFO L280 TraceCheckUtils]: 26: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,169 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-08 12:44:25,169 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-08 12:44:25,169 INFO L280 TraceCheckUtils]: 29: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,169 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-08 12:44:25,169 INFO L280 TraceCheckUtils]: 31: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-08 12:44:25,169 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3187#false} {3187#false} #84#return; {3187#false} is VALID [2020-07-08 12:44:25,170 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-08 12:44:25,170 INFO L263 TraceCheckUtils]: 34: Hoare triple {3187#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-08 12:44:25,170 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-08 12:44:25,170 INFO L280 TraceCheckUtils]: 36: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,170 INFO L280 TraceCheckUtils]: 37: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-08 12:44:25,170 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-08 12:44:25,170 INFO L280 TraceCheckUtils]: 39: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,170 INFO L280 TraceCheckUtils]: 40: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-08 12:44:25,171 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-08 12:44:25,171 INFO L280 TraceCheckUtils]: 42: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,171 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-08 12:44:25,171 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-08 12:44:25,171 INFO L280 TraceCheckUtils]: 45: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,171 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-08 12:44:25,171 INFO L280 TraceCheckUtils]: 47: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-08 12:44:25,172 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3187#false} {3187#false} #86#return; {3187#false} is VALID [2020-07-08 12:44:25,172 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-08 12:44:25,172 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-08 12:44:25,172 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-08 12:44:25,172 INFO L280 TraceCheckUtils]: 52: Hoare triple {3187#false} assume !(~i~2 < 4); {3187#false} is VALID [2020-07-08 12:44:25,172 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-08 12:44:25,172 INFO L263 TraceCheckUtils]: 54: Hoare triple {3187#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-08 12:44:25,172 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-08 12:44:25,173 INFO L280 TraceCheckUtils]: 56: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,173 INFO L280 TraceCheckUtils]: 57: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-08 12:44:25,173 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-08 12:44:25,173 INFO L280 TraceCheckUtils]: 59: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,173 INFO L280 TraceCheckUtils]: 60: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-08 12:44:25,173 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-08 12:44:25,173 INFO L280 TraceCheckUtils]: 62: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,174 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-08 12:44:25,174 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-08 12:44:25,174 INFO L280 TraceCheckUtils]: 65: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-08 12:44:25,174 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-08 12:44:25,174 INFO L280 TraceCheckUtils]: 67: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-08 12:44:25,175 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3187#false} {3187#false} #88#return; {3187#false} is VALID [2020-07-08 12:44:25,175 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-08 12:44:25,175 INFO L280 TraceCheckUtils]: 70: Hoare triple {3187#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3187#false} is VALID [2020-07-08 12:44:25,175 INFO L280 TraceCheckUtils]: 71: Hoare triple {3187#false} assume !false; {3187#false} is VALID [2020-07-08 12:44:25,178 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-08 12:44:25,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:25,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 12:44:25,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603689631] [2020-07-08 12:44:25,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-07-08 12:44:25,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:25,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:44:25,238 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-08 12:44:25,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:44:25,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:44:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:44:25,239 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2020-07-08 12:44:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:25,366 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2020-07-08 12:44:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:44:25,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-07-08 12:44:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:44:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-08 12:44:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:44:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-08 12:44:25,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-08 12:44:25,456 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-08 12:44:25,458 INFO L225 Difference]: With dead ends: 78 [2020-07-08 12:44:25,458 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:44:25,459 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-08 12:44:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:44:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-08 12:44:25,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:25,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-08 12:44:25,497 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-08 12:44:25,497 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-08 12:44:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:25,498 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 12:44:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-08 12:44:25,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:25,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:25,499 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-08 12:44:25,499 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-08 12:44:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:25,501 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 12:44:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-08 12:44:25,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:25,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:25,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:25,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 12:44:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-08 12:44:25,505 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 72 [2020-07-08 12:44:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:25,505 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-08 12:44:25,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:44:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-08 12:44:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-08 12:44:25,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:25,507 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-08 12:44:25,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:25,719 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:25,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2135261480, now seen corresponding path program 2 times [2020-07-08 12:44:25,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:25,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99709380] [2020-07-08 12:44:25,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,764 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-08 12:44:25,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {3737#true} assume true; {3737#true} is VALID [2020-07-08 12:44:25,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3737#true} {3737#true} #78#return; {3737#true} is VALID [2020-07-08 12:44:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,834 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-08 12:44:25,835 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-08 12:44:25,836 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-08 12:44:25,836 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-08 12:44:25,837 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-08 12:44:25,838 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-08 12:44:25,839 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-08 12:44:25,839 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-08 12:44:25,840 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-08 12:44:25,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {3802#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {3738#false} is VALID [2020-07-08 12:44:25,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-08 12:44:25,841 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3738#false} {3737#true} #82#return; {3738#false} is VALID [2020-07-08 12:44:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:25,894 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-08 12:44:25,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {3803#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:25,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {3803#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:25,897 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-08 12:44:25,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {3804#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-08 12:44:25,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {3804#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-08 12:44:25,899 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-08 12:44:25,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {3805#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {3805#(<= rangesum_~i~1 2)} is VALID [2020-07-08 12:44:25,900 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-08 12:44:25,901 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-08 12:44:25,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:25,901 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-08 12:44:25,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-08 12:44:25,902 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3738#false} {3738#false} #84#return; {3738#false} is VALID [2020-07-08 12:44:25,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99709380] [2020-07-08 12:44:25,905 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-08 12:44:25,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367544053] [2020-07-08 12:44:25,905 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-08 12:44:26,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:44:26,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:26,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:44:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:26,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:26,280 INFO L263 TraceCheckUtils]: 0: Hoare triple {3737#true} call ULTIMATE.init(); {3737#true} is VALID [2020-07-08 12:44:26,280 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-08 12:44:26,280 INFO L280 TraceCheckUtils]: 2: Hoare triple {3737#true} assume true; {3737#true} is VALID [2020-07-08 12:44:26,281 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3737#true} {3737#true} #78#return; {3737#true} is VALID [2020-07-08 12:44:26,281 INFO L263 TraceCheckUtils]: 4: Hoare triple {3737#true} call #t~ret12 := main(); {3737#true} is VALID [2020-07-08 12:44:26,281 INFO L280 TraceCheckUtils]: 5: Hoare triple {3737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {3737#true} is VALID [2020-07-08 12:44:26,281 INFO L263 TraceCheckUtils]: 6: Hoare triple {3737#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3737#true} is VALID [2020-07-08 12:44:26,282 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-08 12:44:26,282 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-08 12:44:26,283 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-08 12:44:26,286 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-08 12:44:26,287 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-08 12:44:26,288 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-08 12:44:26,288 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-08 12:44:26,292 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-08 12:44:26,293 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-08 12:44:26,294 INFO L280 TraceCheckUtils]: 16: Hoare triple {3802#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {3738#false} is VALID [2020-07-08 12:44:26,294 INFO L280 TraceCheckUtils]: 17: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-08 12:44:26,294 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3738#false} {3737#true} #82#return; {3738#false} is VALID [2020-07-08 12:44:26,294 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-08 12:44:26,294 INFO L263 TraceCheckUtils]: 20: Hoare triple {3738#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-08 12:44:26,295 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-08 12:44:26,295 INFO L280 TraceCheckUtils]: 22: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,295 INFO L280 TraceCheckUtils]: 23: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-08 12:44:26,295 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-08 12:44:26,295 INFO L280 TraceCheckUtils]: 25: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-08 12:44:26,295 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-08 12:44:26,296 INFO L280 TraceCheckUtils]: 28: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,296 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-08 12:44:26,296 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-08 12:44:26,296 INFO L280 TraceCheckUtils]: 31: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,296 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-08 12:44:26,297 INFO L280 TraceCheckUtils]: 33: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-08 12:44:26,297 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3738#false} {3738#false} #84#return; {3738#false} is VALID [2020-07-08 12:44:26,298 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-08 12:44:26,298 INFO L263 TraceCheckUtils]: 36: Hoare triple {3738#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-08 12:44:26,298 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-08 12:44:26,298 INFO L280 TraceCheckUtils]: 38: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,298 INFO L280 TraceCheckUtils]: 39: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-08 12:44:26,299 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-08 12:44:26,299 INFO L280 TraceCheckUtils]: 41: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,299 INFO L280 TraceCheckUtils]: 42: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-08 12:44:26,299 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-08 12:44:26,299 INFO L280 TraceCheckUtils]: 44: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,300 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-08 12:44:26,300 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-08 12:44:26,300 INFO L280 TraceCheckUtils]: 47: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,300 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-08 12:44:26,300 INFO L280 TraceCheckUtils]: 49: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-08 12:44:26,301 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3738#false} {3738#false} #86#return; {3738#false} is VALID [2020-07-08 12:44:26,301 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-08 12:44:26,301 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-08 12:44:26,301 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-08 12:44:26,301 INFO L280 TraceCheckUtils]: 54: Hoare triple {3738#false} assume !(~i~2 < 4); {3738#false} is VALID [2020-07-08 12:44:26,301 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-08 12:44:26,302 INFO L263 TraceCheckUtils]: 56: Hoare triple {3738#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-08 12:44:26,302 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-08 12:44:26,302 INFO L280 TraceCheckUtils]: 58: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,302 INFO L280 TraceCheckUtils]: 59: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-08 12:44:26,302 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-08 12:44:26,302 INFO L280 TraceCheckUtils]: 61: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,303 INFO L280 TraceCheckUtils]: 62: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-08 12:44:26,303 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-08 12:44:26,303 INFO L280 TraceCheckUtils]: 64: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,303 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-08 12:44:26,303 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-08 12:44:26,304 INFO L280 TraceCheckUtils]: 67: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-08 12:44:26,304 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-08 12:44:26,304 INFO L280 TraceCheckUtils]: 69: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-08 12:44:26,304 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {3738#false} {3738#false} #88#return; {3738#false} is VALID [2020-07-08 12:44:26,304 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-08 12:44:26,304 INFO L280 TraceCheckUtils]: 72: Hoare triple {3738#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3738#false} is VALID [2020-07-08 12:44:26,305 INFO L280 TraceCheckUtils]: 73: Hoare triple {3738#false} assume !false; {3738#false} is VALID [2020-07-08 12:44:26,308 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-08 12:44:26,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:26,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 12:44:26,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518297887] [2020-07-08 12:44:26,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-07-08 12:44:26,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:26,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:44:26,366 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-08 12:44:26,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:44:26,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:26,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:44:26,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:44:26,368 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2020-07-08 12:44:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:26,700 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2020-07-08 12:44:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:44:26,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-07-08 12:44:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:44:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-08 12:44:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:44:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-08 12:44:26,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-08 12:44:26,800 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-08 12:44:26,802 INFO L225 Difference]: With dead ends: 79 [2020-07-08 12:44:26,803 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 12:44:26,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:44:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 12:44:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-08 12:44:26,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:26,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-08 12:44:26,854 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-08 12:44:26,854 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-08 12:44:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:26,856 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:44:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:44:26,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:26,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:26,857 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-08 12:44:26,857 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-08 12:44:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:26,858 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:44:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:44:26,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:26,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:26,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:26,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-08 12:44:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-07-08 12:44:26,861 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 74 [2020-07-08 12:44:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:26,862 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-07-08 12:44:26,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:44:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:44:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-08 12:44:26,863 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:26,863 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-08 12:44:27,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:27,070 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:27,071 INFO L82 PathProgramCache]: Analyzing trace with hash -293562262, now seen corresponding path program 3 times [2020-07-08 12:44:27,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:27,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258936488] [2020-07-08 12:44:27,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:27,089 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:27,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206972466] [2020-07-08 12:44:27,090 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-08 12:44:27,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-08 12:44:27,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:27,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:44:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:27,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2020-07-08 12:44:27,562 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-08 12:44:27,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-08 12:44:27,562 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #78#return; {4307#true} is VALID [2020-07-08 12:44:27,562 INFO L263 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret12 := main(); {4307#true} is VALID [2020-07-08 12:44:27,563 INFO L280 TraceCheckUtils]: 5: Hoare triple {4307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {4307#true} is VALID [2020-07-08 12:44:27,563 INFO L263 TraceCheckUtils]: 6: Hoare triple {4307#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-08 12:44:27,563 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-08 12:44:27,563 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-08 12:44:27,563 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-08 12:44:27,563 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-08 12:44:27,564 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-08 12:44:27,564 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-08 12:44:27,564 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-08 12:44:27,564 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-08 12:44:27,564 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-08 12:44:27,564 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-08 12:44:27,565 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-08 12:44:27,565 INFO L280 TraceCheckUtils]: 18: Hoare triple {4307#true} assume !(~i~0 < 5); {4307#true} is VALID [2020-07-08 12:44:27,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-08 12:44:27,565 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4307#true} {4307#true} #82#return; {4307#true} is VALID [2020-07-08 12:44:27,565 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-08 12:44:27,565 INFO L263 TraceCheckUtils]: 22: Hoare triple {4307#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-08 12:44:27,565 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-08 12:44:27,566 INFO L280 TraceCheckUtils]: 24: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,566 INFO L280 TraceCheckUtils]: 25: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-08 12:44:27,566 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-08 12:44:27,566 INFO L280 TraceCheckUtils]: 27: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,566 INFO L280 TraceCheckUtils]: 28: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-08 12:44:27,566 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-08 12:44:27,566 INFO L280 TraceCheckUtils]: 30: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,567 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-08 12:44:27,567 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-08 12:44:27,567 INFO L280 TraceCheckUtils]: 33: Hoare triple {4307#true} assume !(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,567 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-08 12:44:27,567 INFO L280 TraceCheckUtils]: 35: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-08 12:44:27,567 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4307#true} {4307#true} #84#return; {4307#true} is VALID [2020-07-08 12:44:27,568 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-08 12:44:27,568 INFO L263 TraceCheckUtils]: 38: Hoare triple {4307#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-08 12:44:27,568 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-08 12:44:27,568 INFO L280 TraceCheckUtils]: 40: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,568 INFO L280 TraceCheckUtils]: 41: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-08 12:44:27,568 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-08 12:44:27,568 INFO L280 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,568 INFO L280 TraceCheckUtils]: 44: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-08 12:44:27,569 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-08 12:44:27,569 INFO L280 TraceCheckUtils]: 46: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,569 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-08 12:44:27,569 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-08 12:44:27,569 INFO L280 TraceCheckUtils]: 49: Hoare triple {4307#true} assume !(~i~1 < 5); {4307#true} is VALID [2020-07-08 12:44:27,569 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-08 12:44:27,569 INFO L280 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-08 12:44:27,570 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4307#true} {4307#true} #86#return; {4307#true} is VALID [2020-07-08 12:44:27,571 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-08 12:44:27,572 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-08 12:44:27,581 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-08 12:44:27,582 INFO L280 TraceCheckUtils]: 56: Hoare triple {4478#(<= main_~i~2 1)} assume !(~i~2 < 4); {4308#false} is VALID [2020-07-08 12:44:27,583 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-08 12:44:27,583 INFO L263 TraceCheckUtils]: 58: Hoare triple {4308#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4308#false} is VALID [2020-07-08 12:44:27,583 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-08 12:44:27,583 INFO L280 TraceCheckUtils]: 60: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-08 12:44:27,583 INFO L280 TraceCheckUtils]: 61: Hoare triple {4308#false} assume !(~i~1 > 2); {4308#false} is VALID [2020-07-08 12:44:27,584 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-08 12:44:27,584 INFO L280 TraceCheckUtils]: 63: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-08 12:44:27,584 INFO L280 TraceCheckUtils]: 64: Hoare triple {4308#false} assume !(~i~1 > 2); {4308#false} is VALID [2020-07-08 12:44:27,584 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-08 12:44:27,584 INFO L280 TraceCheckUtils]: 66: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-08 12:44:27,585 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-08 12:44:27,585 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-08 12:44:27,585 INFO L280 TraceCheckUtils]: 69: Hoare triple {4308#false} assume !(~i~1 < 5); {4308#false} is VALID [2020-07-08 12:44:27,585 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-08 12:44:27,585 INFO L280 TraceCheckUtils]: 71: Hoare triple {4308#false} assume true; {4308#false} is VALID [2020-07-08 12:44:27,586 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {4308#false} {4308#false} #88#return; {4308#false} is VALID [2020-07-08 12:44:27,586 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-08 12:44:27,586 INFO L280 TraceCheckUtils]: 74: Hoare triple {4308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4308#false} is VALID [2020-07-08 12:44:27,586 INFO L280 TraceCheckUtils]: 75: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2020-07-08 12:44:27,594 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-08 12:44:27,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258936488] [2020-07-08 12:44:27,594 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:27,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206972466] [2020-07-08 12:44:27,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:27,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-08 12:44:27,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278317777] [2020-07-08 12:44:27,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-07-08 12:44:27,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:27,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:44:27,667 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-08 12:44:27,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:44:27,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:44:27,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:44:27,668 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2020-07-08 12:44:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,142 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-07-08 12:44:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:44:28,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-07-08 12:44:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:44:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-08 12:44:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:44:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-08 12:44:28,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2020-07-08 12:44:28,212 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-08 12:44:28,215 INFO L225 Difference]: With dead ends: 72 [2020-07-08 12:44:28,215 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 12:44:28,216 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-08 12:44:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 12:44:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-08 12:44:28,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:28,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-08 12:44:28,259 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-08 12:44:28,259 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-08 12:44:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,261 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-08 12:44:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-08 12:44:28,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,262 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-08 12:44:28,262 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-08 12:44:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,264 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-08 12:44:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-08 12:44:28,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:28,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 12:44:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-07-08 12:44:28,267 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 76 [2020-07-08 12:44:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:28,268 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-07-08 12:44:28,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:44:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-07-08 12:44:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-08 12:44:28,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:28,269 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-08 12:44:28,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-08 12:44:28,474 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash 704023820, now seen corresponding path program 4 times [2020-07-08 12:44:28,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:28,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514808042] [2020-07-08 12:44:28,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:28,490 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:28,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303781429] [2020-07-08 12:44:28,490 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-08 12:44:28,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:44:28,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:28,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:44:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:28,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:28,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {4817#true} call ULTIMATE.init(); {4817#true} is VALID [2020-07-08 12:44:28,647 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-08 12:44:28,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {4817#true} assume true; {4817#true} is VALID [2020-07-08 12:44:28,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4817#true} {4817#true} #78#return; {4817#true} is VALID [2020-07-08 12:44:28,648 INFO L263 TraceCheckUtils]: 4: Hoare triple {4817#true} call #t~ret12 := main(); {4817#true} is VALID [2020-07-08 12:44:28,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {4817#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {4817#true} is VALID [2020-07-08 12:44:28,648 INFO L263 TraceCheckUtils]: 6: Hoare triple {4817#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4817#true} is VALID [2020-07-08 12:44:28,648 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-08 12:44:28,648 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-08 12:44:28,649 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-08 12:44:28,649 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-08 12:44:28,649 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-08 12:44:28,649 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-08 12:44:28,649 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-08 12:44:28,650 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-08 12:44:28,650 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-08 12:44:28,650 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-08 12:44:28,650 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-08 12:44:28,650 INFO L280 TraceCheckUtils]: 18: Hoare triple {4817#true} assume !(~i~0 < 5); {4817#true} is VALID [2020-07-08 12:44:28,650 INFO L280 TraceCheckUtils]: 19: Hoare triple {4817#true} assume true; {4817#true} is VALID [2020-07-08 12:44:28,650 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4817#true} {4817#true} #82#return; {4817#true} is VALID [2020-07-08 12:44:28,650 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-08 12:44:28,651 INFO L263 TraceCheckUtils]: 22: Hoare triple {4817#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4817#true} is VALID [2020-07-08 12:44:28,651 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-08 12:44:28,652 INFO L280 TraceCheckUtils]: 24: Hoare triple {4891#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:28,652 INFO L280 TraceCheckUtils]: 25: Hoare triple {4891#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-08 12:44:28,653 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-08 12:44:28,653 INFO L280 TraceCheckUtils]: 27: Hoare triple {4901#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-08 12:44:28,654 INFO L280 TraceCheckUtils]: 28: Hoare triple {4901#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-08 12:44:28,654 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-08 12:44:28,654 INFO L280 TraceCheckUtils]: 30: Hoare triple {4911#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {4911#(<= rangesum_~i~1 2)} is VALID [2020-07-08 12:44:28,655 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-08 12:44:28,655 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-08 12:44:28,655 INFO L280 TraceCheckUtils]: 33: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,655 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-08 12:44:28,655 INFO L280 TraceCheckUtils]: 35: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-08 12:44:28,656 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4818#false} {4817#true} #84#return; {4818#false} is VALID [2020-07-08 12:44:28,656 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-08 12:44:28,656 INFO L263 TraceCheckUtils]: 38: Hoare triple {4818#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4818#false} is VALID [2020-07-08 12:44:28,656 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-08 12:44:28,656 INFO L280 TraceCheckUtils]: 40: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,657 INFO L280 TraceCheckUtils]: 41: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-08 12:44:28,657 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-08 12:44:28,657 INFO L280 TraceCheckUtils]: 43: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,657 INFO L280 TraceCheckUtils]: 44: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-08 12:44:28,657 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-08 12:44:28,657 INFO L280 TraceCheckUtils]: 46: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,658 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-08 12:44:28,658 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-08 12:44:28,658 INFO L280 TraceCheckUtils]: 49: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,658 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-08 12:44:28,658 INFO L280 TraceCheckUtils]: 51: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-08 12:44:28,658 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4818#false} {4818#false} #86#return; {4818#false} is VALID [2020-07-08 12:44:28,658 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-08 12:44:28,658 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-08 12:44:28,659 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-08 12:44:28,659 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-08 12:44:28,659 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-08 12:44:28,659 INFO L280 TraceCheckUtils]: 58: Hoare triple {4818#false} assume !(~i~2 < 4); {4818#false} is VALID [2020-07-08 12:44:28,659 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-08 12:44:28,659 INFO L263 TraceCheckUtils]: 60: Hoare triple {4818#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4818#false} is VALID [2020-07-08 12:44:28,659 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-08 12:44:28,659 INFO L280 TraceCheckUtils]: 62: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,660 INFO L280 TraceCheckUtils]: 63: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-08 12:44:28,660 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-08 12:44:28,660 INFO L280 TraceCheckUtils]: 65: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,660 INFO L280 TraceCheckUtils]: 66: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-08 12:44:28,660 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-08 12:44:28,660 INFO L280 TraceCheckUtils]: 68: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,660 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-08 12:44:28,661 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-08 12:44:28,661 INFO L280 TraceCheckUtils]: 71: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-08 12:44:28,661 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-08 12:44:28,661 INFO L280 TraceCheckUtils]: 73: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-08 12:44:28,661 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {4818#false} {4818#false} #88#return; {4818#false} is VALID [2020-07-08 12:44:28,661 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-08 12:44:28,661 INFO L280 TraceCheckUtils]: 76: Hoare triple {4818#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4818#false} is VALID [2020-07-08 12:44:28,661 INFO L280 TraceCheckUtils]: 77: Hoare triple {4818#false} assume !false; {4818#false} is VALID [2020-07-08 12:44:28,665 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-08 12:44:28,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514808042] [2020-07-08 12:44:28,666 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:28,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303781429] [2020-07-08 12:44:28,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:28,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 12:44:28,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550075942] [2020-07-08 12:44:28,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-07-08 12:44:28,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:28,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:28,727 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-08 12:44:28,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:28,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:28,728 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2020-07-08 12:44:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,931 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2020-07-08 12:44:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:44:28,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-07-08 12:44:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-08 12:44:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-08 12:44:28,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2020-07-08 12:44:29,020 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-08 12:44:29,022 INFO L225 Difference]: With dead ends: 82 [2020-07-08 12:44:29,022 INFO L226 Difference]: Without dead ends: 54 [2020-07-08 12:44:29,023 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-08 12:44:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-08 12:44:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-08 12:44:29,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:29,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-08 12:44:29,067 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-08 12:44:29,067 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-08 12:44:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:29,068 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-08 12:44:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-08 12:44:29,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:29,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:29,069 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-08 12:44:29,069 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-08 12:44:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:29,070 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-08 12:44:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-08 12:44:29,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:29,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:29,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:29,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 12:44:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-08 12:44:29,072 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 78 [2020-07-08 12:44:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:29,073 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-08 12:44:29,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-08 12:44:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-08 12:44:29,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:29,074 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-08 12:44:29,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:29,284 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -40278520, now seen corresponding path program 5 times [2020-07-08 12:44:29,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:29,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406071356] [2020-07-08 12:44:29,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:29,299 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:29,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026510438] [2020-07-08 12:44:29,299 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-08 12:44:29,341 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:44:29,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:29,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:44:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:29,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:29,477 INFO L263 TraceCheckUtils]: 0: Hoare triple {5357#true} call ULTIMATE.init(); {5357#true} is VALID [2020-07-08 12:44:29,478 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-08 12:44:29,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {5357#true} assume true; {5357#true} is VALID [2020-07-08 12:44:29,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5357#true} {5357#true} #78#return; {5357#true} is VALID [2020-07-08 12:44:29,478 INFO L263 TraceCheckUtils]: 4: Hoare triple {5357#true} call #t~ret12 := main(); {5357#true} is VALID [2020-07-08 12:44:29,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {5357#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {5357#true} is VALID [2020-07-08 12:44:29,479 INFO L263 TraceCheckUtils]: 6: Hoare triple {5357#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5357#true} is VALID [2020-07-08 12:44:29,479 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-08 12:44:29,479 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-08 12:44:29,479 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-08 12:44:29,479 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-08 12:44:29,479 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-08 12:44:29,480 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-08 12:44:29,480 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-08 12:44:29,480 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-08 12:44:29,480 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-08 12:44:29,480 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-08 12:44:29,480 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-08 12:44:29,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {5357#true} assume !(~i~0 < 5); {5357#true} is VALID [2020-07-08 12:44:29,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {5357#true} assume true; {5357#true} is VALID [2020-07-08 12:44:29,481 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5357#true} {5357#true} #82#return; {5357#true} is VALID [2020-07-08 12:44:29,481 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-08 12:44:29,481 INFO L263 TraceCheckUtils]: 22: Hoare triple {5357#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5357#true} is VALID [2020-07-08 12:44:29,482 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-08 12:44:29,482 INFO L280 TraceCheckUtils]: 24: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-08 12:44:29,482 INFO L280 TraceCheckUtils]: 25: Hoare triple {5357#true} assume !(~i~1 > 2); {5357#true} is VALID [2020-07-08 12:44:29,482 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-08 12:44:29,482 INFO L280 TraceCheckUtils]: 27: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-08 12:44:29,482 INFO L280 TraceCheckUtils]: 28: Hoare triple {5357#true} assume !(~i~1 > 2); {5357#true} is VALID [2020-07-08 12:44:29,482 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-08 12:44:29,483 INFO L280 TraceCheckUtils]: 30: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-08 12:44:29,483 INFO L280 TraceCheckUtils]: 31: Hoare triple {5357#true} assume !(~i~1 > 2); {5455#(<= rangesum_~i~1 2)} is VALID [2020-07-08 12:44:29,484 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-08 12:44:29,484 INFO L280 TraceCheckUtils]: 33: Hoare triple {5459#(<= rangesum_~i~1 3)} assume !!(~i~1 < 5); {5459#(<= rangesum_~i~1 3)} is VALID [2020-07-08 12:44:29,485 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-08 12:44:29,485 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-08 12:44:29,486 INFO L280 TraceCheckUtils]: 36: Hoare triple {5469#(<= rangesum_~i~1 4)} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,486 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-08 12:44:29,486 INFO L280 TraceCheckUtils]: 38: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-08 12:44:29,486 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5358#false} {5357#true} #84#return; {5358#false} is VALID [2020-07-08 12:44:29,486 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-08 12:44:29,486 INFO L263 TraceCheckUtils]: 41: Hoare triple {5358#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5358#false} is VALID [2020-07-08 12:44:29,487 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-08 12:44:29,487 INFO L280 TraceCheckUtils]: 43: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,487 INFO L280 TraceCheckUtils]: 44: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-08 12:44:29,487 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-08 12:44:29,487 INFO L280 TraceCheckUtils]: 46: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,487 INFO L280 TraceCheckUtils]: 47: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-08 12:44:29,487 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-08 12:44:29,487 INFO L280 TraceCheckUtils]: 49: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,488 INFO L280 TraceCheckUtils]: 50: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-08 12:44:29,488 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-08 12:44:29,488 INFO L280 TraceCheckUtils]: 52: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,488 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-08 12:44:29,488 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-08 12:44:29,488 INFO L280 TraceCheckUtils]: 55: Hoare triple {5358#false} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,488 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-08 12:44:29,488 INFO L280 TraceCheckUtils]: 57: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-08 12:44:29,489 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {5358#false} {5358#false} #86#return; {5358#false} is VALID [2020-07-08 12:44:29,489 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-08 12:44:29,489 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-08 12:44:29,489 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-08 12:44:29,489 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-08 12:44:29,489 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-08 12:44:29,489 INFO L280 TraceCheckUtils]: 64: Hoare triple {5358#false} assume !(~i~2 < 4); {5358#false} is VALID [2020-07-08 12:44:29,489 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-08 12:44:29,490 INFO L263 TraceCheckUtils]: 66: Hoare triple {5358#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5358#false} is VALID [2020-07-08 12:44:29,490 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-08 12:44:29,490 INFO L280 TraceCheckUtils]: 68: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,490 INFO L280 TraceCheckUtils]: 69: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-08 12:44:29,490 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-08 12:44:29,490 INFO L280 TraceCheckUtils]: 71: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,490 INFO L280 TraceCheckUtils]: 72: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-08 12:44:29,490 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-08 12:44:29,491 INFO L280 TraceCheckUtils]: 74: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,491 INFO L280 TraceCheckUtils]: 75: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-08 12:44:29,491 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-08 12:44:29,491 INFO L280 TraceCheckUtils]: 77: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,491 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-08 12:44:29,491 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-08 12:44:29,492 INFO L280 TraceCheckUtils]: 80: Hoare triple {5358#false} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-08 12:44:29,492 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-08 12:44:29,492 INFO L280 TraceCheckUtils]: 82: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-08 12:44:29,492 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {5358#false} {5358#false} #88#return; {5358#false} is VALID [2020-07-08 12:44:29,492 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-08 12:44:29,492 INFO L280 TraceCheckUtils]: 85: Hoare triple {5358#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5358#false} is VALID [2020-07-08 12:44:29,493 INFO L280 TraceCheckUtils]: 86: Hoare triple {5358#false} assume !false; {5358#false} is VALID [2020-07-08 12:44:29,497 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-08 12:44:29,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406071356] [2020-07-08 12:44:29,498 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:29,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026510438] [2020-07-08 12:44:29,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:29,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 12:44:29,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385670753] [2020-07-08 12:44:29,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-07-08 12:44:29,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:29,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:29,560 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-08 12:44:29,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:29,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:29,561 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-08 12:44:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:29,862 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-08 12:44:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:44:29,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-07-08 12:44:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-08 12:44:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-08 12:44:29,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2020-07-08 12:44:29,943 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-08 12:44:29,945 INFO L225 Difference]: With dead ends: 88 [2020-07-08 12:44:29,945 INFO L226 Difference]: Without dead ends: 57 [2020-07-08 12:44:29,946 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-08 12:44:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-08 12:44:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-08 12:44:29,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:29,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-08 12:44:29,999 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-08 12:44:29,999 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-08 12:44:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:30,003 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-08 12:44:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-08 12:44:30,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:30,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:30,004 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-08 12:44:30,005 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-08 12:44:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:30,007 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-08 12:44:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-08 12:44:30,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:30,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:30,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:30,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-08 12:44:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-07-08 12:44:30,011 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 87 [2020-07-08 12:44:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:30,011 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-07-08 12:44:30,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-08 12:44:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-08 12:44:30,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:30,013 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-08 12:44:30,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-08 12:44:30,227 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1679580114, now seen corresponding path program 6 times [2020-07-08 12:44:30,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:30,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389804800] [2020-07-08 12:44:30,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:30,252 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:30,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251723617] [2020-07-08 12:44:30,253 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-08 12:44:30,639 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-08 12:44:30,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:44:30,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-08 12:44:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:30,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:30,783 INFO L263 TraceCheckUtils]: 0: Hoare triple {5942#true} call ULTIMATE.init(); {5942#true} is VALID [2020-07-08 12:44:30,784 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-08 12:44:30,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-08 12:44:30,784 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5942#true} {5942#true} #78#return; {5942#true} is VALID [2020-07-08 12:44:30,784 INFO L263 TraceCheckUtils]: 4: Hoare triple {5942#true} call #t~ret12 := main(); {5942#true} is VALID [2020-07-08 12:44:30,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {5942#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {5942#true} is VALID [2020-07-08 12:44:30,785 INFO L263 TraceCheckUtils]: 6: Hoare triple {5942#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-08 12:44:30,785 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-08 12:44:30,785 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-08 12:44:30,785 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-08 12:44:30,786 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-08 12:44:30,786 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-08 12:44:30,786 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-08 12:44:30,786 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-08 12:44:30,786 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-08 12:44:30,786 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-08 12:44:30,787 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-08 12:44:30,787 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-08 12:44:30,787 INFO L280 TraceCheckUtils]: 18: Hoare triple {5942#true} assume !(~i~0 < 5); {5942#true} is VALID [2020-07-08 12:44:30,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-08 12:44:30,787 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5942#true} {5942#true} #82#return; {5942#true} is VALID [2020-07-08 12:44:30,787 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-08 12:44:30,787 INFO L263 TraceCheckUtils]: 22: Hoare triple {5942#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-08 12:44:30,787 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-08 12:44:30,788 INFO L280 TraceCheckUtils]: 24: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,788 INFO L280 TraceCheckUtils]: 25: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-08 12:44:30,788 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-08 12:44:30,788 INFO L280 TraceCheckUtils]: 27: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,788 INFO L280 TraceCheckUtils]: 28: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-08 12:44:30,788 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-08 12:44:30,788 INFO L280 TraceCheckUtils]: 30: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,788 INFO L280 TraceCheckUtils]: 31: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-08 12:44:30,789 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-08 12:44:30,789 INFO L280 TraceCheckUtils]: 33: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,789 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-08 12:44:30,789 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-08 12:44:30,789 INFO L280 TraceCheckUtils]: 36: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,789 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-08 12:44:30,789 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-08 12:44:30,789 INFO L280 TraceCheckUtils]: 39: Hoare triple {5942#true} assume !(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,790 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-08 12:44:30,790 INFO L280 TraceCheckUtils]: 41: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-08 12:44:30,790 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {5942#true} {5942#true} #84#return; {5942#true} is VALID [2020-07-08 12:44:30,790 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-08 12:44:30,790 INFO L263 TraceCheckUtils]: 44: Hoare triple {5942#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-08 12:44:30,790 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-08 12:44:30,790 INFO L280 TraceCheckUtils]: 46: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,790 INFO L280 TraceCheckUtils]: 47: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-08 12:44:30,791 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-08 12:44:30,791 INFO L280 TraceCheckUtils]: 49: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,791 INFO L280 TraceCheckUtils]: 50: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-08 12:44:30,791 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-08 12:44:30,791 INFO L280 TraceCheckUtils]: 52: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,791 INFO L280 TraceCheckUtils]: 53: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-08 12:44:30,791 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-08 12:44:30,791 INFO L280 TraceCheckUtils]: 55: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,792 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-08 12:44:30,792 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-08 12:44:30,792 INFO L280 TraceCheckUtils]: 58: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,792 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-08 12:44:30,792 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-08 12:44:30,792 INFO L280 TraceCheckUtils]: 61: Hoare triple {5942#true} assume !(~i~1 < 5); {5942#true} is VALID [2020-07-08 12:44:30,792 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-08 12:44:30,792 INFO L280 TraceCheckUtils]: 63: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-08 12:44:30,793 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {5942#true} {5942#true} #86#return; {5942#true} is VALID [2020-07-08 12:44:30,793 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-08 12:44:30,794 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-08 12:44:30,795 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-08 12:44:30,795 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-08 12:44:30,796 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-08 12:44:30,796 INFO L280 TraceCheckUtils]: 70: Hoare triple {6156#(<= main_~i~2 2)} assume !(~i~2 < 4); {5943#false} is VALID [2020-07-08 12:44:30,796 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-08 12:44:30,796 INFO L263 TraceCheckUtils]: 72: Hoare triple {5943#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5943#false} is VALID [2020-07-08 12:44:30,797 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-08 12:44:30,797 INFO L280 TraceCheckUtils]: 74: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-08 12:44:30,797 INFO L280 TraceCheckUtils]: 75: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-08 12:44:30,797 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-08 12:44:30,797 INFO L280 TraceCheckUtils]: 77: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-08 12:44:30,797 INFO L280 TraceCheckUtils]: 78: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-08 12:44:30,797 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-08 12:44:30,797 INFO L280 TraceCheckUtils]: 80: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-08 12:44:30,798 INFO L280 TraceCheckUtils]: 81: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-08 12:44:30,798 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-08 12:44:30,798 INFO L280 TraceCheckUtils]: 83: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-08 12:44:30,798 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-08 12:44:30,798 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-08 12:44:30,798 INFO L280 TraceCheckUtils]: 86: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-08 12:44:30,798 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-08 12:44:30,798 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-08 12:44:30,799 INFO L280 TraceCheckUtils]: 89: Hoare triple {5943#false} assume !(~i~1 < 5); {5943#false} is VALID [2020-07-08 12:44:30,799 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-08 12:44:30,799 INFO L280 TraceCheckUtils]: 91: Hoare triple {5943#false} assume true; {5943#false} is VALID [2020-07-08 12:44:30,799 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {5943#false} {5943#false} #88#return; {5943#false} is VALID [2020-07-08 12:44:30,799 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-08 12:44:30,799 INFO L280 TraceCheckUtils]: 94: Hoare triple {5943#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5943#false} is VALID [2020-07-08 12:44:30,799 INFO L280 TraceCheckUtils]: 95: Hoare triple {5943#false} assume !false; {5943#false} is VALID [2020-07-08 12:44:30,803 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-08 12:44:30,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389804800] [2020-07-08 12:44:30,804 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:30,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251723617] [2020-07-08 12:44:30,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:30,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 12:44:30,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137315661] [2020-07-08 12:44:30,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-07-08 12:44:30,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:30,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:30,858 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-08 12:44:30,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:30,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:30,859 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2020-07-08 12:44:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:31,244 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2020-07-08 12:44:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:44:31,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-07-08 12:44:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-08 12:44:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-08 12:44:31,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-08 12:44:31,319 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-08 12:44:31,321 INFO L225 Difference]: With dead ends: 86 [2020-07-08 12:44:31,322 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 12:44:31,323 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-08 12:44:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 12:44:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2020-07-08 12:44:31,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:31,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2020-07-08 12:44:31,363 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2020-07-08 12:44:31,364 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2020-07-08 12:44:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:31,367 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-07-08 12:44:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-08 12:44:31,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:31,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:31,368 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2020-07-08 12:44:31,368 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2020-07-08 12:44:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:31,370 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-07-08 12:44:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-08 12:44:31,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:31,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:31,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:31,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 12:44:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-08 12:44:31,373 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 96 [2020-07-08 12:44:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:31,373 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-08 12:44:31,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-08 12:44:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-08 12:44:31,374 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:31,375 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-08 12:44:31,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:31,589 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2078244212, now seen corresponding path program 7 times [2020-07-08 12:44:31,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:31,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831197385] [2020-07-08 12:44:31,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:31,612 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:31,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724179162] [2020-07-08 12:44:31,612 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-08 12:44:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:31,676 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:44:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:31,696 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:44:31,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {6559#true} call ULTIMATE.init(); {6559#true} is VALID [2020-07-08 12:44:31,835 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-08 12:44:31,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-08 12:44:31,835 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6559#true} {6559#true} #78#return; {6559#true} is VALID [2020-07-08 12:44:31,836 INFO L263 TraceCheckUtils]: 4: Hoare triple {6559#true} call #t~ret12 := main(); {6559#true} is VALID [2020-07-08 12:44:31,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {6559#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {6559#true} is VALID [2020-07-08 12:44:31,836 INFO L263 TraceCheckUtils]: 6: Hoare triple {6559#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-08 12:44:31,836 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-08 12:44:31,836 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-08 12:44:31,837 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-08 12:44:31,837 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-08 12:44:31,837 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-08 12:44:31,837 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-08 12:44:31,837 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-08 12:44:31,838 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-08 12:44:31,838 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-08 12:44:31,838 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-08 12:44:31,838 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-08 12:44:31,838 INFO L280 TraceCheckUtils]: 18: Hoare triple {6559#true} assume !(~i~0 < 5); {6559#true} is VALID [2020-07-08 12:44:31,838 INFO L280 TraceCheckUtils]: 19: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-08 12:44:31,839 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {6559#true} {6559#true} #82#return; {6559#true} is VALID [2020-07-08 12:44:31,839 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-08 12:44:31,839 INFO L263 TraceCheckUtils]: 22: Hoare triple {6559#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-08 12:44:31,839 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-08 12:44:31,839 INFO L280 TraceCheckUtils]: 24: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,840 INFO L280 TraceCheckUtils]: 25: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-08 12:44:31,840 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-08 12:44:31,840 INFO L280 TraceCheckUtils]: 27: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,840 INFO L280 TraceCheckUtils]: 28: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-08 12:44:31,840 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-08 12:44:31,840 INFO L280 TraceCheckUtils]: 30: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,841 INFO L280 TraceCheckUtils]: 31: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-08 12:44:31,841 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-08 12:44:31,841 INFO L280 TraceCheckUtils]: 33: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,841 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-08 12:44:31,841 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-08 12:44:31,841 INFO L280 TraceCheckUtils]: 36: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,842 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-08 12:44:31,842 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-08 12:44:31,842 INFO L280 TraceCheckUtils]: 39: Hoare triple {6559#true} assume !(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,842 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-08 12:44:31,842 INFO L280 TraceCheckUtils]: 41: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-08 12:44:31,842 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {6559#true} {6559#true} #84#return; {6559#true} is VALID [2020-07-08 12:44:31,843 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-08 12:44:31,843 INFO L263 TraceCheckUtils]: 44: Hoare triple {6559#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-08 12:44:31,843 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-08 12:44:31,843 INFO L280 TraceCheckUtils]: 46: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,843 INFO L280 TraceCheckUtils]: 47: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-08 12:44:31,844 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-08 12:44:31,844 INFO L280 TraceCheckUtils]: 49: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,844 INFO L280 TraceCheckUtils]: 50: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-08 12:44:31,844 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-08 12:44:31,844 INFO L280 TraceCheckUtils]: 52: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,844 INFO L280 TraceCheckUtils]: 53: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-08 12:44:31,845 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-08 12:44:31,845 INFO L280 TraceCheckUtils]: 55: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,845 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-08 12:44:31,845 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-08 12:44:31,845 INFO L280 TraceCheckUtils]: 58: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,846 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-08 12:44:31,846 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-08 12:44:31,846 INFO L280 TraceCheckUtils]: 61: Hoare triple {6559#true} assume !(~i~1 < 5); {6559#true} is VALID [2020-07-08 12:44:31,846 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-08 12:44:31,846 INFO L280 TraceCheckUtils]: 63: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-08 12:44:31,846 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {6559#true} {6559#true} #86#return; {6559#true} is VALID [2020-07-08 12:44:31,847 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-08 12:44:31,848 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-08 12:44:31,849 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-08 12:44:31,850 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-08 12:44:31,852 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-08 12:44:31,852 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-08 12:44:31,854 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-08 12:44:31,854 INFO L280 TraceCheckUtils]: 72: Hoare triple {6780#(<= main_~i~2 3)} assume !(~i~2 < 4); {6560#false} is VALID [2020-07-08 12:44:31,855 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-08 12:44:31,855 INFO L263 TraceCheckUtils]: 74: Hoare triple {6560#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6560#false} is VALID [2020-07-08 12:44:31,855 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-08 12:44:31,855 INFO L280 TraceCheckUtils]: 76: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-08 12:44:31,855 INFO L280 TraceCheckUtils]: 77: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-08 12:44:31,856 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-08 12:44:31,856 INFO L280 TraceCheckUtils]: 79: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-08 12:44:31,856 INFO L280 TraceCheckUtils]: 80: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-08 12:44:31,856 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-08 12:44:31,856 INFO L280 TraceCheckUtils]: 82: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-08 12:44:31,856 INFO L280 TraceCheckUtils]: 83: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-08 12:44:31,857 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-08 12:44:31,857 INFO L280 TraceCheckUtils]: 85: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-08 12:44:31,857 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-08 12:44:31,857 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-08 12:44:31,857 INFO L280 TraceCheckUtils]: 88: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-08 12:44:31,858 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-08 12:44:31,858 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-08 12:44:31,858 INFO L280 TraceCheckUtils]: 91: Hoare triple {6560#false} assume !(~i~1 < 5); {6560#false} is VALID [2020-07-08 12:44:31,858 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-08 12:44:31,858 INFO L280 TraceCheckUtils]: 93: Hoare triple {6560#false} assume true; {6560#false} is VALID [2020-07-08 12:44:31,858 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {6560#false} {6560#false} #88#return; {6560#false} is VALID [2020-07-08 12:44:31,859 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-08 12:44:31,859 INFO L280 TraceCheckUtils]: 96: Hoare triple {6560#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6560#false} is VALID [2020-07-08 12:44:31,859 INFO L280 TraceCheckUtils]: 97: Hoare triple {6560#false} assume !false; {6560#false} is VALID [2020-07-08 12:44:31,864 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-08 12:44:31,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831197385] [2020-07-08 12:44:31,865 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:44:31,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724179162] [2020-07-08 12:44:31,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:44:31,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 12:44:31,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488310432] [2020-07-08 12:44:31,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-08 12:44:31,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:31,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:44:31,928 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-08 12:44:31,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:44:31,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:31,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:44:31,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:44:31,930 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2020-07-08 12:44:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:32,120 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2020-07-08 12:44:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:44:32,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-08 12:44:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:44:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-08 12:44:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:44:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-08 12:44:32,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2020-07-08 12:44:32,200 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-08 12:44:32,201 INFO L225 Difference]: With dead ends: 87 [2020-07-08 12:44:32,201 INFO L226 Difference]: Without dead ends: 61 [2020-07-08 12:44:32,202 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-08 12:44:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-08 12:44:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-08 12:44:32,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:32,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2020-07-08 12:44:32,257 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-08 12:44:32,257 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-08 12:44:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:32,259 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-07-08 12:44:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-08 12:44:32,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:32,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:32,261 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-08 12:44:32,261 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-08 12:44:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:32,263 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-07-08 12:44:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-08 12:44:32,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:32,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:32,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:32,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 12:44:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-07-08 12:44:32,266 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 98 [2020-07-08 12:44:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:32,267 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-07-08 12:44:32,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:44:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-08 12:44:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-08 12:44:32,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:32,269 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-08 12:44:32,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-08 12:44:32,483 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:32,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614250, now seen corresponding path program 8 times [2020-07-08 12:44:32,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:32,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112183204] [2020-07-08 12:44:32,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:32,497 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:32,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925045614] [2020-07-08 12:44:32,498 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-08 12:44:32,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:44:32,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-08 12:44:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:33,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:44:33,158 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:44:33,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-08 12:44:33,457 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:33,458 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 12:44:33,459 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-08 12:44:33,460 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-08 12:44:33,461 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 12:44:33,462 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 12:44:33,462 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:44:33,462 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:44:33,462 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-08 12:44:33,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:44:33 BoogieIcfgContainer [2020-07-08 12:44:33,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:44:33,467 INFO L168 Benchmark]: Toolchain (without parser) took 18567.12 ms. Allocated memory was 147.3 MB in the beginning and 324.0 MB in the end (delta: 176.7 MB). Free memory was 104.7 MB in the beginning and 98.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 183.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:33,467 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:44:33,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.51 ms. Allocated memory is still 147.3 MB. Free memory was 104.4 MB in the beginning and 93.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:33,468 INFO L168 Benchmark]: Boogie Preprocessor took 142.42 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 93.5 MB in the beginning and 179.9 MB in the end (delta: -86.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:33,469 INFO L168 Benchmark]: RCFGBuilder took 641.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 151.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:33,469 INFO L168 Benchmark]: TraceAbstraction took 17496.28 ms. Allocated memory was 202.4 MB in the beginning and 324.0 MB in the end (delta: 121.6 MB). Free memory was 150.7 MB in the beginning and 98.1 MB in the end (delta: 52.6 MB). Peak memory consumption was 174.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:33,471 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.50 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.51 ms. Allocated memory is still 147.3 MB. Free memory was 104.4 MB in the beginning and 93.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.42 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 93.5 MB in the beginning and 179.9 MB in the end (delta: -86.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 641.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 151.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17496.28 ms. Allocated memory was 202.4 MB in the beginning and 324.0 MB in the end (delta: 121.6 MB). Free memory was 150.7 MB in the beginning and 98.1 MB in the end (delta: 52.6 MB). Peak memory consumption was 174.2 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=2147483646, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=2147483646, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=2147483646, 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=4294967293, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=4294967293, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=4294967293, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=2147483646, cnt=2, i=5, ret=4294967293, x={2:0}, x={2:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=2147483646, 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=2147483646, temp=2147483646, 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=2147483646, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=2147483646, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=2147483646, 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=4294967293, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=4294967293, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=4294967293, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=2147483646, cnt=2, i=5, ret=4294967293, x={2:0}, x={2:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=2147483646, ret=2147483646, temp=2147483646, x={2:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=2147483646, ret2=2147483646, temp=-2147483644, 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=2147483646, ret2=2147483646, temp=-2147483644, 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=2147483646, ret2=2147483646, temp=-2147483644, 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=2147483646, ret2=2147483646, temp=-2147483644, 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=2147483646, ret2=2147483646, temp=-2147483644, x={2:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=2147483646, ret2=2147483646, temp=-2147483644, x={2:0}] [L46] x[5 -1] = temp VAL [i=4, ret=2147483646, ret2=2147483646, temp=-2147483644, 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=2147483647, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=2147483647, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=2147483647, 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=3, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=3, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=3, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=1, cnt=2, i=5, ret=3, x={2:0}, x={2:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=1, ret=2147483646, ret2=2147483646, temp=-2147483644, x={2:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=2147483646, ret2=2147483646, ret5=1, temp=-2147483644, x={2:0}] [L50] __VERIFIER_error() VAL [i=4, ret=2147483646, ret2=2147483646, ret5=1, temp=-2147483644, x={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 16, TraceHistogramMax: 15, AutomataDifference: 6.5s, 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 974 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s 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.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.7s 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...