/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-267fbe0 [2020-07-17 22:48:42,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:42,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:42,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:42,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:42,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:42,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:42,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:42,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:42,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:42,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:42,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:42,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:42,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:42,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:42,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:42,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:42,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:42,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:42,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:42,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:42,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:42,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:42,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:42,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:42,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:42,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:42,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:42,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:42,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:42,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:42,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:42,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:42,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:42,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:42,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:42,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:42,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:42,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:42,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:42,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:42,204 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-17 22:48:42,233 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:42,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:42,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:42,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:42,237 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:42,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:42,237 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:42,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:42,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:42,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:42,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:42,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:42,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:42,240 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:42,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:42,241 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:42,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:42,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:42,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:42,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:42,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:42,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:42,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:42,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:42,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:42,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:42,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:42,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:42,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:42,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:42,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:42,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:42,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:42,569 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:42,569 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:42,570 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i [2020-07-17 22:48:42,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ed10de/979ef42a6c4845b398192f84975c1b75/FLAGfbabe6a97 [2020-07-17 22:48:43,214 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:43,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i [2020-07-17 22:48:43,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ed10de/979ef42a6c4845b398192f84975c1b75/FLAGfbabe6a97 [2020-07-17 22:48:43,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ed10de/979ef42a6c4845b398192f84975c1b75 [2020-07-17 22:48:43,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:43,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:43,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:43,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:43,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:43,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2e350c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43, skipping insertion in model container [2020-07-17 22:48:43,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:43,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:43,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:43,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:43,926 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:43,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:43,977 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:43,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43 WrapperNode [2020-07-17 22:48:43,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:43,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:43,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:43,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:44,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (1/1) ... [2020-07-17 22:48:44,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:44,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:44,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:44,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:44,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (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-17 22:48:44,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:44,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:44,282 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2020-07-17 22:48:44,282 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2020-07-17 22:48:44,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2020-07-17 22:48:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2020-07-17 22:48:44,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:48:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:44,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:44,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:44,881 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:44,882 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:44,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:44 BoogieIcfgContainer [2020-07-17 22:48:44,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:44,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:44,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:44,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:44,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:43" (1/3) ... [2020-07-17 22:48:44,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cbac0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:44, skipping insertion in model container [2020-07-17 22:48:44,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:43" (2/3) ... [2020-07-17 22:48:44,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cbac0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:44, skipping insertion in model container [2020-07-17 22:48:44,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:44" (3/3) ... [2020-07-17 22:48:44,895 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2020-07-17 22:48:44,904 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:44,912 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:44,926 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:44,953 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:44,954 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:44,954 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:44,954 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:44,954 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:44,954 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:44,954 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:44,954 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-17 22:48:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:48:44,983 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:44,985 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-17 22:48:44,985 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2020-07-17 22:48:45,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:45,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762719828] [2020-07-17 22:48:45,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762719828] [2020-07-17 22:48:45,167 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-17 22:48:45,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842972578] [2020-07-17 22:48:45,168 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-17 22:48:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-17 22:48:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:45,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:45,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2020-07-17 22:48:45,470 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-17 22:48:45,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:48:45,471 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #78#return; {40#true} is VALID [2020-07-17 22:48:45,472 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2020-07-17 22:48:45,472 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {40#true} is VALID [2020-07-17 22:48:45,472 INFO L263 TraceCheckUtils]: 6: Hoare triple {40#true} call init_nondet(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2020-07-17 22:48:45,473 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-17 22:48:45,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} assume !(~i~0 < 5); {40#true} is VALID [2020-07-17 22:48:45,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:48:45,474 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #82#return; {40#true} is VALID [2020-07-17 22:48:45,474 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-17 22:48:45,475 INFO L263 TraceCheckUtils]: 12: Hoare triple {40#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2020-07-17 22:48:45,475 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-17 22:48:45,477 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-17 22:48:45,477 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-17 22:48:45,478 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:48:45,478 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {41#false} {40#true} #84#return; {41#false} is VALID [2020-07-17 22:48:45,479 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-17 22:48:45,479 INFO L263 TraceCheckUtils]: 19: Hoare triple {41#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2020-07-17 22:48:45,480 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-17 22:48:45,480 INFO L280 TraceCheckUtils]: 21: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-17 22:48:45,480 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-17 22:48:45,481 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:48:45,481 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {41#false} {41#false} #86#return; {41#false} is VALID [2020-07-17 22:48:45,481 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-17 22:48:45,482 INFO L280 TraceCheckUtils]: 26: Hoare triple {41#false} assume !(~i~2 < 4); {41#false} is VALID [2020-07-17 22:48:45,482 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-17 22:48:45,483 INFO L263 TraceCheckUtils]: 28: Hoare triple {41#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2020-07-17 22:48:45,483 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-17 22:48:45,483 INFO L280 TraceCheckUtils]: 30: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-17 22:48:45,484 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-17 22:48:45,484 INFO L280 TraceCheckUtils]: 32: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:48:45,484 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {41#false} {41#false} #88#return; {41#false} is VALID [2020-07-17 22:48:45,485 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-17 22:48:45,485 INFO L280 TraceCheckUtils]: 35: Hoare triple {41#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {41#false} is VALID [2020-07-17 22:48:45,485 INFO L280 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-17 22:48:45,493 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-17 22:48:45,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:45,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:48:45,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759625300] [2020-07-17 22:48:45,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-07-17 22:48:45,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:45,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:48:45,580 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-17 22:48:45,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:48:45,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:45,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:48:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:48:45,595 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-17 22:48:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:45,712 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2020-07-17 22:48:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:48:45,712 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-07-17 22:48:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:48:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2020-07-17 22:48:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:48:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2020-07-17 22:48:45,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2020-07-17 22:48:45,913 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-17 22:48:45,928 INFO L225 Difference]: With dead ends: 64 [2020-07-17 22:48:45,929 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:48:45,933 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-17 22:48:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:48:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-17 22:48:45,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:45,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-17 22:48:45,988 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:48:45,988 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:48:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:45,995 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-17 22:48:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-17 22:48:45,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:45,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:45,997 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:48:45,997 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:48:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,003 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-17 22:48:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-17 22:48:46,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:46,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:48:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-17 22:48:46,011 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2020-07-17 22:48:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:46,012 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-17 22:48:46,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:48:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-17 22:48:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:48:46,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:46,015 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-17 22:48:46,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-17 22:48:46,230 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2020-07-17 22:48:46,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:46,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795091530] [2020-07-17 22:48:46,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:46,256 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:46,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895302456] [2020-07-17 22:48:46,256 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-17 22:48:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-17 22:48:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:46,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:46,428 INFO L263 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2020-07-17 22:48:46,429 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-17 22:48:46,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-17 22:48:46,429 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #78#return; {344#true} is VALID [2020-07-17 22:48:46,430 INFO L263 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret12 := main(); {344#true} is VALID [2020-07-17 22:48:46,430 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {344#true} is VALID [2020-07-17 22:48:46,430 INFO L263 TraceCheckUtils]: 6: Hoare triple {344#true} call init_nondet(~#x~0.base, ~#x~0.offset); {344#true} is VALID [2020-07-17 22:48:46,432 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-17 22:48:46,433 INFO L280 TraceCheckUtils]: 8: Hoare triple {370#(<= init_nondet_~i~0 0)} assume !(~i~0 < 5); {345#false} is VALID [2020-07-17 22:48:46,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-17 22:48:46,434 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {345#false} {344#true} #82#return; {345#false} is VALID [2020-07-17 22:48:46,434 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-17 22:48:46,435 INFO L263 TraceCheckUtils]: 12: Hoare triple {345#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-17 22:48:46,435 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-17 22:48:46,435 INFO L280 TraceCheckUtils]: 14: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-17 22:48:46,436 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-17 22:48:46,436 INFO L280 TraceCheckUtils]: 16: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-17 22:48:46,437 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {345#false} {345#false} #84#return; {345#false} is VALID [2020-07-17 22:48:46,437 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-17 22:48:46,437 INFO L263 TraceCheckUtils]: 19: Hoare triple {345#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-17 22:48:46,438 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-17 22:48:46,438 INFO L280 TraceCheckUtils]: 21: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-17 22:48:46,438 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-17 22:48:46,438 INFO L280 TraceCheckUtils]: 23: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-17 22:48:46,439 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {345#false} {345#false} #86#return; {345#false} is VALID [2020-07-17 22:48:46,439 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-17 22:48:46,440 INFO L280 TraceCheckUtils]: 26: Hoare triple {345#false} assume !(~i~2 < 4); {345#false} is VALID [2020-07-17 22:48:46,440 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-17 22:48:46,440 INFO L263 TraceCheckUtils]: 28: Hoare triple {345#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2020-07-17 22:48:46,440 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-17 22:48:46,441 INFO L280 TraceCheckUtils]: 30: Hoare triple {345#false} assume !(~i~1 < 5); {345#false} is VALID [2020-07-17 22:48:46,441 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-17 22:48:46,441 INFO L280 TraceCheckUtils]: 32: Hoare triple {345#false} assume true; {345#false} is VALID [2020-07-17 22:48:46,442 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {345#false} {345#false} #88#return; {345#false} is VALID [2020-07-17 22:48:46,442 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-17 22:48:46,442 INFO L280 TraceCheckUtils]: 35: Hoare triple {345#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {345#false} is VALID [2020-07-17 22:48:46,443 INFO L280 TraceCheckUtils]: 36: Hoare triple {345#false} assume !false; {345#false} is VALID [2020-07-17 22:48:46,445 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-17 22:48:46,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795091530] [2020-07-17 22:48:46,445 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:46,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895302456] [2020-07-17 22:48:46,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:46,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:46,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976547365] [2020-07-17 22:48:46,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-17 22:48:46,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:46,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:46,495 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-17 22:48:46,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:46,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:46,497 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2020-07-17 22:48:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,631 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-07-17 22:48:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:46,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-17 22:48:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-17 22:48:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-17 22:48:46,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2020-07-17 22:48:46,743 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-17 22:48:46,745 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:48:46,746 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:48:46,747 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-17 22:48:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:48:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-17 22:48:46,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:46,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-17 22:48:46,761 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-17 22:48:46,761 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-17 22:48:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,765 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-17 22:48:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-17 22:48:46,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,766 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-17 22:48:46,767 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-17 22:48:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:46,771 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-17 22:48:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-17 22:48:46,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:46,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:46,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:46,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:48:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-07-17 22:48:46,776 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2020-07-17 22:48:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:46,776 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-17 22:48:46,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-07-17 22:48:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 22:48:46,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:46,779 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-17 22:48:46,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:46,993 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2020-07-17 22:48:46,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:46,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360105027] [2020-07-17 22:48:46,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:47,040 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:47,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846917275] [2020-07-17 22:48:47,041 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-17 22:48:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-17 22:48:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:47,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:47,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2020-07-17 22:48:47,201 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-17 22:48:47,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-17 22:48:47,202 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #78#return; {648#true} is VALID [2020-07-17 22:48:47,203 INFO L263 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret12 := main(); {648#true} is VALID [2020-07-17 22:48:47,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {648#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {648#true} is VALID [2020-07-17 22:48:47,203 INFO L263 TraceCheckUtils]: 6: Hoare triple {648#true} call init_nondet(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2020-07-17 22:48:47,204 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-17 22:48:47,204 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-17 22:48:47,204 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-17 22:48:47,205 INFO L280 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(~i~0 < 5); {648#true} is VALID [2020-07-17 22:48:47,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {648#true} assume true; {648#true} is VALID [2020-07-17 22:48:47,205 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {648#true} {648#true} #82#return; {648#true} is VALID [2020-07-17 22:48:47,206 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-17 22:48:47,206 INFO L263 TraceCheckUtils]: 14: Hoare triple {648#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2020-07-17 22:48:47,207 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-17 22:48:47,209 INFO L280 TraceCheckUtils]: 16: Hoare triple {698#(<= rangesum_~i~1 0)} assume !(~i~1 < 5); {649#false} is VALID [2020-07-17 22:48:47,209 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-17 22:48:47,210 INFO L280 TraceCheckUtils]: 18: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-17 22:48:47,210 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {649#false} {648#true} #84#return; {649#false} is VALID [2020-07-17 22:48:47,210 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-17 22:48:47,211 INFO L263 TraceCheckUtils]: 21: Hoare triple {649#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2020-07-17 22:48:47,211 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-17 22:48:47,212 INFO L280 TraceCheckUtils]: 23: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2020-07-17 22:48:47,212 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-17 22:48:47,212 INFO L280 TraceCheckUtils]: 25: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-17 22:48:47,213 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {649#false} {649#false} #86#return; {649#false} is VALID [2020-07-17 22:48:47,213 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-17 22:48:47,214 INFO L280 TraceCheckUtils]: 28: Hoare triple {649#false} assume !(~i~2 < 4); {649#false} is VALID [2020-07-17 22:48:47,214 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-17 22:48:47,214 INFO L263 TraceCheckUtils]: 30: Hoare triple {649#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2020-07-17 22:48:47,215 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-17 22:48:47,215 INFO L280 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~i~1 < 5); {649#false} is VALID [2020-07-17 22:48:47,215 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-17 22:48:47,216 INFO L280 TraceCheckUtils]: 34: Hoare triple {649#false} assume true; {649#false} is VALID [2020-07-17 22:48:47,216 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {649#false} {649#false} #88#return; {649#false} is VALID [2020-07-17 22:48:47,216 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-17 22:48:47,217 INFO L280 TraceCheckUtils]: 37: Hoare triple {649#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {649#false} is VALID [2020-07-17 22:48:47,217 INFO L280 TraceCheckUtils]: 38: Hoare triple {649#false} assume !false; {649#false} is VALID [2020-07-17 22:48:47,221 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-17 22:48:47,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360105027] [2020-07-17 22:48:47,222 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:47,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846917275] [2020-07-17 22:48:47,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:47,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:47,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174260923] [2020-07-17 22:48:47,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-17 22:48:47,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:47,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:47,301 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-17 22:48:47,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:47,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:47,303 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2020-07-17 22:48:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,608 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-07-17 22:48:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:47,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-17 22:48:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-17 22:48:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2020-07-17 22:48:47,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2020-07-17 22:48:47,706 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-17 22:48:47,708 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:48:47,709 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:48:47,710 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-17 22:48:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:48:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-17 22:48:47,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:47,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-17 22:48:47,725 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-17 22:48:47,725 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-17 22:48:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,729 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-17 22:48:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-17 22:48:47,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,730 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-17 22:48:47,731 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-17 22:48:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:47,734 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2020-07-17 22:48:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-17 22:48:47,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:47,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:47,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:47,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:48:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-07-17 22:48:47,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2020-07-17 22:48:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:47,740 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-07-17 22:48:47,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:48:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-17 22:48:47,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:47,742 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-17 22:48:47,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:47,957 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2020-07-17 22:48:47,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:47,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874875708] [2020-07-17 22:48:47,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:47,989 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:47,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337132058] [2020-07-17 22:48:47,990 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-17 22:48:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-17 22:48:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:48,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2020-07-17 22:48:48,159 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-17 22:48:48,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-17 22:48:48,159 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #78#return; {963#true} is VALID [2020-07-17 22:48:48,160 INFO L263 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret12 := main(); {963#true} is VALID [2020-07-17 22:48:48,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {963#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {963#true} is VALID [2020-07-17 22:48:48,160 INFO L263 TraceCheckUtils]: 6: Hoare triple {963#true} call init_nondet(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-17 22:48:48,160 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-17 22:48:48,161 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-17 22:48:48,161 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-17 22:48:48,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {963#true} assume !(~i~0 < 5); {963#true} is VALID [2020-07-17 22:48:48,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-17 22:48:48,162 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {963#true} {963#true} #82#return; {963#true} is VALID [2020-07-17 22:48:48,162 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-17 22:48:48,162 INFO L263 TraceCheckUtils]: 14: Hoare triple {963#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-17 22:48:48,163 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-17 22:48:48,163 INFO L280 TraceCheckUtils]: 16: Hoare triple {963#true} assume !!(~i~1 < 5); {963#true} is VALID [2020-07-17 22:48:48,163 INFO L280 TraceCheckUtils]: 17: Hoare triple {963#true} assume !(~i~1 > 2); {963#true} is VALID [2020-07-17 22:48:48,164 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-17 22:48:48,164 INFO L280 TraceCheckUtils]: 19: Hoare triple {963#true} assume !(~i~1 < 5); {963#true} is VALID [2020-07-17 22:48:48,164 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-17 22:48:48,164 INFO L280 TraceCheckUtils]: 21: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-17 22:48:48,165 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {963#true} {963#true} #84#return; {963#true} is VALID [2020-07-17 22:48:48,165 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-17 22:48:48,165 INFO L263 TraceCheckUtils]: 24: Hoare triple {963#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {963#true} is VALID [2020-07-17 22:48:48,165 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-17 22:48:48,166 INFO L280 TraceCheckUtils]: 26: Hoare triple {963#true} assume !!(~i~1 < 5); {963#true} is VALID [2020-07-17 22:48:48,166 INFO L280 TraceCheckUtils]: 27: Hoare triple {963#true} assume !(~i~1 > 2); {963#true} is VALID [2020-07-17 22:48:48,166 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-17 22:48:48,166 INFO L280 TraceCheckUtils]: 29: Hoare triple {963#true} assume !(~i~1 < 5); {963#true} is VALID [2020-07-17 22:48:48,167 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-17 22:48:48,167 INFO L280 TraceCheckUtils]: 31: Hoare triple {963#true} assume true; {963#true} is VALID [2020-07-17 22:48:48,167 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {963#true} {963#true} #86#return; {963#true} is VALID [2020-07-17 22:48:48,174 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-17 22:48:48,181 INFO L280 TraceCheckUtils]: 34: Hoare triple {1067#(<= main_~i~2 0)} assume !(~i~2 < 4); {964#false} is VALID [2020-07-17 22:48:48,181 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-17 22:48:48,181 INFO L263 TraceCheckUtils]: 36: Hoare triple {964#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {964#false} is VALID [2020-07-17 22:48:48,181 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-17 22:48:48,182 INFO L280 TraceCheckUtils]: 38: Hoare triple {964#false} assume !!(~i~1 < 5); {964#false} is VALID [2020-07-17 22:48:48,182 INFO L280 TraceCheckUtils]: 39: Hoare triple {964#false} assume !(~i~1 > 2); {964#false} is VALID [2020-07-17 22:48:48,182 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-17 22:48:48,182 INFO L280 TraceCheckUtils]: 41: Hoare triple {964#false} assume !(~i~1 < 5); {964#false} is VALID [2020-07-17 22:48:48,182 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-17 22:48:48,183 INFO L280 TraceCheckUtils]: 43: Hoare triple {964#false} assume true; {964#false} is VALID [2020-07-17 22:48:48,183 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {964#false} {964#false} #88#return; {964#false} is VALID [2020-07-17 22:48:48,183 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-17 22:48:48,183 INFO L280 TraceCheckUtils]: 46: Hoare triple {964#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {964#false} is VALID [2020-07-17 22:48:48,184 INFO L280 TraceCheckUtils]: 47: Hoare triple {964#false} assume !false; {964#false} is VALID [2020-07-17 22:48:48,186 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-17 22:48:48,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874875708] [2020-07-17 22:48:48,187 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:48,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337132058] [2020-07-17 22:48:48,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:48,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:48,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774801156] [2020-07-17 22:48:48,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-17 22:48:48,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:48,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:48,246 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-17 22:48:48,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:48,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:48,248 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2020-07-17 22:48:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:48,352 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-17 22:48:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:48,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-17 22:48:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-17 22:48:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-17 22:48:48,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2020-07-17 22:48:48,421 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-17 22:48:48,423 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:48:48,423 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:48:48,423 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-17 22:48:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:48:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-17 22:48:48,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:48,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-17 22:48:48,450 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-17 22:48:48,450 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-17 22:48:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:48,453 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-17 22:48:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-17 22:48:48,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:48,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:48,456 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-17 22:48:48,457 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-17 22:48:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:48,465 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-17 22:48:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-17 22:48:48,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:48,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:48,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:48,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:48:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2020-07-17 22:48:48,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 48 [2020-07-17 22:48:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:48,473 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2020-07-17 22:48:48,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-07-17 22:48:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:48:48,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:48,477 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-17 22:48:48,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:48,692 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 494084840, now seen corresponding path program 1 times [2020-07-17 22:48:48,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:48,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883712590] [2020-07-17 22:48:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:48,717 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:48,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543332105] [2020-07-17 22:48:48,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-17 22:48:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:48,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:48,852 INFO L263 TraceCheckUtils]: 0: Hoare triple {1307#true} call ULTIMATE.init(); {1307#true} is VALID [2020-07-17 22:48:48,852 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-17 22:48:48,852 INFO L280 TraceCheckUtils]: 2: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-17 22:48:48,853 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1307#true} {1307#true} #78#return; {1307#true} is VALID [2020-07-17 22:48:48,853 INFO L263 TraceCheckUtils]: 4: Hoare triple {1307#true} call #t~ret12 := main(); {1307#true} is VALID [2020-07-17 22:48:48,853 INFO L280 TraceCheckUtils]: 5: Hoare triple {1307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1307#true} is VALID [2020-07-17 22:48:48,853 INFO L263 TraceCheckUtils]: 6: Hoare triple {1307#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1307#true} is VALID [2020-07-17 22:48:48,853 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-17 22:48:48,854 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-17 22:48:48,854 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-17 22:48:48,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {1307#true} assume !(~i~0 < 5); {1307#true} is VALID [2020-07-17 22:48:48,854 INFO L280 TraceCheckUtils]: 11: Hoare triple {1307#true} assume true; {1307#true} is VALID [2020-07-17 22:48:48,855 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1307#true} {1307#true} #82#return; {1307#true} is VALID [2020-07-17 22:48:48,855 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-17 22:48:48,855 INFO L263 TraceCheckUtils]: 14: Hoare triple {1307#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1307#true} is VALID [2020-07-17 22:48:48,857 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-17 22:48:48,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !!(~i~1 < 5); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-17 22:48:48,858 INFO L280 TraceCheckUtils]: 17: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !(~i~1 > 2); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-17 22:48:48,859 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-17 22:48:48,860 INFO L280 TraceCheckUtils]: 19: Hoare triple {1357#(= 0 rangesum_~cnt~0)} assume !(~i~1 < 5); {1357#(= 0 rangesum_~cnt~0)} is VALID [2020-07-17 22:48:48,860 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-17 22:48:48,861 INFO L280 TraceCheckUtils]: 21: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-17 22:48:48,861 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1308#false} {1307#true} #84#return; {1308#false} is VALID [2020-07-17 22:48:48,861 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-17 22:48:48,861 INFO L263 TraceCheckUtils]: 24: Hoare triple {1308#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1308#false} is VALID [2020-07-17 22:48:48,861 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-17 22:48:48,861 INFO L280 TraceCheckUtils]: 26: Hoare triple {1308#false} assume !!(~i~1 < 5); {1308#false} is VALID [2020-07-17 22:48:48,862 INFO L280 TraceCheckUtils]: 27: Hoare triple {1308#false} assume !(~i~1 > 2); {1308#false} is VALID [2020-07-17 22:48:48,862 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-17 22:48:48,862 INFO L280 TraceCheckUtils]: 29: Hoare triple {1308#false} assume !(~i~1 < 5); {1308#false} is VALID [2020-07-17 22:48:48,862 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-17 22:48:48,863 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-17 22:48:48,863 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1308#false} {1308#false} #86#return; {1308#false} is VALID [2020-07-17 22:48:48,863 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-17 22:48:48,864 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-17 22:48:48,864 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-17 22:48:48,864 INFO L280 TraceCheckUtils]: 36: Hoare triple {1308#false} assume !(~i~2 < 4); {1308#false} is VALID [2020-07-17 22:48:48,864 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-17 22:48:48,865 INFO L263 TraceCheckUtils]: 38: Hoare triple {1308#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1308#false} is VALID [2020-07-17 22:48:48,865 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-17 22:48:48,865 INFO L280 TraceCheckUtils]: 40: Hoare triple {1308#false} assume !!(~i~1 < 5); {1308#false} is VALID [2020-07-17 22:48:48,865 INFO L280 TraceCheckUtils]: 41: Hoare triple {1308#false} assume !(~i~1 > 2); {1308#false} is VALID [2020-07-17 22:48:48,865 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-17 22:48:48,866 INFO L280 TraceCheckUtils]: 43: Hoare triple {1308#false} assume !(~i~1 < 5); {1308#false} is VALID [2020-07-17 22:48:48,866 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-17 22:48:48,866 INFO L280 TraceCheckUtils]: 45: Hoare triple {1308#false} assume true; {1308#false} is VALID [2020-07-17 22:48:48,866 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1308#false} {1308#false} #88#return; {1308#false} is VALID [2020-07-17 22:48:48,867 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-17 22:48:48,867 INFO L280 TraceCheckUtils]: 48: Hoare triple {1308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1308#false} is VALID [2020-07-17 22:48:48,867 INFO L280 TraceCheckUtils]: 49: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2020-07-17 22:48:48,870 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-17 22:48:48,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883712590] [2020-07-17 22:48:48,871 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:48,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543332105] [2020-07-17 22:48:48,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:48,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:48,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159209423] [2020-07-17 22:48:48,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 22:48:48,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:48,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:48,919 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-17 22:48:48,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:48,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:48,921 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2020-07-17 22:48:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,162 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2020-07-17 22:48:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:49,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 22:48:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:48:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-17 22:48:49,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-17 22:48:49,263 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-17 22:48:49,265 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:48:49,265 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:48:49,266 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-17 22:48:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:48:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-17 22:48:49,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:49,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-17 22:48:49,287 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-17 22:48:49,287 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-17 22:48:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,291 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-17 22:48:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-17 22:48:49,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:49,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:49,292 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-17 22:48:49,292 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-17 22:48:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:49,295 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-17 22:48:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-17 22:48:49,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:49,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:49,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:49,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:48:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-17 22:48:49,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 50 [2020-07-17 22:48:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:49,300 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-17 22:48:49,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:48:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:48:49,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:49,301 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-17 22:48:49,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:49,515 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2020-07-17 22:48:49,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:49,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618101293] [2020-07-17 22:48:49,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,598 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-17 22:48:49,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,599 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-17 22:48:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,644 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-17 22:48:49,645 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-17 22:48:49,646 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-17 22:48:49,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-17 22:48:49,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,648 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-17 22:48:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,657 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-17 22:48:49,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-17 22:48:49,658 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-17 22:48:49,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-17 22:48:49,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,660 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1687#true} {1688#false} #84#return; {1688#false} is VALID [2020-07-17 22:48:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,695 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-17 22:48:49,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:49,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:49,699 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-17 22:48:49,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {1727#(<= rangesum_~i~1 1)} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,701 INFO L280 TraceCheckUtils]: 5: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-17 22:48:49,701 INFO L280 TraceCheckUtils]: 6: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,701 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-17 22:48:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,710 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-17 22:48:49,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-17 22:48:49,712 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-17 22:48:49,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-17 22:48:49,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,713 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1687#true} {1688#false} #88#return; {1688#false} is VALID [2020-07-17 22:48:49,714 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-17 22:48:49,714 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-17 22:48:49,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,715 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-17 22:48:49,715 INFO L263 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret12 := main(); {1687#true} is VALID [2020-07-17 22:48:49,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1687#true} is VALID [2020-07-17 22:48:49,717 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-17 22:48:49,718 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-17 22:48:49,719 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-17 22:48:49,720 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-17 22:48:49,721 INFO L280 TraceCheckUtils]: 10: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-17 22:48:49,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,722 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-17 22:48:49,722 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-17 22:48:49,722 INFO L263 TraceCheckUtils]: 14: Hoare triple {1688#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-17 22:48:49,722 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-17 22:48:49,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,723 INFO L280 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-17 22:48:49,723 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-17 22:48:49,723 INFO L280 TraceCheckUtils]: 19: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,724 INFO L280 TraceCheckUtils]: 20: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-17 22:48:49,724 INFO L280 TraceCheckUtils]: 21: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,724 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1687#true} {1688#false} #84#return; {1688#false} is VALID [2020-07-17 22:48:49,724 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-17 22:48:49,725 INFO L263 TraceCheckUtils]: 24: Hoare triple {1688#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-17 22:48:49,726 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-17 22:48:49,726 INFO L280 TraceCheckUtils]: 26: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:49,727 INFO L280 TraceCheckUtils]: 27: Hoare triple {1726#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {1726#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:49,728 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-17 22:48:49,730 INFO L280 TraceCheckUtils]: 29: Hoare triple {1727#(<= rangesum_~i~1 1)} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,730 INFO L280 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-17 22:48:49,730 INFO L280 TraceCheckUtils]: 31: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,731 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-17 22:48:49,731 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-17 22:48:49,731 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-17 22:48:49,731 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-17 22:48:49,732 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~i~2 < 4); {1688#false} is VALID [2020-07-17 22:48:49,732 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-17 22:48:49,732 INFO L263 TraceCheckUtils]: 38: Hoare triple {1688#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-17 22:48:49,733 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-17 22:48:49,733 INFO L280 TraceCheckUtils]: 40: Hoare triple {1687#true} assume !!(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,733 INFO L280 TraceCheckUtils]: 41: Hoare triple {1687#true} assume !(~i~1 > 2); {1687#true} is VALID [2020-07-17 22:48:49,733 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-17 22:48:49,734 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#true} assume !(~i~1 < 5); {1687#true} is VALID [2020-07-17 22:48:49,734 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#true} assume !(0 != ~cnt~0);#res := 0; {1687#true} is VALID [2020-07-17 22:48:49,734 INFO L280 TraceCheckUtils]: 45: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,734 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1687#true} {1688#false} #88#return; {1688#false} is VALID [2020-07-17 22:48:49,735 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-17 22:48:49,735 INFO L280 TraceCheckUtils]: 48: Hoare triple {1688#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1688#false} is VALID [2020-07-17 22:48:49,735 INFO L280 TraceCheckUtils]: 49: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2020-07-17 22:48:49,737 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-17 22:48:49,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618101293] [2020-07-17 22:48:49,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504990080] [2020-07-17 22:48:49,738 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-17 22:48:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:49,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:49,893 INFO L263 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2020-07-17 22:48:49,894 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-17 22:48:49,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2020-07-17 22:48:49,894 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #78#return; {1687#true} is VALID [2020-07-17 22:48:49,894 INFO L263 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret12 := main(); {1687#true} is VALID [2020-07-17 22:48:49,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {1687#true} is VALID [2020-07-17 22:48:49,895 INFO L263 TraceCheckUtils]: 6: Hoare triple {1687#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1687#true} is VALID [2020-07-17 22:48:49,896 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-17 22:48:49,897 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-17 22:48:49,898 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-17 22:48:49,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {1725#(<= init_nondet_~i~0 1)} assume !(~i~0 < 5); {1688#false} is VALID [2020-07-17 22:48:49,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,900 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1688#false} {1687#true} #82#return; {1688#false} is VALID [2020-07-17 22:48:49,900 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-17 22:48:49,900 INFO L263 TraceCheckUtils]: 14: Hoare triple {1688#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-17 22:48:49,900 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-17 22:48:49,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,901 INFO L280 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-17 22:48:49,901 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-17 22:48:49,901 INFO L280 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,901 INFO L280 TraceCheckUtils]: 20: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-17 22:48:49,902 INFO L280 TraceCheckUtils]: 21: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,902 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1688#false} {1688#false} #84#return; {1688#false} is VALID [2020-07-17 22:48:49,902 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-17 22:48:49,902 INFO L263 TraceCheckUtils]: 24: Hoare triple {1688#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-17 22:48:49,903 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-17 22:48:49,903 INFO L280 TraceCheckUtils]: 26: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,903 INFO L280 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-17 22:48:49,903 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-17 22:48:49,903 INFO L280 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,903 INFO L280 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-17 22:48:49,903 INFO L280 TraceCheckUtils]: 31: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,904 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1688#false} {1688#false} #86#return; {1688#false} is VALID [2020-07-17 22:48:49,904 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-17 22:48:49,905 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-17 22:48:49,905 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-17 22:48:49,905 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~i~2 < 4); {1688#false} is VALID [2020-07-17 22:48:49,905 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-17 22:48:49,906 INFO L263 TraceCheckUtils]: 38: Hoare triple {1688#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1688#false} is VALID [2020-07-17 22:48:49,906 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-17 22:48:49,906 INFO L280 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !!(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,906 INFO L280 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !(~i~1 > 2); {1688#false} is VALID [2020-07-17 22:48:49,907 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-17 22:48:49,907 INFO L280 TraceCheckUtils]: 43: Hoare triple {1688#false} assume !(~i~1 < 5); {1688#false} is VALID [2020-07-17 22:48:49,907 INFO L280 TraceCheckUtils]: 44: Hoare triple {1688#false} assume !(0 != ~cnt~0);#res := 0; {1688#false} is VALID [2020-07-17 22:48:49,907 INFO L280 TraceCheckUtils]: 45: Hoare triple {1688#false} assume true; {1688#false} is VALID [2020-07-17 22:48:49,908 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1688#false} {1688#false} #88#return; {1688#false} is VALID [2020-07-17 22:48:49,908 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-17 22:48:49,908 INFO L280 TraceCheckUtils]: 48: Hoare triple {1688#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1688#false} is VALID [2020-07-17 22:48:49,908 INFO L280 TraceCheckUtils]: 49: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2020-07-17 22:48:49,910 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-17 22:48:49,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:49,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 8 [2020-07-17 22:48:49,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838323723] [2020-07-17 22:48:49,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-07-17 22:48:49,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:49,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:48:50,001 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-17 22:48:50,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:48:50,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:48:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:48:50,003 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 8 states. [2020-07-17 22:48:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:51,018 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2020-07-17 22:48:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:48:51,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-07-17 22:48:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:48:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-17 22:48:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:48:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-17 22:48:51,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-17 22:48:51,154 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-17 22:48:51,156 INFO L225 Difference]: With dead ends: 76 [2020-07-17 22:48:51,157 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:48:51,159 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-17 22:48:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:48:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-17 22:48:51,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:51,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-17 22:48:51,205 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-17 22:48:51,205 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-17 22:48:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:51,208 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-17 22:48:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:48:51,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:51,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:51,209 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-17 22:48:51,209 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-17 22:48:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:51,212 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-17 22:48:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:48:51,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:51,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:51,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:51,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:48:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-17 22:48:51,216 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 50 [2020-07-17 22:48:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:51,217 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-17 22:48:51,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:48:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-17 22:48:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-17 22:48:51,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:51,219 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-17 22:48:51,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:51,434 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1369912335, now seen corresponding path program 2 times [2020-07-17 22:48:51,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:51,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29561992] [2020-07-17 22:48:51,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,527 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-17 22:48:51,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,528 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-17 22:48:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,593 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-17 22:48:51,594 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-17 22:48:51,596 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-17 22:48:51,597 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-17 22:48:51,598 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-17 22:48:51,600 INFO L280 TraceCheckUtils]: 5: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-17 22:48:51,600 INFO L280 TraceCheckUtils]: 6: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-17 22:48:51,600 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-17 22:48:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,610 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-17 22:48:51,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,611 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-17 22:48:51,612 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,612 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-17 22:48:51,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,613 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-17 22:48:51,613 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,613 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #84#return; {2153#false} is VALID [2020-07-17 22:48:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,623 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-17 22:48:51,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,624 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-17 22:48:51,624 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,625 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-17 22:48:51,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-17 22:48:51,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,626 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #86#return; {2153#false} is VALID [2020-07-17 22:48:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,635 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-17 22:48:51,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,636 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-17 22:48:51,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,637 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-17 22:48:51,637 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-17 22:48:51,638 INFO L280 TraceCheckUtils]: 9: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,638 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2152#true} {2153#false} #88#return; {2153#false} is VALID [2020-07-17 22:48:51,640 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-17 22:48:51,640 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-17 22:48:51,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,641 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-17 22:48:51,642 INFO L263 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret12 := main(); {2152#true} is VALID [2020-07-17 22:48:51,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2152#true} is VALID [2020-07-17 22:48:51,644 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-17 22:48:51,645 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-17 22:48:51,646 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-17 22:48:51,647 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-17 22:48:51,648 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-17 22:48:51,649 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-17 22:48:51,650 INFO L280 TraceCheckUtils]: 12: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-17 22:48:51,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-17 22:48:51,663 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-17 22:48:51,663 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-17 22:48:51,663 INFO L263 TraceCheckUtils]: 16: Hoare triple {2153#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-17 22:48:51,664 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-17 22:48:51,664 INFO L280 TraceCheckUtils]: 18: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,664 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-17 22:48:51,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,664 INFO L280 TraceCheckUtils]: 22: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,665 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-17 22:48:51,665 INFO L280 TraceCheckUtils]: 24: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,665 INFO L280 TraceCheckUtils]: 25: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-17 22:48:51,665 INFO L280 TraceCheckUtils]: 26: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,665 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2152#true} {2153#false} #84#return; {2153#false} is VALID [2020-07-17 22:48:51,666 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-17 22:48:51,666 INFO L263 TraceCheckUtils]: 29: Hoare triple {2153#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-17 22:48:51,666 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-17 22:48:51,666 INFO L280 TraceCheckUtils]: 31: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,667 INFO L280 TraceCheckUtils]: 32: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,667 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-17 22:48:51,667 INFO L280 TraceCheckUtils]: 34: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,667 INFO L280 TraceCheckUtils]: 35: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,667 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-17 22:48:51,668 INFO L280 TraceCheckUtils]: 37: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,668 INFO L280 TraceCheckUtils]: 38: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-17 22:48:51,668 INFO L280 TraceCheckUtils]: 39: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,668 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2152#true} {2153#false} #86#return; {2153#false} is VALID [2020-07-17 22:48:51,668 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-17 22:48:51,669 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-17 22:48:51,669 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-17 22:48:51,669 INFO L280 TraceCheckUtils]: 44: Hoare triple {2153#false} assume !(~i~2 < 4); {2153#false} is VALID [2020-07-17 22:48:51,669 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-17 22:48:51,669 INFO L263 TraceCheckUtils]: 46: Hoare triple {2153#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-17 22:48:51,670 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-17 22:48:51,670 INFO L280 TraceCheckUtils]: 48: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,670 INFO L280 TraceCheckUtils]: 49: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,670 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-17 22:48:51,671 INFO L280 TraceCheckUtils]: 51: Hoare triple {2152#true} assume !!(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,671 INFO L280 TraceCheckUtils]: 52: Hoare triple {2152#true} assume !(~i~1 > 2); {2152#true} is VALID [2020-07-17 22:48:51,671 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-17 22:48:51,671 INFO L280 TraceCheckUtils]: 54: Hoare triple {2152#true} assume !(~i~1 < 5); {2152#true} is VALID [2020-07-17 22:48:51,671 INFO L280 TraceCheckUtils]: 55: Hoare triple {2152#true} assume !(0 != ~cnt~0);#res := 0; {2152#true} is VALID [2020-07-17 22:48:51,672 INFO L280 TraceCheckUtils]: 56: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,672 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2152#true} {2153#false} #88#return; {2153#false} is VALID [2020-07-17 22:48:51,672 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-17 22:48:51,672 INFO L280 TraceCheckUtils]: 59: Hoare triple {2153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2153#false} is VALID [2020-07-17 22:48:51,673 INFO L280 TraceCheckUtils]: 60: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2020-07-17 22:48:51,675 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-17 22:48:51,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29561992] [2020-07-17 22:48:51,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326005658] [2020-07-17 22:48:51,678 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-17 22:48:51,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:48:51,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:51,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:51,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:51,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {2152#true} call ULTIMATE.init(); {2152#true} is VALID [2020-07-17 22:48:51,827 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-17 22:48:51,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {2152#true} assume true; {2152#true} is VALID [2020-07-17 22:48:51,828 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2152#true} {2152#true} #78#return; {2152#true} is VALID [2020-07-17 22:48:51,828 INFO L263 TraceCheckUtils]: 4: Hoare triple {2152#true} call #t~ret12 := main(); {2152#true} is VALID [2020-07-17 22:48:51,828 INFO L280 TraceCheckUtils]: 5: Hoare triple {2152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2152#true} is VALID [2020-07-17 22:48:51,828 INFO L263 TraceCheckUtils]: 6: Hoare triple {2152#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2152#true} is VALID [2020-07-17 22:48:51,829 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-17 22:48:51,829 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-17 22:48:51,830 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-17 22:48:51,831 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-17 22:48:51,832 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-17 22:48:51,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {2202#(<= init_nondet_~i~0 2)} assume !(~i~0 < 5); {2153#false} is VALID [2020-07-17 22:48:51,833 INFO L280 TraceCheckUtils]: 13: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-17 22:48:51,833 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2153#false} {2152#true} #82#return; {2153#false} is VALID [2020-07-17 22:48:51,833 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-17 22:48:51,833 INFO L263 TraceCheckUtils]: 16: Hoare triple {2153#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-17 22:48:51,834 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-17 22:48:51,834 INFO L280 TraceCheckUtils]: 18: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,834 INFO L280 TraceCheckUtils]: 19: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-17 22:48:51,834 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-17 22:48:51,834 INFO L280 TraceCheckUtils]: 21: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,834 INFO L280 TraceCheckUtils]: 22: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-17 22:48:51,834 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-17 22:48:51,835 INFO L280 TraceCheckUtils]: 24: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,835 INFO L280 TraceCheckUtils]: 25: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-17 22:48:51,835 INFO L280 TraceCheckUtils]: 26: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-17 22:48:51,835 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2153#false} {2153#false} #84#return; {2153#false} is VALID [2020-07-17 22:48:51,836 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-17 22:48:51,836 INFO L263 TraceCheckUtils]: 29: Hoare triple {2153#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-17 22:48:51,836 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-17 22:48:51,836 INFO L280 TraceCheckUtils]: 31: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,836 INFO L280 TraceCheckUtils]: 32: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-17 22:48:51,837 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-17 22:48:51,837 INFO L280 TraceCheckUtils]: 34: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,837 INFO L280 TraceCheckUtils]: 35: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-17 22:48:51,837 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-17 22:48:51,837 INFO L280 TraceCheckUtils]: 37: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,838 INFO L280 TraceCheckUtils]: 38: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-17 22:48:51,838 INFO L280 TraceCheckUtils]: 39: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-17 22:48:51,838 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2153#false} {2153#false} #86#return; {2153#false} is VALID [2020-07-17 22:48:51,838 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-17 22:48:51,838 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-17 22:48:51,839 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-17 22:48:51,839 INFO L280 TraceCheckUtils]: 44: Hoare triple {2153#false} assume !(~i~2 < 4); {2153#false} is VALID [2020-07-17 22:48:51,839 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-17 22:48:51,839 INFO L263 TraceCheckUtils]: 46: Hoare triple {2153#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2153#false} is VALID [2020-07-17 22:48:51,839 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-17 22:48:51,839 INFO L280 TraceCheckUtils]: 48: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,840 INFO L280 TraceCheckUtils]: 49: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-17 22:48:51,840 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-17 22:48:51,840 INFO L280 TraceCheckUtils]: 51: Hoare triple {2153#false} assume !!(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,840 INFO L280 TraceCheckUtils]: 52: Hoare triple {2153#false} assume !(~i~1 > 2); {2153#false} is VALID [2020-07-17 22:48:51,840 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-17 22:48:51,841 INFO L280 TraceCheckUtils]: 54: Hoare triple {2153#false} assume !(~i~1 < 5); {2153#false} is VALID [2020-07-17 22:48:51,841 INFO L280 TraceCheckUtils]: 55: Hoare triple {2153#false} assume !(0 != ~cnt~0);#res := 0; {2153#false} is VALID [2020-07-17 22:48:51,841 INFO L280 TraceCheckUtils]: 56: Hoare triple {2153#false} assume true; {2153#false} is VALID [2020-07-17 22:48:51,841 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2153#false} {2153#false} #88#return; {2153#false} is VALID [2020-07-17 22:48:51,841 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-17 22:48:51,842 INFO L280 TraceCheckUtils]: 59: Hoare triple {2153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2153#false} is VALID [2020-07-17 22:48:51,842 INFO L280 TraceCheckUtils]: 60: Hoare triple {2153#false} assume !false; {2153#false} is VALID [2020-07-17 22:48:51,844 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-17 22:48:51,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:51,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2020-07-17 22:48:51,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783217464] [2020-07-17 22:48:51,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-07-17 22:48:51,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:51,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:48:51,919 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-17 22:48:51,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:48:51,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:48:51,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:48:51,920 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 7 states. [2020-07-17 22:48:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:52,674 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2020-07-17 22:48:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:48:52,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2020-07-17 22:48:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:48:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-17 22:48:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:48:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-17 22:48:52,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2020-07-17 22:48:52,794 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-17 22:48:52,795 INFO L225 Difference]: With dead ends: 80 [2020-07-17 22:48:52,795 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:48:52,796 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-17 22:48:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:48:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-17 22:48:52,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:52,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-17 22:48:52,846 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-17 22:48:52,846 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-17 22:48:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:52,848 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-17 22:48:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-07-17 22:48:52,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:52,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:52,849 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-17 22:48:52,849 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-17 22:48:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:52,852 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-17 22:48:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2020-07-17 22:48:52,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:52,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:52,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:52,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:48:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-17 22:48:52,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 61 [2020-07-17 22:48:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:52,856 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-17 22:48:52,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:48:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:48:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-17 22:48:52,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:52,857 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-17 22:48:53,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:53,062 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash 190779759, now seen corresponding path program 3 times [2020-07-17 22:48:53,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:53,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791357750] [2020-07-17 22:48:53,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,113 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-17 22:48:53,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,114 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-17 22:48:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,184 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-17 22:48:53,185 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-17 22:48:53,187 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-17 22:48:53,188 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-17 22:48:53,189 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-17 22:48:53,190 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-17 22:48:53,191 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-17 22:48:53,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {2722#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2670#false} is VALID [2020-07-17 22:48:53,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-17 22:48:53,193 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2670#false} {2669#true} #82#return; {2670#false} is VALID [2020-07-17 22:48:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,200 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-17 22:48:53,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,201 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-17 22:48:53,201 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,202 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-17 22:48:53,202 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,203 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #84#return; {2670#false} is VALID [2020-07-17 22:48:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,210 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-17 22:48:53,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,211 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-17 22:48:53,212 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,212 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-17 22:48:53,212 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,212 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,213 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,213 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #86#return; {2670#false} is VALID [2020-07-17 22:48:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,220 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-17 22:48:53,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,221 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-17 22:48:53,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,222 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-17 22:48:53,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,222 INFO L280 TraceCheckUtils]: 9: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,222 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2669#true} {2670#false} #88#return; {2670#false} is VALID [2020-07-17 22:48:53,223 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-17 22:48:53,224 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-17 22:48:53,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,224 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-17 22:48:53,224 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret12 := main(); {2669#true} is VALID [2020-07-17 22:48:53,225 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2669#true} is VALID [2020-07-17 22:48:53,226 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-17 22:48:53,227 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-17 22:48:53,227 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-17 22:48:53,229 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-17 22:48:53,230 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-17 22:48:53,231 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-17 22:48:53,232 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-17 22:48:53,233 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-17 22:48:53,234 INFO L280 TraceCheckUtils]: 14: Hoare triple {2722#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {2670#false} is VALID [2020-07-17 22:48:53,235 INFO L280 TraceCheckUtils]: 15: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-17 22:48:53,235 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2670#false} {2669#true} #82#return; {2670#false} is VALID [2020-07-17 22:48:53,235 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-17 22:48:53,235 INFO L263 TraceCheckUtils]: 18: Hoare triple {2670#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,235 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-17 22:48:53,236 INFO L280 TraceCheckUtils]: 20: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,236 INFO L280 TraceCheckUtils]: 21: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,236 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-17 22:48:53,236 INFO L280 TraceCheckUtils]: 23: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,236 INFO L280 TraceCheckUtils]: 24: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,237 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-17 22:48:53,237 INFO L280 TraceCheckUtils]: 26: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,237 INFO L280 TraceCheckUtils]: 27: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,237 INFO L280 TraceCheckUtils]: 28: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,237 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2669#true} {2670#false} #84#return; {2670#false} is VALID [2020-07-17 22:48:53,238 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-17 22:48:53,238 INFO L263 TraceCheckUtils]: 31: Hoare triple {2670#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,238 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-17 22:48:53,238 INFO L280 TraceCheckUtils]: 33: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,238 INFO L280 TraceCheckUtils]: 34: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,239 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-17 22:48:53,239 INFO L280 TraceCheckUtils]: 36: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,239 INFO L280 TraceCheckUtils]: 37: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,239 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-17 22:48:53,239 INFO L280 TraceCheckUtils]: 39: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,240 INFO L280 TraceCheckUtils]: 40: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,240 INFO L280 TraceCheckUtils]: 41: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,240 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2669#true} {2670#false} #86#return; {2670#false} is VALID [2020-07-17 22:48:53,240 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-17 22:48:53,240 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-17 22:48:53,241 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-17 22:48:53,241 INFO L280 TraceCheckUtils]: 46: Hoare triple {2670#false} assume !(~i~2 < 4); {2670#false} is VALID [2020-07-17 22:48:53,241 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-17 22:48:53,241 INFO L263 TraceCheckUtils]: 48: Hoare triple {2670#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,241 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-17 22:48:53,242 INFO L280 TraceCheckUtils]: 50: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,242 INFO L280 TraceCheckUtils]: 51: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,242 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-17 22:48:53,242 INFO L280 TraceCheckUtils]: 53: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,242 INFO L280 TraceCheckUtils]: 54: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,243 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-17 22:48:53,243 INFO L280 TraceCheckUtils]: 56: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,243 INFO L280 TraceCheckUtils]: 57: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,243 INFO L280 TraceCheckUtils]: 58: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,243 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2669#true} {2670#false} #88#return; {2670#false} is VALID [2020-07-17 22:48:53,244 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-17 22:48:53,244 INFO L280 TraceCheckUtils]: 61: Hoare triple {2670#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2670#false} is VALID [2020-07-17 22:48:53,244 INFO L280 TraceCheckUtils]: 62: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2020-07-17 22:48:53,247 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-17 22:48:53,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791357750] [2020-07-17 22:48:53,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844356335] [2020-07-17 22:48:53,248 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-17 22:48:53,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:48:53,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:53,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:53,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:53,417 INFO L263 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2020-07-17 22:48:53,418 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-17 22:48:53,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,418 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #78#return; {2669#true} is VALID [2020-07-17 22:48:53,418 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret12 := main(); {2669#true} is VALID [2020-07-17 22:48:53,418 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {2669#true} is VALID [2020-07-17 22:48:53,418 INFO L263 TraceCheckUtils]: 6: Hoare triple {2669#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,419 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-17 22:48:53,419 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-17 22:48:53,419 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-17 22:48:53,419 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-17 22:48:53,419 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-17 22:48:53,419 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-17 22:48:53,419 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-17 22:48:53,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {2669#true} assume !(~i~0 < 5); {2669#true} is VALID [2020-07-17 22:48:53,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,420 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2669#true} {2669#true} #82#return; {2669#true} is VALID [2020-07-17 22:48:53,420 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-17 22:48:53,420 INFO L263 TraceCheckUtils]: 18: Hoare triple {2669#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,420 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-17 22:48:53,422 INFO L280 TraceCheckUtils]: 20: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,422 INFO L280 TraceCheckUtils]: 21: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,423 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-17 22:48:53,423 INFO L280 TraceCheckUtils]: 23: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,423 INFO L280 TraceCheckUtils]: 24: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,424 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-17 22:48:53,424 INFO L280 TraceCheckUtils]: 26: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,424 INFO L280 TraceCheckUtils]: 27: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,424 INFO L280 TraceCheckUtils]: 28: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,425 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2669#true} {2669#true} #84#return; {2669#true} is VALID [2020-07-17 22:48:53,425 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-17 22:48:53,425 INFO L263 TraceCheckUtils]: 31: Hoare triple {2669#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,425 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-17 22:48:53,425 INFO L280 TraceCheckUtils]: 33: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,426 INFO L280 TraceCheckUtils]: 34: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,426 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-17 22:48:53,426 INFO L280 TraceCheckUtils]: 36: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,426 INFO L280 TraceCheckUtils]: 37: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,427 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-17 22:48:53,427 INFO L280 TraceCheckUtils]: 39: Hoare triple {2669#true} assume !(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,427 INFO L280 TraceCheckUtils]: 40: Hoare triple {2669#true} assume !(0 != ~cnt~0);#res := 0; {2669#true} is VALID [2020-07-17 22:48:53,427 INFO L280 TraceCheckUtils]: 41: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-17 22:48:53,427 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2669#true} {2669#true} #86#return; {2669#true} is VALID [2020-07-17 22:48:53,428 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-17 22:48:53,428 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-17 22:48:53,428 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-17 22:48:53,428 INFO L280 TraceCheckUtils]: 46: Hoare triple {2669#true} assume !(~i~2 < 4); {2669#true} is VALID [2020-07-17 22:48:53,428 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-17 22:48:53,429 INFO L263 TraceCheckUtils]: 48: Hoare triple {2669#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2669#true} is VALID [2020-07-17 22:48:53,429 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-17 22:48:53,429 INFO L280 TraceCheckUtils]: 50: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,429 INFO L280 TraceCheckUtils]: 51: Hoare triple {2669#true} assume !(~i~1 > 2); {2669#true} is VALID [2020-07-17 22:48:53,429 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-17 22:48:53,430 INFO L280 TraceCheckUtils]: 53: Hoare triple {2669#true} assume !!(~i~1 < 5); {2669#true} is VALID [2020-07-17 22:48:53,442 INFO L280 TraceCheckUtils]: 54: Hoare triple {2669#true} assume !(~i~1 > 2); {2888#(<= rangesum_~i~1 2)} is VALID [2020-07-17 22:48:53,447 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-17 22:48:53,453 INFO L280 TraceCheckUtils]: 56: Hoare triple {2892#(<= rangesum_~i~1 3)} assume !(~i~1 < 5); {2670#false} is VALID [2020-07-17 22:48:53,453 INFO L280 TraceCheckUtils]: 57: Hoare triple {2670#false} assume !(0 != ~cnt~0);#res := 0; {2670#false} is VALID [2020-07-17 22:48:53,453 INFO L280 TraceCheckUtils]: 58: Hoare triple {2670#false} assume true; {2670#false} is VALID [2020-07-17 22:48:53,453 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2670#false} {2669#true} #88#return; {2670#false} is VALID [2020-07-17 22:48:53,453 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-17 22:48:53,453 INFO L280 TraceCheckUtils]: 61: Hoare triple {2670#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2670#false} is VALID [2020-07-17 22:48:53,454 INFO L280 TraceCheckUtils]: 62: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2020-07-17 22:48:53,455 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-17 22:48:53,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:53,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2020-07-17 22:48:53,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056912767] [2020-07-17 22:48:53,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-07-17 22:48:53,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:53,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:48:53,504 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-17 22:48:53,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:48:53,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:48:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:48:53,505 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2020-07-17 22:48:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,677 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-17 22:48:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:48:53,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-07-17 22:48:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-17 22:48:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-17 22:48:53,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2020-07-17 22:48:53,784 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-17 22:48:53,786 INFO L225 Difference]: With dead ends: 78 [2020-07-17 22:48:53,787 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:48:53,788 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-17 22:48:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:48:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-07-17 22:48:53,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:53,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 45 states. [2020-07-17 22:48:53,822 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 45 states. [2020-07-17 22:48:53,822 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 45 states. [2020-07-17 22:48:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,826 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-17 22:48:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-17 22:48:53,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:53,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:53,827 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 50 states. [2020-07-17 22:48:53,827 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 50 states. [2020-07-17 22:48:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:53,829 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-17 22:48:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-07-17 22:48:53,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:53,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:53,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:53,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:48:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-07-17 22:48:53,832 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 63 [2020-07-17 22:48:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:53,832 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-07-17 22:48:53,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:48:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-07-17 22:48:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 22:48:53,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:53,833 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-17 22:48:54,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-17 22:48:54,037 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1896448358, now seen corresponding path program 1 times [2020-07-17 22:48:54,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:54,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456986030] [2020-07-17 22:48:54,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,109 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-17 22:48:54,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {3186#true} assume true; {3186#true} is VALID [2020-07-17 22:48:54,110 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3186#true} {3186#true} #78#return; {3186#true} is VALID [2020-07-17 22:48:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,195 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-17 22:48:54,197 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-17 22:48:54,198 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-17 22:48:54,198 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-17 22:48:54,199 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-17 22:48:54,200 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-17 22:48:54,200 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-17 22:48:54,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {3248#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {3187#false} is VALID [2020-07-17 22:48:54,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-17 22:48:54,201 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3187#false} {3186#true} #82#return; {3187#false} is VALID [2020-07-17 22:48:54,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456986030] [2020-07-17 22:48:54,205 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-17 22:48:54,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583669024] [2020-07-17 22:48:54,206 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-17 22:48:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:48:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:54,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:54,394 INFO L263 TraceCheckUtils]: 0: Hoare triple {3186#true} call ULTIMATE.init(); {3186#true} is VALID [2020-07-17 22:48:54,395 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-17 22:48:54,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {3186#true} assume true; {3186#true} is VALID [2020-07-17 22:48:54,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3186#true} {3186#true} #78#return; {3186#true} is VALID [2020-07-17 22:48:54,396 INFO L263 TraceCheckUtils]: 4: Hoare triple {3186#true} call #t~ret12 := main(); {3186#true} is VALID [2020-07-17 22:48:54,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {3186#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {3186#true} is VALID [2020-07-17 22:48:54,396 INFO L263 TraceCheckUtils]: 6: Hoare triple {3186#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3186#true} is VALID [2020-07-17 22:48:54,397 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-17 22:48:54,398 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-17 22:48:54,399 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-17 22:48:54,400 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-17 22:48:54,401 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-17 22:48:54,402 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-17 22:48:54,403 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-17 22:48:54,404 INFO L280 TraceCheckUtils]: 14: Hoare triple {3248#(<= init_nondet_~i~0 3)} assume !(~i~0 < 5); {3187#false} is VALID [2020-07-17 22:48:54,404 INFO L280 TraceCheckUtils]: 15: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-17 22:48:54,405 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3187#false} {3186#true} #82#return; {3187#false} is VALID [2020-07-17 22:48:54,405 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-17 22:48:54,405 INFO L263 TraceCheckUtils]: 18: Hoare triple {3187#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-17 22:48:54,405 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-17 22:48:54,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,406 INFO L280 TraceCheckUtils]: 21: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-17 22:48:54,406 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-17 22:48:54,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,406 INFO L280 TraceCheckUtils]: 24: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-17 22:48:54,406 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-17 22:48:54,407 INFO L280 TraceCheckUtils]: 26: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,407 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-17 22:48:54,407 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-17 22:48:54,407 INFO L280 TraceCheckUtils]: 29: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,408 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-17 22:48:54,408 INFO L280 TraceCheckUtils]: 31: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-17 22:48:54,408 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3187#false} {3187#false} #84#return; {3187#false} is VALID [2020-07-17 22:48:54,409 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-17 22:48:54,409 INFO L263 TraceCheckUtils]: 34: Hoare triple {3187#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-17 22:48:54,409 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-17 22:48:54,409 INFO L280 TraceCheckUtils]: 36: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,409 INFO L280 TraceCheckUtils]: 37: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-17 22:48:54,410 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-17 22:48:54,410 INFO L280 TraceCheckUtils]: 39: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,410 INFO L280 TraceCheckUtils]: 40: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-17 22:48:54,410 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-17 22:48:54,410 INFO L280 TraceCheckUtils]: 42: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,411 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-17 22:48:54,411 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-17 22:48:54,411 INFO L280 TraceCheckUtils]: 45: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,411 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-17 22:48:54,411 INFO L280 TraceCheckUtils]: 47: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-17 22:48:54,412 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3187#false} {3187#false} #86#return; {3187#false} is VALID [2020-07-17 22:48:54,412 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-17 22:48:54,412 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-17 22:48:54,412 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-17 22:48:54,412 INFO L280 TraceCheckUtils]: 52: Hoare triple {3187#false} assume !(~i~2 < 4); {3187#false} is VALID [2020-07-17 22:48:54,413 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-17 22:48:54,413 INFO L263 TraceCheckUtils]: 54: Hoare triple {3187#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3187#false} is VALID [2020-07-17 22:48:54,413 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-17 22:48:54,413 INFO L280 TraceCheckUtils]: 56: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,413 INFO L280 TraceCheckUtils]: 57: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-17 22:48:54,414 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-17 22:48:54,414 INFO L280 TraceCheckUtils]: 59: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,414 INFO L280 TraceCheckUtils]: 60: Hoare triple {3187#false} assume !(~i~1 > 2); {3187#false} is VALID [2020-07-17 22:48:54,414 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-17 22:48:54,414 INFO L280 TraceCheckUtils]: 62: Hoare triple {3187#false} assume !!(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,414 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-17 22:48:54,415 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-17 22:48:54,415 INFO L280 TraceCheckUtils]: 65: Hoare triple {3187#false} assume !(~i~1 < 5); {3187#false} is VALID [2020-07-17 22:48:54,415 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-17 22:48:54,415 INFO L280 TraceCheckUtils]: 67: Hoare triple {3187#false} assume true; {3187#false} is VALID [2020-07-17 22:48:54,416 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3187#false} {3187#false} #88#return; {3187#false} is VALID [2020-07-17 22:48:54,416 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-17 22:48:54,416 INFO L280 TraceCheckUtils]: 70: Hoare triple {3187#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3187#false} is VALID [2020-07-17 22:48:54,416 INFO L280 TraceCheckUtils]: 71: Hoare triple {3187#false} assume !false; {3187#false} is VALID [2020-07-17 22:48:54,419 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-17 22:48:54,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:54,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:48:54,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597060021] [2020-07-17 22:48:54,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-07-17 22:48:54,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:54,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:48:54,469 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-17 22:48:54,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:48:54,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:54,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:48:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:48:54,471 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2020-07-17 22:48:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:54,608 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2020-07-17 22:48:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:48:54,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-07-17 22:48:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:48:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-17 22:48:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:48:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-17 22:48:54,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-17 22:48:54,715 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-17 22:48:54,719 INFO L225 Difference]: With dead ends: 78 [2020-07-17 22:48:54,719 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:48:54,720 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-17 22:48:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:48:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-17 22:48:54,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:54,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-17 22:48:54,758 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-17 22:48:54,758 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-17 22:48:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:54,761 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-17 22:48:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-17 22:48:54,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:54,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:54,762 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-17 22:48:54,762 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-17 22:48:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:54,764 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-17 22:48:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-17 22:48:54,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:54,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:54,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:54,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:48:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-17 22:48:54,768 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 72 [2020-07-17 22:48:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:54,768 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-17 22:48:54,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:48:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-17 22:48:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-17 22:48:54,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:54,769 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-17 22:48:54,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:54,983 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2135261480, now seen corresponding path program 2 times [2020-07-17 22:48:54,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:54,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028376055] [2020-07-17 22:48:54,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,066 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-17 22:48:55,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {3737#true} assume true; {3737#true} is VALID [2020-07-17 22:48:55,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3737#true} {3737#true} #78#return; {3737#true} is VALID [2020-07-17 22:48:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,177 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-17 22:48:55,178 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-17 22:48:55,179 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-17 22:48:55,180 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-17 22:48:55,181 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-17 22:48:55,181 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-17 22:48:55,182 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-17 22:48:55,183 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-17 22:48:55,184 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-17 22:48:55,185 INFO L280 TraceCheckUtils]: 9: Hoare triple {3802#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {3738#false} is VALID [2020-07-17 22:48:55,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-17 22:48:55,186 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3738#false} {3737#true} #82#return; {3738#false} is VALID [2020-07-17 22:48:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,242 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-17 22:48:55,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {3803#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:55,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {3803#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {3803#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:55,245 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-17 22:48:55,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {3804#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-17 22:48:55,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {3804#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {3804#(<= rangesum_~i~1 1)} is VALID [2020-07-17 22:48:55,247 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-17 22:48:55,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {3805#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {3805#(<= rangesum_~i~1 2)} is VALID [2020-07-17 22:48:55,249 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-17 22:48:55,249 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-17 22:48:55,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,250 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-17 22:48:55,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-17 22:48:55,250 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3738#false} {3738#false} #84#return; {3738#false} is VALID [2020-07-17 22:48:55,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028376055] [2020-07-17 22:48:55,254 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2020-07-17 22:48:55,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862311144] [2020-07-17 22:48:55,254 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-17 22:48:55,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:48:55,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:55,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:48:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:55,447 INFO L263 TraceCheckUtils]: 0: Hoare triple {3737#true} call ULTIMATE.init(); {3737#true} is VALID [2020-07-17 22:48:55,448 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-17 22:48:55,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {3737#true} assume true; {3737#true} is VALID [2020-07-17 22:48:55,449 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3737#true} {3737#true} #78#return; {3737#true} is VALID [2020-07-17 22:48:55,449 INFO L263 TraceCheckUtils]: 4: Hoare triple {3737#true} call #t~ret12 := main(); {3737#true} is VALID [2020-07-17 22:48:55,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {3737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {3737#true} is VALID [2020-07-17 22:48:55,449 INFO L263 TraceCheckUtils]: 6: Hoare triple {3737#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3737#true} is VALID [2020-07-17 22:48:55,450 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-17 22:48:55,450 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-17 22:48:55,451 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-17 22:48:55,452 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-17 22:48:55,452 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-17 22:48:55,453 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-17 22:48:55,453 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-17 22:48:55,457 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-17 22:48:55,459 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-17 22:48:55,460 INFO L280 TraceCheckUtils]: 16: Hoare triple {3802#(<= init_nondet_~i~0 4)} assume !(~i~0 < 5); {3738#false} is VALID [2020-07-17 22:48:55,460 INFO L280 TraceCheckUtils]: 17: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-17 22:48:55,460 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3738#false} {3737#true} #82#return; {3738#false} is VALID [2020-07-17 22:48:55,461 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-17 22:48:55,461 INFO L263 TraceCheckUtils]: 20: Hoare triple {3738#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-17 22:48:55,461 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-17 22:48:55,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-17 22:48:55,462 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-17 22:48:55,462 INFO L280 TraceCheckUtils]: 25: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,462 INFO L280 TraceCheckUtils]: 26: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-17 22:48:55,462 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-17 22:48:55,462 INFO L280 TraceCheckUtils]: 28: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,462 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-17 22:48:55,463 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-17 22:48:55,463 INFO L280 TraceCheckUtils]: 31: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,463 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-17 22:48:55,463 INFO L280 TraceCheckUtils]: 33: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-17 22:48:55,464 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3738#false} {3738#false} #84#return; {3738#false} is VALID [2020-07-17 22:48:55,464 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-17 22:48:55,464 INFO L263 TraceCheckUtils]: 36: Hoare triple {3738#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-17 22:48:55,464 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-17 22:48:55,464 INFO L280 TraceCheckUtils]: 38: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,465 INFO L280 TraceCheckUtils]: 39: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-17 22:48:55,465 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-17 22:48:55,465 INFO L280 TraceCheckUtils]: 41: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,465 INFO L280 TraceCheckUtils]: 42: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-17 22:48:55,465 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-17 22:48:55,466 INFO L280 TraceCheckUtils]: 44: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,466 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-17 22:48:55,466 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-17 22:48:55,466 INFO L280 TraceCheckUtils]: 47: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,466 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-17 22:48:55,466 INFO L280 TraceCheckUtils]: 49: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-17 22:48:55,467 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3738#false} {3738#false} #86#return; {3738#false} is VALID [2020-07-17 22:48:55,467 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-17 22:48:55,467 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-17 22:48:55,467 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-17 22:48:55,468 INFO L280 TraceCheckUtils]: 54: Hoare triple {3738#false} assume !(~i~2 < 4); {3738#false} is VALID [2020-07-17 22:48:55,468 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-17 22:48:55,468 INFO L263 TraceCheckUtils]: 56: Hoare triple {3738#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3738#false} is VALID [2020-07-17 22:48:55,468 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-17 22:48:55,469 INFO L280 TraceCheckUtils]: 58: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,469 INFO L280 TraceCheckUtils]: 59: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-17 22:48:55,469 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-17 22:48:55,469 INFO L280 TraceCheckUtils]: 61: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,469 INFO L280 TraceCheckUtils]: 62: Hoare triple {3738#false} assume !(~i~1 > 2); {3738#false} is VALID [2020-07-17 22:48:55,470 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-17 22:48:55,470 INFO L280 TraceCheckUtils]: 64: Hoare triple {3738#false} assume !!(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,470 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-17 22:48:55,470 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-17 22:48:55,471 INFO L280 TraceCheckUtils]: 67: Hoare triple {3738#false} assume !(~i~1 < 5); {3738#false} is VALID [2020-07-17 22:48:55,471 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-17 22:48:55,471 INFO L280 TraceCheckUtils]: 69: Hoare triple {3738#false} assume true; {3738#false} is VALID [2020-07-17 22:48:55,471 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {3738#false} {3738#false} #88#return; {3738#false} is VALID [2020-07-17 22:48:55,471 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-17 22:48:55,472 INFO L280 TraceCheckUtils]: 72: Hoare triple {3738#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3738#false} is VALID [2020-07-17 22:48:55,472 INFO L280 TraceCheckUtils]: 73: Hoare triple {3738#false} assume !false; {3738#false} is VALID [2020-07-17 22:48:55,487 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-17 22:48:55,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:55,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:48:55,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089070327] [2020-07-17 22:48:55,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-07-17 22:48:55,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:55,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:48:55,545 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-17 22:48:55,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:48:55,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:55,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:48:55,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:48:55,547 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2020-07-17 22:48:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:55,831 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2020-07-17 22:48:55,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:48:55,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-07-17 22:48:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:48:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-17 22:48:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:48:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-17 22:48:55,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-17 22:48:55,930 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-17 22:48:55,932 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:48:55,932 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:48:55,933 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-17 22:48:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:48:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-17 22:48:55,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:55,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:55,977 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:55,977 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:55,979 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-17 22:48:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-17 22:48:55,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:55,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:55,980 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:55,981 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-17 22:48:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:55,982 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-17 22:48:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-17 22:48:55,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:55,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:55,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:55,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-17 22:48:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-07-17 22:48:55,986 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 74 [2020-07-17 22:48:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:55,986 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-07-17 22:48:55,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:48:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-17 22:48:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-17 22:48:55,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:55,987 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-17 22:48:56,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:56,201 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash -293562262, now seen corresponding path program 3 times [2020-07-17 22:48:56,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:56,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698386716] [2020-07-17 22:48:56,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:56,216 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:56,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783194503] [2020-07-17 22:48:56,217 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-17 22:48:56,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:48:56,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:56,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:48:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:56,471 INFO L263 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2020-07-17 22:48:56,471 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-17 22:48:56,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-17 22:48:56,472 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #78#return; {4307#true} is VALID [2020-07-17 22:48:56,472 INFO L263 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret12 := main(); {4307#true} is VALID [2020-07-17 22:48:56,472 INFO L280 TraceCheckUtils]: 5: Hoare triple {4307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {4307#true} is VALID [2020-07-17 22:48:56,472 INFO L263 TraceCheckUtils]: 6: Hoare triple {4307#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-17 22:48:56,472 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-17 22:48:56,473 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-17 22:48:56,473 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-17 22:48:56,473 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-17 22:48:56,473 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-17 22:48:56,473 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-17 22:48:56,473 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-17 22:48:56,474 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-17 22:48:56,474 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-17 22:48:56,474 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-17 22:48:56,474 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-17 22:48:56,474 INFO L280 TraceCheckUtils]: 18: Hoare triple {4307#true} assume !(~i~0 < 5); {4307#true} is VALID [2020-07-17 22:48:56,475 INFO L280 TraceCheckUtils]: 19: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-17 22:48:56,475 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4307#true} {4307#true} #82#return; {4307#true} is VALID [2020-07-17 22:48:56,475 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-17 22:48:56,475 INFO L263 TraceCheckUtils]: 22: Hoare triple {4307#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-17 22:48:56,475 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-17 22:48:56,475 INFO L280 TraceCheckUtils]: 24: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,476 INFO L280 TraceCheckUtils]: 25: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-17 22:48:56,476 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-17 22:48:56,476 INFO L280 TraceCheckUtils]: 27: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,476 INFO L280 TraceCheckUtils]: 28: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-17 22:48:56,476 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-17 22:48:56,477 INFO L280 TraceCheckUtils]: 30: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,477 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-17 22:48:56,477 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-17 22:48:56,477 INFO L280 TraceCheckUtils]: 33: Hoare triple {4307#true} assume !(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,477 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-17 22:48:56,478 INFO L280 TraceCheckUtils]: 35: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-17 22:48:56,478 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4307#true} {4307#true} #84#return; {4307#true} is VALID [2020-07-17 22:48:56,478 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-17 22:48:56,478 INFO L263 TraceCheckUtils]: 38: Hoare triple {4307#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4307#true} is VALID [2020-07-17 22:48:56,479 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-17 22:48:56,479 INFO L280 TraceCheckUtils]: 40: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,479 INFO L280 TraceCheckUtils]: 41: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-17 22:48:56,479 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-17 22:48:56,479 INFO L280 TraceCheckUtils]: 43: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,480 INFO L280 TraceCheckUtils]: 44: Hoare triple {4307#true} assume !(~i~1 > 2); {4307#true} is VALID [2020-07-17 22:48:56,480 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-17 22:48:56,480 INFO L280 TraceCheckUtils]: 46: Hoare triple {4307#true} assume !!(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,480 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-17 22:48:56,481 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-17 22:48:56,481 INFO L280 TraceCheckUtils]: 49: Hoare triple {4307#true} assume !(~i~1 < 5); {4307#true} is VALID [2020-07-17 22:48:56,481 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-17 22:48:56,481 INFO L280 TraceCheckUtils]: 51: Hoare triple {4307#true} assume true; {4307#true} is VALID [2020-07-17 22:48:56,481 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4307#true} {4307#true} #86#return; {4307#true} is VALID [2020-07-17 22:48:56,482 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-17 22:48:56,483 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-17 22:48:56,484 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-17 22:48:56,485 INFO L280 TraceCheckUtils]: 56: Hoare triple {4478#(<= main_~i~2 1)} assume !(~i~2 < 4); {4308#false} is VALID [2020-07-17 22:48:56,485 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-17 22:48:56,486 INFO L263 TraceCheckUtils]: 58: Hoare triple {4308#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4308#false} is VALID [2020-07-17 22:48:56,486 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-17 22:48:56,486 INFO L280 TraceCheckUtils]: 60: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-17 22:48:56,487 INFO L280 TraceCheckUtils]: 61: Hoare triple {4308#false} assume !(~i~1 > 2); {4308#false} is VALID [2020-07-17 22:48:56,487 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-17 22:48:56,487 INFO L280 TraceCheckUtils]: 63: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-17 22:48:56,487 INFO L280 TraceCheckUtils]: 64: Hoare triple {4308#false} assume !(~i~1 > 2); {4308#false} is VALID [2020-07-17 22:48:56,488 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-17 22:48:56,488 INFO L280 TraceCheckUtils]: 66: Hoare triple {4308#false} assume !!(~i~1 < 5); {4308#false} is VALID [2020-07-17 22:48:56,488 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-17 22:48:56,488 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-17 22:48:56,488 INFO L280 TraceCheckUtils]: 69: Hoare triple {4308#false} assume !(~i~1 < 5); {4308#false} is VALID [2020-07-17 22:48:56,489 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-17 22:48:56,489 INFO L280 TraceCheckUtils]: 71: Hoare triple {4308#false} assume true; {4308#false} is VALID [2020-07-17 22:48:56,489 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {4308#false} {4308#false} #88#return; {4308#false} is VALID [2020-07-17 22:48:56,489 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-17 22:48:56,489 INFO L280 TraceCheckUtils]: 74: Hoare triple {4308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4308#false} is VALID [2020-07-17 22:48:56,490 INFO L280 TraceCheckUtils]: 75: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2020-07-17 22:48:56,495 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-17 22:48:56,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698386716] [2020-07-17 22:48:56,495 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:56,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783194503] [2020-07-17 22:48:56,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:56,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-17 22:48:56,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871768670] [2020-07-17 22:48:56,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-07-17 22:48:56,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:56,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:48:56,561 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-17 22:48:56,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:48:56,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:48:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:48:56,563 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2020-07-17 22:48:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,879 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-07-17 22:48:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:48:56,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-07-17 22:48:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-17 22:48:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:48:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-17 22:48:56,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2020-07-17 22:48:56,948 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-17 22:48:56,951 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:48:56,951 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:48:56,952 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-17 22:48:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:48:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-17 22:48:56,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:56,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-17 22:48:56,989 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-17 22:48:56,989 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-17 22:48:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,992 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-17 22:48:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-17 22:48:56,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,993 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-17 22:48:56,993 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-17 22:48:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,995 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-17 22:48:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-17 22:48:56,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:56,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:48:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-07-17 22:48:56,997 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 76 [2020-07-17 22:48:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:56,998 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-07-17 22:48:56,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:48:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-07-17 22:48:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-17 22:48:56,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:56,999 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-17 22:48:57,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-17 22:48:57,201 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash 704023820, now seen corresponding path program 4 times [2020-07-17 22:48:57,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:57,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687263412] [2020-07-17 22:48:57,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:57,217 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:57,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664397870] [2020-07-17 22:48:57,217 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-17 22:48:57,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:48:57,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:57,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:57,405 INFO L263 TraceCheckUtils]: 0: Hoare triple {4817#true} call ULTIMATE.init(); {4817#true} is VALID [2020-07-17 22:48:57,406 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-17 22:48:57,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {4817#true} assume true; {4817#true} is VALID [2020-07-17 22:48:57,406 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4817#true} {4817#true} #78#return; {4817#true} is VALID [2020-07-17 22:48:57,406 INFO L263 TraceCheckUtils]: 4: Hoare triple {4817#true} call #t~ret12 := main(); {4817#true} is VALID [2020-07-17 22:48:57,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {4817#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {4817#true} is VALID [2020-07-17 22:48:57,407 INFO L263 TraceCheckUtils]: 6: Hoare triple {4817#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4817#true} is VALID [2020-07-17 22:48:57,407 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-17 22:48:57,407 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-17 22:48:57,407 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-17 22:48:57,407 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-17 22:48:57,408 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-17 22:48:57,408 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-17 22:48:57,408 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-17 22:48:57,408 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-17 22:48:57,408 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-17 22:48:57,408 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-17 22:48:57,408 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-17 22:48:57,408 INFO L280 TraceCheckUtils]: 18: Hoare triple {4817#true} assume !(~i~0 < 5); {4817#true} is VALID [2020-07-17 22:48:57,409 INFO L280 TraceCheckUtils]: 19: Hoare triple {4817#true} assume true; {4817#true} is VALID [2020-07-17 22:48:57,409 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4817#true} {4817#true} #82#return; {4817#true} is VALID [2020-07-17 22:48:57,409 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-17 22:48:57,409 INFO L263 TraceCheckUtils]: 22: Hoare triple {4817#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4817#true} is VALID [2020-07-17 22:48:57,410 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-17 22:48:57,410 INFO L280 TraceCheckUtils]: 24: Hoare triple {4891#(<= rangesum_~i~1 0)} assume !!(~i~1 < 5); {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:57,411 INFO L280 TraceCheckUtils]: 25: Hoare triple {4891#(<= rangesum_~i~1 0)} assume !(~i~1 > 2); {4891#(<= rangesum_~i~1 0)} is VALID [2020-07-17 22:48:57,411 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-17 22:48:57,412 INFO L280 TraceCheckUtils]: 27: Hoare triple {4901#(<= rangesum_~i~1 1)} assume !!(~i~1 < 5); {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-17 22:48:57,412 INFO L280 TraceCheckUtils]: 28: Hoare triple {4901#(<= rangesum_~i~1 1)} assume !(~i~1 > 2); {4901#(<= rangesum_~i~1 1)} is VALID [2020-07-17 22:48:57,413 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-17 22:48:57,413 INFO L280 TraceCheckUtils]: 30: Hoare triple {4911#(<= rangesum_~i~1 2)} assume !!(~i~1 < 5); {4911#(<= rangesum_~i~1 2)} is VALID [2020-07-17 22:48:57,414 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-17 22:48:57,414 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-17 22:48:57,414 INFO L280 TraceCheckUtils]: 33: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,414 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-17 22:48:57,414 INFO L280 TraceCheckUtils]: 35: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-17 22:48:57,414 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4818#false} {4817#true} #84#return; {4818#false} is VALID [2020-07-17 22:48:57,414 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-17 22:48:57,415 INFO L263 TraceCheckUtils]: 38: Hoare triple {4818#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4818#false} is VALID [2020-07-17 22:48:57,415 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-17 22:48:57,415 INFO L280 TraceCheckUtils]: 40: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,415 INFO L280 TraceCheckUtils]: 41: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-17 22:48:57,415 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-17 22:48:57,415 INFO L280 TraceCheckUtils]: 43: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,415 INFO L280 TraceCheckUtils]: 44: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-17 22:48:57,415 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-17 22:48:57,416 INFO L280 TraceCheckUtils]: 46: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,416 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-17 22:48:57,416 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-17 22:48:57,416 INFO L280 TraceCheckUtils]: 49: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,416 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-17 22:48:57,416 INFO L280 TraceCheckUtils]: 51: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-17 22:48:57,416 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4818#false} {4818#false} #86#return; {4818#false} is VALID [2020-07-17 22:48:57,416 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-17 22:48:57,417 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-17 22:48:57,417 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-17 22:48:57,417 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-17 22:48:57,417 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-17 22:48:57,417 INFO L280 TraceCheckUtils]: 58: Hoare triple {4818#false} assume !(~i~2 < 4); {4818#false} is VALID [2020-07-17 22:48:57,417 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-17 22:48:57,417 INFO L263 TraceCheckUtils]: 60: Hoare triple {4818#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4818#false} is VALID [2020-07-17 22:48:57,417 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-17 22:48:57,418 INFO L280 TraceCheckUtils]: 62: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,418 INFO L280 TraceCheckUtils]: 63: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-17 22:48:57,418 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-17 22:48:57,418 INFO L280 TraceCheckUtils]: 65: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,418 INFO L280 TraceCheckUtils]: 66: Hoare triple {4818#false} assume !(~i~1 > 2); {4818#false} is VALID [2020-07-17 22:48:57,418 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-17 22:48:57,418 INFO L280 TraceCheckUtils]: 68: Hoare triple {4818#false} assume !!(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,418 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-17 22:48:57,419 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-17 22:48:57,419 INFO L280 TraceCheckUtils]: 71: Hoare triple {4818#false} assume !(~i~1 < 5); {4818#false} is VALID [2020-07-17 22:48:57,419 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-17 22:48:57,419 INFO L280 TraceCheckUtils]: 73: Hoare triple {4818#false} assume true; {4818#false} is VALID [2020-07-17 22:48:57,419 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {4818#false} {4818#false} #88#return; {4818#false} is VALID [2020-07-17 22:48:57,419 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-17 22:48:57,419 INFO L280 TraceCheckUtils]: 76: Hoare triple {4818#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4818#false} is VALID [2020-07-17 22:48:57,419 INFO L280 TraceCheckUtils]: 77: Hoare triple {4818#false} assume !false; {4818#false} is VALID [2020-07-17 22:48:57,423 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-17 22:48:57,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687263412] [2020-07-17 22:48:57,423 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:57,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664397870] [2020-07-17 22:48:57,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:57,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-17 22:48:57,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983471049] [2020-07-17 22:48:57,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-07-17 22:48:57,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:57,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:48:57,482 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-17 22:48:57,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:48:57,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:57,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:48:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:57,483 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2020-07-17 22:48:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,687 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2020-07-17 22:48:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:48:57,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2020-07-17 22:48:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-17 22:48:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-17 22:48:57,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2020-07-17 22:48:57,791 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-17 22:48:57,793 INFO L225 Difference]: With dead ends: 82 [2020-07-17 22:48:57,793 INFO L226 Difference]: Without dead ends: 54 [2020-07-17 22:48:57,794 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-17 22:48:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-17 22:48:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-17 22:48:57,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:57,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-17 22:48:57,846 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-17 22:48:57,847 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-17 22:48:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,849 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-17 22:48:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-17 22:48:57,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:57,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:57,850 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-17 22:48:57,850 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-17 22:48:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,853 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-17 22:48:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-17 22:48:57,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:57,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:57,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:57,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 22:48:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-17 22:48:57,858 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 78 [2020-07-17 22:48:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:57,858 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-17 22:48:57,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:48:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-17 22:48:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-17 22:48:57,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:57,860 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-17 22:48:58,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:58,074 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash -40278520, now seen corresponding path program 5 times [2020-07-17 22:48:58,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:58,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379190706] [2020-07-17 22:48:58,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:58,088 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:58,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319403193] [2020-07-17 22:48:58,089 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-17 22:48:58,126 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:48:58,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:58,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:58,242 INFO L263 TraceCheckUtils]: 0: Hoare triple {5357#true} call ULTIMATE.init(); {5357#true} is VALID [2020-07-17 22:48:58,243 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-17 22:48:58,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {5357#true} assume true; {5357#true} is VALID [2020-07-17 22:48:58,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5357#true} {5357#true} #78#return; {5357#true} is VALID [2020-07-17 22:48:58,243 INFO L263 TraceCheckUtils]: 4: Hoare triple {5357#true} call #t~ret12 := main(); {5357#true} is VALID [2020-07-17 22:48:58,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {5357#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {5357#true} is VALID [2020-07-17 22:48:58,243 INFO L263 TraceCheckUtils]: 6: Hoare triple {5357#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5357#true} is VALID [2020-07-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,244 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-17 22:48:58,245 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-17 22:48:58,245 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-17 22:48:58,245 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-17 22:48:58,245 INFO L280 TraceCheckUtils]: 18: Hoare triple {5357#true} assume !(~i~0 < 5); {5357#true} is VALID [2020-07-17 22:48:58,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {5357#true} assume true; {5357#true} is VALID [2020-07-17 22:48:58,245 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5357#true} {5357#true} #82#return; {5357#true} is VALID [2020-07-17 22:48:58,245 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-17 22:48:58,245 INFO L263 TraceCheckUtils]: 22: Hoare triple {5357#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5357#true} is VALID [2020-07-17 22:48:58,246 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-17 22:48:58,246 INFO L280 TraceCheckUtils]: 24: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-17 22:48:58,246 INFO L280 TraceCheckUtils]: 25: Hoare triple {5357#true} assume !(~i~1 > 2); {5357#true} is VALID [2020-07-17 22:48:58,246 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-17 22:48:58,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-17 22:48:58,246 INFO L280 TraceCheckUtils]: 28: Hoare triple {5357#true} assume !(~i~1 > 2); {5357#true} is VALID [2020-07-17 22:48:58,246 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-17 22:48:58,246 INFO L280 TraceCheckUtils]: 30: Hoare triple {5357#true} assume !!(~i~1 < 5); {5357#true} is VALID [2020-07-17 22:48:58,247 INFO L280 TraceCheckUtils]: 31: Hoare triple {5357#true} assume !(~i~1 > 2); {5455#(<= rangesum_~i~1 2)} is VALID [2020-07-17 22:48:58,248 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-17 22:48:58,248 INFO L280 TraceCheckUtils]: 33: Hoare triple {5459#(<= rangesum_~i~1 3)} assume !!(~i~1 < 5); {5459#(<= rangesum_~i~1 3)} is VALID [2020-07-17 22:48:58,249 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-17 22:48:58,249 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-17 22:48:58,250 INFO L280 TraceCheckUtils]: 36: Hoare triple {5469#(<= rangesum_~i~1 4)} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,250 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-17 22:48:58,250 INFO L280 TraceCheckUtils]: 38: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-17 22:48:58,250 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5358#false} {5357#true} #84#return; {5358#false} is VALID [2020-07-17 22:48:58,250 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-17 22:48:58,250 INFO L263 TraceCheckUtils]: 41: Hoare triple {5358#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5358#false} is VALID [2020-07-17 22:48:58,250 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-17 22:48:58,251 INFO L280 TraceCheckUtils]: 43: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,251 INFO L280 TraceCheckUtils]: 44: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-17 22:48:58,251 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-17 22:48:58,251 INFO L280 TraceCheckUtils]: 46: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,251 INFO L280 TraceCheckUtils]: 47: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-17 22:48:58,251 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-17 22:48:58,251 INFO L280 TraceCheckUtils]: 49: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,251 INFO L280 TraceCheckUtils]: 50: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-17 22:48:58,251 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-17 22:48:58,252 INFO L280 TraceCheckUtils]: 52: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,252 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-17 22:48:58,252 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-17 22:48:58,252 INFO L280 TraceCheckUtils]: 55: Hoare triple {5358#false} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,252 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-17 22:48:58,252 INFO L280 TraceCheckUtils]: 57: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-17 22:48:58,252 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {5358#false} {5358#false} #86#return; {5358#false} is VALID [2020-07-17 22:48:58,253 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-17 22:48:58,253 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-17 22:48:58,253 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-17 22:48:58,253 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-17 22:48:58,253 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-17 22:48:58,253 INFO L280 TraceCheckUtils]: 64: Hoare triple {5358#false} assume !(~i~2 < 4); {5358#false} is VALID [2020-07-17 22:48:58,253 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-17 22:48:58,254 INFO L263 TraceCheckUtils]: 66: Hoare triple {5358#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5358#false} is VALID [2020-07-17 22:48:58,254 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-17 22:48:58,254 INFO L280 TraceCheckUtils]: 68: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,254 INFO L280 TraceCheckUtils]: 69: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-17 22:48:58,254 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-17 22:48:58,254 INFO L280 TraceCheckUtils]: 71: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,255 INFO L280 TraceCheckUtils]: 72: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-17 22:48:58,255 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-17 22:48:58,255 INFO L280 TraceCheckUtils]: 74: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,255 INFO L280 TraceCheckUtils]: 75: Hoare triple {5358#false} assume !(~i~1 > 2); {5358#false} is VALID [2020-07-17 22:48:58,255 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-17 22:48:58,255 INFO L280 TraceCheckUtils]: 77: Hoare triple {5358#false} assume !!(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,255 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-17 22:48:58,255 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-17 22:48:58,256 INFO L280 TraceCheckUtils]: 80: Hoare triple {5358#false} assume !(~i~1 < 5); {5358#false} is VALID [2020-07-17 22:48:58,256 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-17 22:48:58,256 INFO L280 TraceCheckUtils]: 82: Hoare triple {5358#false} assume true; {5358#false} is VALID [2020-07-17 22:48:58,256 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {5358#false} {5358#false} #88#return; {5358#false} is VALID [2020-07-17 22:48:58,256 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-17 22:48:58,256 INFO L280 TraceCheckUtils]: 85: Hoare triple {5358#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5358#false} is VALID [2020-07-17 22:48:58,256 INFO L280 TraceCheckUtils]: 86: Hoare triple {5358#false} assume !false; {5358#false} is VALID [2020-07-17 22:48:58,260 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-17 22:48:58,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379190706] [2020-07-17 22:48:58,261 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:58,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319403193] [2020-07-17 22:48:58,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:58,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-17 22:48:58,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812959665] [2020-07-17 22:48:58,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-07-17 22:48:58,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:58,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:48:58,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:58,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:48:58,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:58,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:48:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:58,319 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-17 22:48:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,763 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-17 22:48:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:48:58,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-07-17 22:48:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-17 22:48:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2020-07-17 22:48:58,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2020-07-17 22:48:58,862 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-17 22:48:58,863 INFO L225 Difference]: With dead ends: 88 [2020-07-17 22:48:58,864 INFO L226 Difference]: Without dead ends: 57 [2020-07-17 22:48:58,864 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-17 22:48:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-17 22:48:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-17 22:48:58,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:58,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-17 22:48:58,915 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-17 22:48:58,915 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-17 22:48:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,918 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-17 22:48:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-17 22:48:58,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,919 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-17 22:48:58,919 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-17 22:48:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,921 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-17 22:48:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-17 22:48:58,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:58,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-17 22:48:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-07-17 22:48:58,924 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 87 [2020-07-17 22:48:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:58,924 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-07-17 22:48:58,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:48:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-17 22:48:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-17 22:48:58,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,926 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-17 22:48:59,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-17 22:48:59,141 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1679580114, now seen corresponding path program 6 times [2020-07-17 22:48:59,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:59,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905154069] [2020-07-17 22:48:59,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,158 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:48:59,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551302590] [2020-07-17 22:48:59,158 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-17 22:48:59,614 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-17 22:48:59,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:48:59,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:48:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:59,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {5942#true} call ULTIMATE.init(); {5942#true} is VALID [2020-07-17 22:48:59,773 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-17 22:48:59,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-17 22:48:59,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5942#true} {5942#true} #78#return; {5942#true} is VALID [2020-07-17 22:48:59,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {5942#true} call #t~ret12 := main(); {5942#true} is VALID [2020-07-17 22:48:59,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {5942#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {5942#true} is VALID [2020-07-17 22:48:59,775 INFO L263 TraceCheckUtils]: 6: Hoare triple {5942#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-17 22:48:59,775 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-17 22:48:59,776 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-17 22:48:59,776 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-17 22:48:59,776 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-17 22:48:59,776 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-17 22:48:59,777 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-17 22:48:59,777 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-17 22:48:59,777 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-17 22:48:59,778 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-17 22:48:59,778 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-17 22:48:59,778 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-17 22:48:59,779 INFO L280 TraceCheckUtils]: 18: Hoare triple {5942#true} assume !(~i~0 < 5); {5942#true} is VALID [2020-07-17 22:48:59,779 INFO L280 TraceCheckUtils]: 19: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-17 22:48:59,779 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5942#true} {5942#true} #82#return; {5942#true} is VALID [2020-07-17 22:48:59,779 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-17 22:48:59,780 INFO L263 TraceCheckUtils]: 22: Hoare triple {5942#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-17 22:48:59,780 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-17 22:48:59,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,781 INFO L280 TraceCheckUtils]: 25: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-17 22:48:59,781 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-17 22:48:59,781 INFO L280 TraceCheckUtils]: 27: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,781 INFO L280 TraceCheckUtils]: 28: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-17 22:48:59,782 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-17 22:48:59,782 INFO L280 TraceCheckUtils]: 30: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,782 INFO L280 TraceCheckUtils]: 31: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-17 22:48:59,782 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-17 22:48:59,783 INFO L280 TraceCheckUtils]: 33: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,783 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-17 22:48:59,783 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-17 22:48:59,783 INFO L280 TraceCheckUtils]: 36: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,784 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-17 22:48:59,784 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-17 22:48:59,784 INFO L280 TraceCheckUtils]: 39: Hoare triple {5942#true} assume !(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,784 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-17 22:48:59,785 INFO L280 TraceCheckUtils]: 41: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-17 22:48:59,785 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {5942#true} {5942#true} #84#return; {5942#true} is VALID [2020-07-17 22:48:59,785 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-17 22:48:59,786 INFO L263 TraceCheckUtils]: 44: Hoare triple {5942#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5942#true} is VALID [2020-07-17 22:48:59,786 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-17 22:48:59,786 INFO L280 TraceCheckUtils]: 46: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,786 INFO L280 TraceCheckUtils]: 47: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-17 22:48:59,787 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-17 22:48:59,787 INFO L280 TraceCheckUtils]: 49: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,787 INFO L280 TraceCheckUtils]: 50: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-17 22:48:59,788 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-17 22:48:59,788 INFO L280 TraceCheckUtils]: 52: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,788 INFO L280 TraceCheckUtils]: 53: Hoare triple {5942#true} assume !(~i~1 > 2); {5942#true} is VALID [2020-07-17 22:48:59,788 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-17 22:48:59,789 INFO L280 TraceCheckUtils]: 55: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,789 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-17 22:48:59,789 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-17 22:48:59,789 INFO L280 TraceCheckUtils]: 58: Hoare triple {5942#true} assume !!(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,790 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-17 22:48:59,790 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-17 22:48:59,790 INFO L280 TraceCheckUtils]: 61: Hoare triple {5942#true} assume !(~i~1 < 5); {5942#true} is VALID [2020-07-17 22:48:59,790 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-17 22:48:59,790 INFO L280 TraceCheckUtils]: 63: Hoare triple {5942#true} assume true; {5942#true} is VALID [2020-07-17 22:48:59,791 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {5942#true} {5942#true} #86#return; {5942#true} is VALID [2020-07-17 22:48:59,792 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-17 22:48:59,793 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-17 22:48:59,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-17 22:48:59,796 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-17 22:48:59,798 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-17 22:48:59,799 INFO L280 TraceCheckUtils]: 70: Hoare triple {6156#(<= main_~i~2 2)} assume !(~i~2 < 4); {5943#false} is VALID [2020-07-17 22:48:59,799 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-17 22:48:59,799 INFO L263 TraceCheckUtils]: 72: Hoare triple {5943#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5943#false} is VALID [2020-07-17 22:48:59,800 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-17 22:48:59,800 INFO L280 TraceCheckUtils]: 74: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-17 22:48:59,800 INFO L280 TraceCheckUtils]: 75: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-17 22:48:59,800 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-17 22:48:59,801 INFO L280 TraceCheckUtils]: 77: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-17 22:48:59,801 INFO L280 TraceCheckUtils]: 78: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-17 22:48:59,801 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-17 22:48:59,801 INFO L280 TraceCheckUtils]: 80: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-17 22:48:59,801 INFO L280 TraceCheckUtils]: 81: Hoare triple {5943#false} assume !(~i~1 > 2); {5943#false} is VALID [2020-07-17 22:48:59,802 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-17 22:48:59,802 INFO L280 TraceCheckUtils]: 83: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-17 22:48:59,802 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-17 22:48:59,802 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-17 22:48:59,802 INFO L280 TraceCheckUtils]: 86: Hoare triple {5943#false} assume !!(~i~1 < 5); {5943#false} is VALID [2020-07-17 22:48:59,802 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-17 22:48:59,803 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-17 22:48:59,803 INFO L280 TraceCheckUtils]: 89: Hoare triple {5943#false} assume !(~i~1 < 5); {5943#false} is VALID [2020-07-17 22:48:59,803 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-17 22:48:59,803 INFO L280 TraceCheckUtils]: 91: Hoare triple {5943#false} assume true; {5943#false} is VALID [2020-07-17 22:48:59,804 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {5943#false} {5943#false} #88#return; {5943#false} is VALID [2020-07-17 22:48:59,804 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-17 22:48:59,804 INFO L280 TraceCheckUtils]: 94: Hoare triple {5943#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5943#false} is VALID [2020-07-17 22:48:59,804 INFO L280 TraceCheckUtils]: 95: Hoare triple {5943#false} assume !false; {5943#false} is VALID [2020-07-17 22:48:59,810 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-17 22:48:59,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905154069] [2020-07-17 22:48:59,811 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:48:59,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551302590] [2020-07-17 22:48:59,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:48:59,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-17 22:48:59,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391219479] [2020-07-17 22:48:59,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-07-17 22:48:59,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:59,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:48:59,893 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-17 22:48:59,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:48:59,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:59,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:48:59,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:59,894 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2020-07-17 22:49:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,093 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2020-07-17 22:49:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:49:00,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-07-17 22:49:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-17 22:49:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-17 22:49:00,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-17 22:49:00,172 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-17 22:49:00,174 INFO L225 Difference]: With dead ends: 86 [2020-07-17 22:49:00,174 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:49:00,175 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-17 22:49:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:49:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2020-07-17 22:49:00,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:00,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2020-07-17 22:49:00,219 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2020-07-17 22:49:00,219 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2020-07-17 22:49:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,222 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-07-17 22:49:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-17 22:49:00,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:00,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:00,224 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2020-07-17 22:49:00,224 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2020-07-17 22:49:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,226 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-07-17 22:49:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-17 22:49:00,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:00,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:00,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:00,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-17 22:49:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-17 22:49:00,229 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 96 [2020-07-17 22:49:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:00,230 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-17 22:49:00,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-17 22:49:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-17 22:49:00,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:00,231 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-17 22:49:00,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:00,446 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2078244212, now seen corresponding path program 7 times [2020-07-17 22:49:00,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:00,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560285171] [2020-07-17 22:49:00,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:00,461 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:00,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027293038] [2020-07-17 22:49:00,462 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-17 22:49:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:49:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:00,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {6559#true} call ULTIMATE.init(); {6559#true} is VALID [2020-07-17 22:49:00,677 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-17 22:49:00,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-17 22:49:00,678 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6559#true} {6559#true} #78#return; {6559#true} is VALID [2020-07-17 22:49:00,678 INFO L263 TraceCheckUtils]: 4: Hoare triple {6559#true} call #t~ret12 := main(); {6559#true} is VALID [2020-07-17 22:49:00,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {6559#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(20); {6559#true} is VALID [2020-07-17 22:49:00,678 INFO L263 TraceCheckUtils]: 6: Hoare triple {6559#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-17 22:49:00,679 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-17 22:49:00,679 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-17 22:49:00,679 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-17 22:49:00,679 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-17 22:49:00,679 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-17 22:49:00,680 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-17 22:49:00,680 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-17 22:49:00,680 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-17 22:49:00,680 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-17 22:49:00,681 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-17 22:49:00,681 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-17 22:49:00,681 INFO L280 TraceCheckUtils]: 18: Hoare triple {6559#true} assume !(~i~0 < 5); {6559#true} is VALID [2020-07-17 22:49:00,681 INFO L280 TraceCheckUtils]: 19: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-17 22:49:00,681 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {6559#true} {6559#true} #82#return; {6559#true} is VALID [2020-07-17 22:49:00,682 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-17 22:49:00,682 INFO L263 TraceCheckUtils]: 22: Hoare triple {6559#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-17 22:49:00,682 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-17 22:49:00,682 INFO L280 TraceCheckUtils]: 24: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,683 INFO L280 TraceCheckUtils]: 25: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-17 22:49:00,683 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-17 22:49:00,683 INFO L280 TraceCheckUtils]: 27: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,683 INFO L280 TraceCheckUtils]: 28: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-17 22:49:00,683 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-17 22:49:00,683 INFO L280 TraceCheckUtils]: 30: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,684 INFO L280 TraceCheckUtils]: 31: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-17 22:49:00,684 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-17 22:49:00,684 INFO L280 TraceCheckUtils]: 33: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,684 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-17 22:49:00,684 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-17 22:49:00,685 INFO L280 TraceCheckUtils]: 36: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,685 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-17 22:49:00,685 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-17 22:49:00,685 INFO L280 TraceCheckUtils]: 39: Hoare triple {6559#true} assume !(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,686 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-17 22:49:00,686 INFO L280 TraceCheckUtils]: 41: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-17 22:49:00,686 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {6559#true} {6559#true} #84#return; {6559#true} is VALID [2020-07-17 22:49:00,686 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-17 22:49:00,687 INFO L263 TraceCheckUtils]: 44: Hoare triple {6559#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6559#true} is VALID [2020-07-17 22:49:00,687 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-17 22:49:00,687 INFO L280 TraceCheckUtils]: 46: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,687 INFO L280 TraceCheckUtils]: 47: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-17 22:49:00,687 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-17 22:49:00,688 INFO L280 TraceCheckUtils]: 49: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,688 INFO L280 TraceCheckUtils]: 50: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-17 22:49:00,688 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-17 22:49:00,688 INFO L280 TraceCheckUtils]: 52: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,688 INFO L280 TraceCheckUtils]: 53: Hoare triple {6559#true} assume !(~i~1 > 2); {6559#true} is VALID [2020-07-17 22:49:00,689 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-17 22:49:00,689 INFO L280 TraceCheckUtils]: 55: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,689 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-17 22:49:00,689 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-17 22:49:00,690 INFO L280 TraceCheckUtils]: 58: Hoare triple {6559#true} assume !!(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,690 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-17 22:49:00,690 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-17 22:49:00,690 INFO L280 TraceCheckUtils]: 61: Hoare triple {6559#true} assume !(~i~1 < 5); {6559#true} is VALID [2020-07-17 22:49:00,690 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-17 22:49:00,691 INFO L280 TraceCheckUtils]: 63: Hoare triple {6559#true} assume true; {6559#true} is VALID [2020-07-17 22:49:00,691 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {6559#true} {6559#true} #86#return; {6559#true} is VALID [2020-07-17 22:49:00,692 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-17 22:49:00,693 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-17 22:49:00,694 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-17 22:49:00,694 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-17 22:49:00,696 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-17 22:49:00,697 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-17 22:49:00,698 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-17 22:49:00,699 INFO L280 TraceCheckUtils]: 72: Hoare triple {6780#(<= main_~i~2 3)} assume !(~i~2 < 4); {6560#false} is VALID [2020-07-17 22:49:00,699 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-17 22:49:00,700 INFO L263 TraceCheckUtils]: 74: Hoare triple {6560#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6560#false} is VALID [2020-07-17 22:49:00,700 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-17 22:49:00,700 INFO L280 TraceCheckUtils]: 76: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-17 22:49:00,700 INFO L280 TraceCheckUtils]: 77: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-17 22:49:00,700 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-17 22:49:00,700 INFO L280 TraceCheckUtils]: 79: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-17 22:49:00,701 INFO L280 TraceCheckUtils]: 80: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-17 22:49:00,701 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-17 22:49:00,701 INFO L280 TraceCheckUtils]: 82: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-17 22:49:00,701 INFO L280 TraceCheckUtils]: 83: Hoare triple {6560#false} assume !(~i~1 > 2); {6560#false} is VALID [2020-07-17 22:49:00,701 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-17 22:49:00,702 INFO L280 TraceCheckUtils]: 85: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-17 22:49:00,702 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-17 22:49:00,702 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-17 22:49:00,702 INFO L280 TraceCheckUtils]: 88: Hoare triple {6560#false} assume !!(~i~1 < 5); {6560#false} is VALID [2020-07-17 22:49:00,702 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-17 22:49:00,702 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-17 22:49:00,703 INFO L280 TraceCheckUtils]: 91: Hoare triple {6560#false} assume !(~i~1 < 5); {6560#false} is VALID [2020-07-17 22:49:00,703 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-17 22:49:00,703 INFO L280 TraceCheckUtils]: 93: Hoare triple {6560#false} assume true; {6560#false} is VALID [2020-07-17 22:49:00,703 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {6560#false} {6560#false} #88#return; {6560#false} is VALID [2020-07-17 22:49:00,703 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-17 22:49:00,703 INFO L280 TraceCheckUtils]: 96: Hoare triple {6560#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6560#false} is VALID [2020-07-17 22:49:00,704 INFO L280 TraceCheckUtils]: 97: Hoare triple {6560#false} assume !false; {6560#false} is VALID [2020-07-17 22:49:00,722 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-17 22:49:00,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560285171] [2020-07-17 22:49:00,723 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:00,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027293038] [2020-07-17 22:49:00,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:00,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:49:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375557147] [2020-07-17 22:49:00,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-17 22:49:00,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:00,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:49:00,788 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-17 22:49:00,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:49:00,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:49:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:49:00,790 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2020-07-17 22:49:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,191 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2020-07-17 22:49:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:01,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-07-17 22:49:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:49:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-17 22:49:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:49:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-17 22:49:01,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2020-07-17 22:49:01,292 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-17 22:49:01,294 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:49:01,294 INFO L226 Difference]: Without dead ends: 61 [2020-07-17 22:49:01,296 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-17 22:49:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-17 22:49:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-17 22:49:01,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:01,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2020-07-17 22:49:01,351 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-17 22:49:01,351 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-17 22:49:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,353 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-07-17 22:49:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-17 22:49:01,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:01,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:01,354 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-17 22:49:01,354 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-17 22:49:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,358 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-07-17 22:49:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-17 22:49:01,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:01,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:01,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:01,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 22:49:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-07-17 22:49:01,362 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 98 [2020-07-17 22:49:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:01,362 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-07-17 22:49:01,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:49:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-07-17 22:49:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-17 22:49:01,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:01,366 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-17 22:49:01,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-17 22:49:01,580 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614250, now seen corresponding path program 8 times [2020-07-17 22:49:01,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:01,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675639985] [2020-07-17 22:49:01,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:01,605 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:01,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757898456] [2020-07-17 22:49:01,606 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-17 22:49:02,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:49:02,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-17 22:49:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:02,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:02,171 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:02,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-17 22:49:02,489 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:49:02,490 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2020-07-17 22:49:02,491 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:02,492 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:02,493 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-17 22:49:02,494 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:49:02,494 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:49:02,494 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:02,494 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:02,494 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-17 22:49:02,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:02 BoogieIcfgContainer [2020-07-17 22:49:02,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:02,500 INFO L168 Benchmark]: Toolchain (without parser) took 18897.78 ms. Allocated memory was 145.2 MB in the beginning and 336.1 MB in the end (delta: 190.8 MB). Free memory was 102.6 MB in the beginning and 193.4 MB in the end (delta: -90.8 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,501 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.74 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 91.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,502 INFO L168 Benchmark]: Boogie Preprocessor took 222.31 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 91.3 MB in the beginning and 181.9 MB in the end (delta: -90.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,502 INFO L168 Benchmark]: RCFGBuilder took 684.42 ms. Allocated memory is still 204.5 MB. Free memory was 181.9 MB in the beginning and 153.1 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,503 INFO L168 Benchmark]: TraceAbstraction took 17610.48 ms. Allocated memory was 204.5 MB in the beginning and 336.1 MB in the end (delta: 131.6 MB). Free memory was 153.1 MB in the beginning and 193.4 MB in the end (delta: -40.3 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,505 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.27 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 370.74 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 91.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 222.31 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 91.3 MB in the beginning and 181.9 MB in the end (delta: -90.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 684.42 ms. Allocated memory is still 204.5 MB. Free memory was 181.9 MB in the beginning and 153.1 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17610.48 ms. Allocated memory was 204.5 MB in the beginning and 336.1 MB in the end (delta: 131.6 MB). Free memory was 153.1 MB in the beginning and 193.4 MB in the end (delta: -40.3 MB). Peak memory consumption was 91.3 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=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=5, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=5, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=5, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=2, cnt=2, i=5, ret=5, x={2:0}, x={2:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=2, 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=2, temp=-2147483648, x={2:0}] [L41] CALL, EXPR rangesum(x) VAL [x={2:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={2:0}, x={2:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=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=5, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=2, i=5, ret=5, x={2:0}, x={2:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=5, x={2:0}, x={2:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=2, cnt=2, i=5, ret=5, x={2:0}, x={2:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=2, ret=2, temp=-2147483648, x={2:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=2, ret2=2, temp=2147483645, 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=2, ret2=2, temp=2147483645, 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=2, ret2=2, temp=2147483645, 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=2, ret2=2, temp=2147483645, 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=2, ret2=2, temp=2147483645, x={2:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=2, ret2=2, temp=2147483645, x={2:0}] [L46] x[5 -1] = temp VAL [i=4, ret=2, ret2=2, temp=2147483645, 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=-2147483642, x={2:0}, x={2:0}] [L17] i++ VAL [cnt=1, i=4, ret=-2147483642, x={2:0}, x={2:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-2147483642, 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=2, ret2=2, temp=2147483645, x={2:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=2, ret2=2, ret5=1, temp=2147483645, x={2:0}] [L50] __VERIFIER_error() VAL [i=4, ret=2, ret2=2, ret5=1, temp=2147483645, 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.4s, 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.7s 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.4s SatisfiabilityAnalysisTime, 3.0s 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...