java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum60_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:13:36,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:13:36,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:13:36,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:13:36,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:13:36,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:13:36,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:13:36,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:13:36,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:13:36,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:13:36,337 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:13:36,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:13:36,339 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:13:36,340 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:13:36,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:13:36,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:13:36,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:13:36,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:13:36,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:13:36,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:13:36,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:13:36,357 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:13:36,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:13:36,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:13:36,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:13:36,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:13:36,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:13:36,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:13:36,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:13:36,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:13:36,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:13:36,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:13:36,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:13:36,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:13:36,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:13:36,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:13:36,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:13:36,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:13:36,382 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:13:36,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:13:36,383 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:13:36,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:13:36,384 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:13:36,384 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:13:36,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:13:36,385 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:13:36,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:13:36,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:13:36,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:13:36,385 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:13:36,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:13:36,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:13:36,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:13:36,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:13:36,386 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:13:36,387 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:13:36,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:13:36,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:13:36,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:13:36,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:13:36,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:13:36,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:13:36,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:13:36,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:13:36,388 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:13:36,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:13:36,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:13:36,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:13:36,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:13:36,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:13:36,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:13:36,474 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:13:36,475 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:13:36,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum60_false-unreach-call.i [2018-11-23 12:13:36,537 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df1a3d0/69981b02d03c4c26baf98ac9d5159b01/FLAGd458fb21a [2018-11-23 12:13:37,050 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:13:37,051 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum60_false-unreach-call.i [2018-11-23 12:13:37,058 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df1a3d0/69981b02d03c4c26baf98ac9d5159b01/FLAGd458fb21a [2018-11-23 12:13:37,385 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df1a3d0/69981b02d03c4c26baf98ac9d5159b01 [2018-11-23 12:13:37,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:13:37,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:13:37,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:37,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:13:37,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:13:37,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a4cdb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37, skipping insertion in model container [2018-11-23 12:13:37,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:13:37,444 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:13:37,708 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:37,727 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:13:37,771 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:37,793 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:13:37,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37 WrapperNode [2018-11-23 12:13:37,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:37,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:37,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:13:37,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:13:37,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:37,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:13:37,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:13:37,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:13:37,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (1/1) ... [2018-11-23 12:13:37,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:13:37,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:13:37,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:13:37,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:13:37,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (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 [2018-11-23 12:13:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:13:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:13:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:13:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:13:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:13:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:13:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:13:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:13:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:13:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 12:13:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 12:13:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:13:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 12:13:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 12:13:38,932 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:13:38,933 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:13:38,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:38 BoogieIcfgContainer [2018-11-23 12:13:38,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:13:38,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:13:38,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:13:38,937 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:13:38,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:13:37" (1/3) ... [2018-11-23 12:13:38,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b688334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:38, skipping insertion in model container [2018-11-23 12:13:38,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:37" (2/3) ... [2018-11-23 12:13:38,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b688334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:38, skipping insertion in model container [2018-11-23 12:13:38,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:38" (3/3) ... [2018-11-23 12:13:38,941 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum60_false-unreach-call.i [2018-11-23 12:13:38,951 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:13:38,959 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:13:38,977 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:13:39,010 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:13:39,011 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:13:39,011 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:13:39,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:13:39,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:13:39,012 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:13:39,012 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:13:39,012 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:13:39,012 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:13:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 12:13:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:13:39,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:39,043 INFO L402 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] [2018-11-23 12:13:39,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:39,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 12:13:39,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:39,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:39,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:39,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 12:13:39,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:39,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:13:39,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:39,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:39,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 12:13:39,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 12:13:39,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:13:39,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #78#return; {40#true} is VALID [2018-11-23 12:13:39,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2018-11-23 12:13:39,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {40#true} is VALID [2018-11-23 12:13:39,482 INFO L256 TraceCheckUtils]: 6: Hoare triple {40#true} call init_nondet(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2018-11-23 12:13:39,482 INFO L273 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 [2018-11-23 12:13:39,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#true} assume !(~i~0 < 60); {40#true} is VALID [2018-11-23 12:13:39,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:13:39,484 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #82#return; {40#true} is VALID [2018-11-23 12:13:39,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {40#true} is VALID [2018-11-23 12:13:39,484 INFO L256 TraceCheckUtils]: 12: Hoare triple {40#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2018-11-23 12:13:39,485 INFO L273 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 [2018-11-23 12:13:39,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 12:13:39,499 INFO L273 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 [2018-11-23 12:13:39,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:39,500 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {41#false} {40#true} #84#return; {41#false} is VALID [2018-11-23 12:13:39,501 INFO L273 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 [2018-11-23 12:13:39,501 INFO L256 TraceCheckUtils]: 19: Hoare triple {41#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2018-11-23 12:13:39,502 INFO L273 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 [2018-11-23 12:13:39,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:13:39,502 INFO L273 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 [2018-11-23 12:13:39,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:39,503 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {41#false} {41#false} #86#return; {41#false} is VALID [2018-11-23 12:13:39,503 INFO L273 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 [2018-11-23 12:13:39,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {41#false} assume !(~i~2 < 59); {41#false} is VALID [2018-11-23 12:13:39,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {41#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {41#false} is VALID [2018-11-23 12:13:39,505 INFO L256 TraceCheckUtils]: 28: Hoare triple {41#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2018-11-23 12:13:39,505 INFO L273 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 [2018-11-23 12:13:39,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:13:39,506 INFO L273 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 [2018-11-23 12:13:39,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:39,506 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {41#false} {41#false} #88#return; {41#false} is VALID [2018-11-23 12:13:39,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {41#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {41#false} is VALID [2018-11-23 12:13:39,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {41#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {41#false} is VALID [2018-11-23 12:13:39,507 INFO L273 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 12:13:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:13:39,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:13:39,556 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:13:39,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:39,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:13:39,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:39,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:13:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:13:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:39,766 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 12:13:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:39,946 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-11-23 12:13:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:13:39,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:13:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:13:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 12:13:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:13:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 12:13:39,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2018-11-23 12:13:40,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:40,546 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:13:40,547 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:13:40,551 INFO L631 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 [2018-11-23 12:13:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:13:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:13:40,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:40,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:40,596 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:40,596 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:40,603 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:13:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:40,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:40,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:40,607 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:40,607 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:40,614 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:13:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:40,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:40,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:40,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:40,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:13:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:13:40,624 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2018-11-23 12:13:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:40,624 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:13:40,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:13:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:13:40,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:40,629 INFO L402 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] [2018-11-23 12:13:40,629 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:40,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2018-11-23 12:13:40,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:40,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:40,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:40,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:40,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:41,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2018-11-23 12:13:41,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {344#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {344#true} is VALID [2018-11-23 12:13:41,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2018-11-23 12:13:41,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #78#return; {344#true} is VALID [2018-11-23 12:13:41,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret12 := main(); {344#true} is VALID [2018-11-23 12:13:41,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {344#true} is VALID [2018-11-23 12:13:41,079 INFO L256 TraceCheckUtils]: 6: Hoare triple {344#true} call init_nondet(~#x~0.base, ~#x~0.offset); {344#true} is VALID [2018-11-23 12:13:41,080 INFO L273 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 [2018-11-23 12:13:41,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(<= init_nondet_~i~0 0)} assume !(~i~0 < 60); {345#false} is VALID [2018-11-23 12:13:41,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:41,081 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {345#false} {344#true} #82#return; {345#false} is VALID [2018-11-23 12:13:41,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {345#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {345#false} is VALID [2018-11-23 12:13:41,082 INFO L256 TraceCheckUtils]: 12: Hoare triple {345#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:41,082 INFO L273 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 [2018-11-23 12:13:41,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {345#false} assume !(~i~1 < 60); {345#false} is VALID [2018-11-23 12:13:41,083 INFO L273 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 [2018-11-23 12:13:41,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:41,084 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {345#false} {345#false} #84#return; {345#false} is VALID [2018-11-23 12:13:41,084 INFO L273 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 [2018-11-23 12:13:41,084 INFO L256 TraceCheckUtils]: 19: Hoare triple {345#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:41,085 INFO L273 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 [2018-11-23 12:13:41,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {345#false} assume !(~i~1 < 60); {345#false} is VALID [2018-11-23 12:13:41,085 INFO L273 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 [2018-11-23 12:13:41,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:41,086 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {345#false} {345#false} #86#return; {345#false} is VALID [2018-11-23 12:13:41,086 INFO L273 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 [2018-11-23 12:13:41,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {345#false} assume !(~i~2 < 59); {345#false} is VALID [2018-11-23 12:13:41,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {345#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {345#false} is VALID [2018-11-23 12:13:41,087 INFO L256 TraceCheckUtils]: 28: Hoare triple {345#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:41,088 INFO L273 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 [2018-11-23 12:13:41,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {345#false} assume !(~i~1 < 60); {345#false} is VALID [2018-11-23 12:13:41,088 INFO L273 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 [2018-11-23 12:13:41,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:41,089 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {345#false} {345#false} #88#return; {345#false} is VALID [2018-11-23 12:13:41,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {345#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {345#false} is VALID [2018-11-23 12:13:41,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {345#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {345#false} is VALID [2018-11-23 12:13:41,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {345#false} assume !false; {345#false} is VALID [2018-11-23 12:13:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:13:41,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:41,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:13:41,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:13:41,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:41,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:13:41,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:41,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:13:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:13:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:41,162 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 12:13:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:41,375 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 12:13:41,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:41,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:13:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:41,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 12:13:41,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:41,553 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:13:41,554 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:13:41,555 INFO L631 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 [2018-11-23 12:13:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:13:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:13:41,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:41,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:41,577 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:41,577 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:41,581 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:13:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:13:41,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:41,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:41,582 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:13:41,582 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:13:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:41,586 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:13:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:13:41,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:41,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:41,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:41,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:13:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:13:41,590 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 12:13:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:41,591 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:13:41,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:13:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:13:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:13:41,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:41,593 INFO L402 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] [2018-11-23 12:13:41,593 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:41,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 12:13:41,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:41,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:41,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:41,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:41,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:41,612 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:41,612 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:41,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:41,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:41,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:41,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {648#true} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 12:13:41,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #78#return; {648#true} is VALID [2018-11-23 12:13:41,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret12 := main(); {648#true} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {648#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {648#true} is VALID [2018-11-23 12:13:41,786 INFO L256 TraceCheckUtils]: 6: Hoare triple {648#true} call init_nondet(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2018-11-23 12:13:41,787 INFO L273 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 [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#true} assume !!(~i~0 < 60);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 [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {648#true} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(~i~0 < 60); {648#true} is VALID [2018-11-23 12:13:41,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 12:13:41,788 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {648#true} {648#true} #82#return; {648#true} is VALID [2018-11-23 12:13:41,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {648#true} is VALID [2018-11-23 12:13:41,788 INFO L256 TraceCheckUtils]: 14: Hoare triple {648#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2018-11-23 12:13:41,789 INFO L273 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#(= 0 rangesum_~cnt~0)} is VALID [2018-11-23 12:13:41,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#(= 0 rangesum_~cnt~0)} assume !(~i~1 < 60); {698#(= 0 rangesum_~cnt~0)} is VALID [2018-11-23 12:13:41,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {698#(= 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); {649#false} is VALID [2018-11-23 12:13:41,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:41,791 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {649#false} {648#true} #84#return; {649#false} is VALID [2018-11-23 12:13:41,791 INFO L273 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 [2018-11-23 12:13:41,791 INFO L256 TraceCheckUtils]: 21: Hoare triple {649#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2018-11-23 12:13:41,792 INFO L273 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 [2018-11-23 12:13:41,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {649#false} assume !(~i~1 < 60); {649#false} is VALID [2018-11-23 12:13:41,792 INFO L273 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 [2018-11-23 12:13:41,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:41,793 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {649#false} {649#false} #86#return; {649#false} is VALID [2018-11-23 12:13:41,794 INFO L273 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 [2018-11-23 12:13:41,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {649#false} assume !(~i~2 < 59); {649#false} is VALID [2018-11-23 12:13:41,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {649#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {649#false} is VALID [2018-11-23 12:13:41,795 INFO L256 TraceCheckUtils]: 30: Hoare triple {649#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2018-11-23 12:13:41,795 INFO L273 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 [2018-11-23 12:13:41,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~i~1 < 60); {649#false} is VALID [2018-11-23 12:13:41,796 INFO L273 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 [2018-11-23 12:13:41,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:41,796 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {649#false} {649#false} #88#return; {649#false} is VALID [2018-11-23 12:13:41,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {649#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {649#false} is VALID [2018-11-23 12:13:41,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {649#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {649#false} is VALID [2018-11-23 12:13:41,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {649#false} assume !false; {649#false} is VALID [2018-11-23 12:13:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:13:41,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:41,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:13:41,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:13:41,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:41,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:13:41,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:41,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:13:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:13:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:41,893 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-23 12:13:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,035 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-23 12:13:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:42,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:13:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:13:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:13:42,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 12:13:42,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:42,158 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:13:42,158 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:13:42,159 INFO L631 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 [2018-11-23 12:13:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:13:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:13:42,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:42,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:42,185 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:42,185 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,189 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 12:13:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 12:13:42,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:42,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:42,191 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:13:42,191 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:13:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,195 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 12:13:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 12:13:42,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:42,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:42,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:42,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:42,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 39 [2018-11-23 12:13:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:42,200 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:42,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:13:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:13:42,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:42,202 INFO L402 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] [2018-11-23 12:13:42,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:42,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -22870507, now seen corresponding path program 1 times [2018-11-23 12:13:42,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:42,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:13:42,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:13:42,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:42,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #78#return; {974#true} is VALID [2018-11-23 12:13:42,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret12 := main(); {974#true} is VALID [2018-11-23 12:13:42,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {974#true} is VALID [2018-11-23 12:13:42,316 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#true} call init_nondet(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:42,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {974#true} is VALID [2018-11-23 12:13:42,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {974#true} is VALID [2018-11-23 12:13:42,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {974#true} is VALID [2018-11-23 12:13:42,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#true} assume !(~i~0 < 60); {974#true} is VALID [2018-11-23 12:13:42,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:42,318 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {974#true} {974#true} #82#return; {974#true} is VALID [2018-11-23 12:13:42,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {974#true} is VALID [2018-11-23 12:13:42,319 INFO L256 TraceCheckUtils]: 14: Hoare triple {974#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:42,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#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; {976#(= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:42,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {976#(= rangesum_~i~1 0)} assume !(~i~1 < 60); {975#false} is VALID [2018-11-23 12:13:42,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:42,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:42,328 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {975#false} {974#true} #84#return; {975#false} is VALID [2018-11-23 12:13:42,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#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); {975#false} is VALID [2018-11-23 12:13:42,328 INFO L256 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:42,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {974#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; {974#true} is VALID [2018-11-23 12:13:42,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {974#true} assume !(~i~1 < 60); {974#true} is VALID [2018-11-23 12:13:42,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {974#true} assume !(0 != ~cnt~0);#res := 0; {974#true} is VALID [2018-11-23 12:13:42,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:42,330 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {974#true} {975#false} #86#return; {975#false} is VALID [2018-11-23 12:13:42,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#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; {975#false} is VALID [2018-11-23 12:13:42,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~2 < 59); {975#false} is VALID [2018-11-23 12:13:42,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:42,331 INFO L256 TraceCheckUtils]: 30: Hoare triple {975#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:42,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {974#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; {974#true} is VALID [2018-11-23 12:13:42,332 INFO L273 TraceCheckUtils]: 32: Hoare triple {974#true} assume !(~i~1 < 60); {974#true} is VALID [2018-11-23 12:13:42,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {974#true} assume !(0 != ~cnt~0);#res := 0; {974#true} is VALID [2018-11-23 12:13:42,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:42,333 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {974#true} {975#false} #88#return; {975#false} is VALID [2018-11-23 12:13:42,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {975#false} is VALID [2018-11-23 12:13:42,333 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {975#false} is VALID [2018-11-23 12:13:42,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:13:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:13:42,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:42,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:13:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:42,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:42,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:13:42,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:13:42,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:42,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #78#return; {974#true} is VALID [2018-11-23 12:13:42,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret12 := main(); {974#true} is VALID [2018-11-23 12:13:42,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {974#true} is VALID [2018-11-23 12:13:42,537 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#true} call init_nondet(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:42,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {974#true} is VALID [2018-11-23 12:13:42,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {974#true} is VALID [2018-11-23 12:13:42,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {974#true} is VALID [2018-11-23 12:13:42,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#true} assume !(~i~0 < 60); {974#true} is VALID [2018-11-23 12:13:42,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:42,539 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {974#true} {974#true} #82#return; {974#true} is VALID [2018-11-23 12:13:42,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {974#true} is VALID [2018-11-23 12:13:42,540 INFO L256 TraceCheckUtils]: 14: Hoare triple {974#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:42,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#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; {1025#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:42,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {1025#(<= rangesum_~i~1 0)} assume !(~i~1 < 60); {975#false} is VALID [2018-11-23 12:13:42,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:42,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:42,559 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {975#false} {974#true} #84#return; {975#false} is VALID [2018-11-23 12:13:42,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#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); {975#false} is VALID [2018-11-23 12:13:42,559 INFO L256 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {975#false} is VALID [2018-11-23 12:13:42,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#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; {975#false} is VALID [2018-11-23 12:13:42,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} assume !(~i~1 < 60); {975#false} is VALID [2018-11-23 12:13:42,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:42,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:42,560 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {975#false} {975#false} #86#return; {975#false} is VALID [2018-11-23 12:13:42,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#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; {975#false} is VALID [2018-11-23 12:13:42,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~2 < 59); {975#false} is VALID [2018-11-23 12:13:42,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:42,561 INFO L256 TraceCheckUtils]: 30: Hoare triple {975#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {975#false} is VALID [2018-11-23 12:13:42,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#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; {975#false} is VALID [2018-11-23 12:13:42,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~1 < 60); {975#false} is VALID [2018-11-23 12:13:42,562 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:42,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:42,563 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {975#false} {975#false} #88#return; {975#false} is VALID [2018-11-23 12:13:42,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {975#false} is VALID [2018-11-23 12:13:42,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {975#false} is VALID [2018-11-23 12:13:42,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:13:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:13:42,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:42,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:13:42,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 12:13:42,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:42,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:42,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:42,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:42,674 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 12:13:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,914 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 12:13:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 12:13:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:42,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 12:13:43,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:43,064 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:13:43,065 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:13:43,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:13:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:13:43,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:43,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:43,099 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:43,100 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:43,103 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:13:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:13:43,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:43,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:43,104 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:13:43,104 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:13:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:43,107 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:13:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:13:43,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:43,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:43,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:43,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:13:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:13:43,112 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 39 [2018-11-23 12:13:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:43,112 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:13:43,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:13:43,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:13:43,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:43,115 INFO L402 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] [2018-11-23 12:13:43,115 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:43,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 12:13:43,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:43,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:43,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2018-11-23 12:13:43,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1313#true} is VALID [2018-11-23 12:13:43,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #78#return; {1313#true} is VALID [2018-11-23 12:13:43,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret12 := main(); {1313#true} is VALID [2018-11-23 12:13:43,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1313#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {1313#true} is VALID [2018-11-23 12:13:43,220 INFO L256 TraceCheckUtils]: 6: Hoare triple {1313#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1313#true} is VALID [2018-11-23 12:13:43,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1313#true} is VALID [2018-11-23 12:13:43,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#true} is VALID [2018-11-23 12:13:43,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#true} assume !(~i~0 < 60); {1313#true} is VALID [2018-11-23 12:13:43,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,222 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1313#true} {1313#true} #82#return; {1313#true} is VALID [2018-11-23 12:13:43,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {1313#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1313#true} is VALID [2018-11-23 12:13:43,223 INFO L256 TraceCheckUtils]: 14: Hoare triple {1313#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#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; {1313#true} is VALID [2018-11-23 12:13:43,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {1313#true} assume !!(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {1313#true} assume !(~i~1 > 30); {1315#(<= rangesum_~i~1 30)} is VALID [2018-11-23 12:13:43,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= rangesum_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1316#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:43,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {1316#(<= rangesum_~i~1 31)} assume !(~i~1 < 60); {1314#false} is VALID [2018-11-23 12:13:43,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {1314#false} assume !(0 != ~cnt~0);#res := 0; {1314#false} is VALID [2018-11-23 12:13:43,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {1314#false} assume true; {1314#false} is VALID [2018-11-23 12:13:43,242 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1314#false} {1313#true} #84#return; {1314#false} is VALID [2018-11-23 12:13:43,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {1314#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); {1314#false} is VALID [2018-11-23 12:13:43,242 INFO L256 TraceCheckUtils]: 24: Hoare triple {1314#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#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; {1313#true} is VALID [2018-11-23 12:13:43,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {1313#true} assume !!(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#true} assume !(~i~1 > 30); {1313#true} is VALID [2018-11-23 12:13:43,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:43,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {1313#true} assume !(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,244 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:43,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,244 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1313#true} {1314#false} #86#return; {1314#false} is VALID [2018-11-23 12:13:43,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {1314#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; {1314#false} is VALID [2018-11-23 12:13:43,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {1314#false} assume !(~i~2 < 59); {1314#false} is VALID [2018-11-23 12:13:43,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {1314#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:43,245 INFO L256 TraceCheckUtils]: 36: Hoare triple {1314#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {1313#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; {1313#true} is VALID [2018-11-23 12:13:43,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {1313#true} assume !!(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,246 INFO L273 TraceCheckUtils]: 39: Hoare triple {1313#true} assume !(~i~1 > 30); {1313#true} is VALID [2018-11-23 12:13:43,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:43,246 INFO L273 TraceCheckUtils]: 41: Hoare triple {1313#true} assume !(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,247 INFO L273 TraceCheckUtils]: 42: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:43,247 INFO L273 TraceCheckUtils]: 43: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,247 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1313#true} {1314#false} #88#return; {1314#false} is VALID [2018-11-23 12:13:43,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {1314#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1314#false} is VALID [2018-11-23 12:13:43,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {1314#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1314#false} is VALID [2018-11-23 12:13:43,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2018-11-23 12:13:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:13:43,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:43,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:13:43,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:43,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:43,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2018-11-23 12:13:43,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1313#true} is VALID [2018-11-23 12:13:43,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #78#return; {1313#true} is VALID [2018-11-23 12:13:43,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret12 := main(); {1313#true} is VALID [2018-11-23 12:13:43,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {1313#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {1313#true} is VALID [2018-11-23 12:13:43,819 INFO L256 TraceCheckUtils]: 6: Hoare triple {1313#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1313#true} is VALID [2018-11-23 12:13:43,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1313#true} is VALID [2018-11-23 12:13:43,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#true} is VALID [2018-11-23 12:13:43,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#true} assume !(~i~0 < 60); {1313#true} is VALID [2018-11-23 12:13:43,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,821 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1313#true} {1313#true} #82#return; {1313#true} is VALID [2018-11-23 12:13:43,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {1313#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1313#true} is VALID [2018-11-23 12:13:43,821 INFO L256 TraceCheckUtils]: 14: Hoare triple {1313#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#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; {1313#true} is VALID [2018-11-23 12:13:43,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {1313#true} assume !!(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {1313#true} assume !(~i~1 > 30); {1313#true} is VALID [2018-11-23 12:13:43,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:43,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {1313#true} assume !(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:43,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,823 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1313#true} {1313#true} #84#return; {1313#true} is VALID [2018-11-23 12:13:43,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {1313#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); {1313#true} is VALID [2018-11-23 12:13:43,824 INFO L256 TraceCheckUtils]: 24: Hoare triple {1313#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:43,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#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; {1313#true} is VALID [2018-11-23 12:13:43,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {1313#true} assume !!(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#true} assume !(~i~1 > 30); {1313#true} is VALID [2018-11-23 12:13:43,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:43,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {1313#true} assume !(~i~1 < 60); {1313#true} is VALID [2018-11-23 12:13:43,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:43,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:43,826 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1313#true} {1313#true} #86#return; {1313#true} is VALID [2018-11-23 12:13:43,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {1313#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; {1419#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:43,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {1419#(<= main_~i~2 0)} assume !(~i~2 < 59); {1314#false} is VALID [2018-11-23 12:13:43,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {1314#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:43,852 INFO L256 TraceCheckUtils]: 36: Hoare triple {1314#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1314#false} is VALID [2018-11-23 12:13:43,852 INFO L273 TraceCheckUtils]: 37: Hoare triple {1314#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; {1314#false} is VALID [2018-11-23 12:13:43,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {1314#false} assume !!(~i~1 < 60); {1314#false} is VALID [2018-11-23 12:13:43,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {1314#false} assume !(~i~1 > 30); {1314#false} is VALID [2018-11-23 12:13:43,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {1314#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1314#false} is VALID [2018-11-23 12:13:43,853 INFO L273 TraceCheckUtils]: 41: Hoare triple {1314#false} assume !(~i~1 < 60); {1314#false} is VALID [2018-11-23 12:13:43,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {1314#false} assume !(0 != ~cnt~0);#res := 0; {1314#false} is VALID [2018-11-23 12:13:43,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {1314#false} assume true; {1314#false} is VALID [2018-11-23 12:13:43,854 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1314#false} {1314#false} #88#return; {1314#false} is VALID [2018-11-23 12:13:43,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {1314#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1314#false} is VALID [2018-11-23 12:13:43,854 INFO L273 TraceCheckUtils]: 46: Hoare triple {1314#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1314#false} is VALID [2018-11-23 12:13:43,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2018-11-23 12:13:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 12:13:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-23 12:13:43,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:13:43,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:43,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:44,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:44,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:44,008 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2018-11-23 12:13:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,231 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 12:13:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:44,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:13:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:44,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:13:44,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:44,367 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:44,367 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:13:44,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:13:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 12:13:44,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:44,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:44,391 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:44,392 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,395 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:13:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:13:44,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:44,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:44,397 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states. [2018-11-23 12:13:44,397 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states. [2018-11-23 12:13:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,400 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:13:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:13:44,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:44,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:44,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:44,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:13:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 12:13:44,404 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 48 [2018-11-23 12:13:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:44,404 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 12:13:44,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:13:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:13:44,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:44,406 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-11-23 12:13:44,407 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:44,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1681907214, now seen corresponding path program 1 times [2018-11-23 12:13:44,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:44,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:44,421 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:44,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:44,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:44,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:44,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:44,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1697#true} is VALID [2018-11-23 12:13:44,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {1697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1697#true} is VALID [2018-11-23 12:13:44,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2018-11-23 12:13:44,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #78#return; {1697#true} is VALID [2018-11-23 12:13:44,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret12 := main(); {1697#true} is VALID [2018-11-23 12:13:44,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {1697#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {1697#true} is VALID [2018-11-23 12:13:44,631 INFO L256 TraceCheckUtils]: 6: Hoare triple {1697#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1697#true} is VALID [2018-11-23 12:13:44,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {1697#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1723#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:44,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {1723#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1723#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:44,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {1723#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1730#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:44,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {1730#(<= init_nondet_~i~0 1)} assume !(~i~0 < 60); {1698#false} is VALID [2018-11-23 12:13:44,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:44,637 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1698#false} {1697#true} #82#return; {1698#false} is VALID [2018-11-23 12:13:44,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {1698#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1698#false} is VALID [2018-11-23 12:13:44,638 INFO L256 TraceCheckUtils]: 14: Hoare triple {1698#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:44,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {1698#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; {1698#false} is VALID [2018-11-23 12:13:44,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#false} assume !!(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {1698#false} assume !(~i~1 > 30); {1698#false} is VALID [2018-11-23 12:13:44,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:44,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {1698#false} assume !!(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {1698#false} assume ~i~1 > 30;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; {1698#false} is VALID [2018-11-23 12:13:44,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:44,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {1698#false} assume !(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,641 INFO L273 TraceCheckUtils]: 23: Hoare triple {1698#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); {1698#false} is VALID [2018-11-23 12:13:44,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:44,641 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1698#false} {1698#false} #84#return; {1698#false} is VALID [2018-11-23 12:13:44,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {1698#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); {1698#false} is VALID [2018-11-23 12:13:44,642 INFO L256 TraceCheckUtils]: 27: Hoare triple {1698#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:44,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {1698#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; {1698#false} is VALID [2018-11-23 12:13:44,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {1698#false} assume !!(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {1698#false} assume !(~i~1 > 30); {1698#false} is VALID [2018-11-23 12:13:44,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:44,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {1698#false} assume !!(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {1698#false} assume ~i~1 > 30;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; {1698#false} is VALID [2018-11-23 12:13:44,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:44,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {1698#false} assume !(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {1698#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); {1698#false} is VALID [2018-11-23 12:13:44,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:44,645 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1698#false} {1698#false} #86#return; {1698#false} is VALID [2018-11-23 12:13:44,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {1698#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; {1698#false} is VALID [2018-11-23 12:13:44,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {1698#false} assume !!(~i~2 < 59);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; {1698#false} is VALID [2018-11-23 12:13:44,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {1698#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1698#false} is VALID [2018-11-23 12:13:44,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {1698#false} assume !(~i~2 < 59); {1698#false} is VALID [2018-11-23 12:13:44,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {1698#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1698#false} is VALID [2018-11-23 12:13:44,646 INFO L256 TraceCheckUtils]: 44: Hoare triple {1698#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:44,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {1698#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; {1698#false} is VALID [2018-11-23 12:13:44,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {1698#false} assume !!(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {1698#false} assume !(~i~1 > 30); {1698#false} is VALID [2018-11-23 12:13:44,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:44,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {1698#false} assume !!(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {1698#false} assume ~i~1 > 30;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; {1698#false} is VALID [2018-11-23 12:13:44,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:44,648 INFO L273 TraceCheckUtils]: 52: Hoare triple {1698#false} assume !(~i~1 < 60); {1698#false} is VALID [2018-11-23 12:13:44,649 INFO L273 TraceCheckUtils]: 53: Hoare triple {1698#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); {1698#false} is VALID [2018-11-23 12:13:44,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:44,649 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1698#false} {1698#false} #88#return; {1698#false} is VALID [2018-11-23 12:13:44,650 INFO L273 TraceCheckUtils]: 56: Hoare triple {1698#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1698#false} is VALID [2018-11-23 12:13:44,650 INFO L273 TraceCheckUtils]: 57: Hoare triple {1698#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1698#false} is VALID [2018-11-23 12:13:44,650 INFO L273 TraceCheckUtils]: 58: Hoare triple {1698#false} assume !false; {1698#false} is VALID [2018-11-23 12:13:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:13:44,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:44,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:44,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 12:13:44,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:44,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:44,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:44,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:44,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:44,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:44,719 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 4 states. [2018-11-23 12:13:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,831 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 12:13:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:44,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 12:13:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:44,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:13:44,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:44,955 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:44,955 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:13:44,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:13:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 12:13:45,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:45,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:45,046 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:45,046 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,049 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:13:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:13:45,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:45,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:45,050 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 12:13:45,050 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 12:13:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,053 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:13:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:13:45,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:45,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:45,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:45,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:13:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 12:13:45,056 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 59 [2018-11-23 12:13:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:45,057 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 12:13:45,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:13:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:13:45,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:45,058 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 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, 1, 1] [2018-11-23 12:13:45,059 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:45,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash 804630256, now seen corresponding path program 2 times [2018-11-23 12:13:45,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:45,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:45,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:45,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:45,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:45,074 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:45,074 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:45,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:45,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:45,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:45,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:45,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:45,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2018-11-23 12:13:45,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {2112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2112#true} is VALID [2018-11-23 12:13:45,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2018-11-23 12:13:45,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #78#return; {2112#true} is VALID [2018-11-23 12:13:45,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret12 := main(); {2112#true} is VALID [2018-11-23 12:13:45,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {2112#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {2112#true} is VALID [2018-11-23 12:13:45,370 INFO L256 TraceCheckUtils]: 6: Hoare triple {2112#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2112#true} is VALID [2018-11-23 12:13:45,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {2112#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2138#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:45,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {2138#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2138#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:45,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {2138#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:45,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {2145#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2145#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:45,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {2145#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2152#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:45,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {2152#(<= init_nondet_~i~0 2)} assume !(~i~0 < 60); {2113#false} is VALID [2018-11-23 12:13:45,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:45,380 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2113#false} {2112#true} #82#return; {2113#false} is VALID [2018-11-23 12:13:45,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {2113#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2113#false} is VALID [2018-11-23 12:13:45,380 INFO L256 TraceCheckUtils]: 16: Hoare triple {2113#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:45,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {2113#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; {2113#false} is VALID [2018-11-23 12:13:45,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {2113#false} assume !!(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {2113#false} assume !(~i~1 > 30); {2113#false} is VALID [2018-11-23 12:13:45,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:45,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {2113#false} assume !!(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {2113#false} assume ~i~1 > 30;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; {2113#false} is VALID [2018-11-23 12:13:45,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:45,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {2113#false} assume !(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {2113#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); {2113#false} is VALID [2018-11-23 12:13:45,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:45,382 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2113#false} {2113#false} #84#return; {2113#false} is VALID [2018-11-23 12:13:45,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {2113#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); {2113#false} is VALID [2018-11-23 12:13:45,382 INFO L256 TraceCheckUtils]: 29: Hoare triple {2113#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:45,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {2113#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; {2113#false} is VALID [2018-11-23 12:13:45,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {2113#false} assume !!(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {2113#false} assume !(~i~1 > 30); {2113#false} is VALID [2018-11-23 12:13:45,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:45,383 INFO L273 TraceCheckUtils]: 34: Hoare triple {2113#false} assume !!(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,383 INFO L273 TraceCheckUtils]: 35: Hoare triple {2113#false} assume ~i~1 > 30;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; {2113#false} is VALID [2018-11-23 12:13:45,384 INFO L273 TraceCheckUtils]: 36: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:45,384 INFO L273 TraceCheckUtils]: 37: Hoare triple {2113#false} assume !(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,384 INFO L273 TraceCheckUtils]: 38: Hoare triple {2113#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); {2113#false} is VALID [2018-11-23 12:13:45,384 INFO L273 TraceCheckUtils]: 39: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:45,385 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2113#false} {2113#false} #86#return; {2113#false} is VALID [2018-11-23 12:13:45,385 INFO L273 TraceCheckUtils]: 41: Hoare triple {2113#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; {2113#false} is VALID [2018-11-23 12:13:45,385 INFO L273 TraceCheckUtils]: 42: Hoare triple {2113#false} assume !!(~i~2 < 59);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; {2113#false} is VALID [2018-11-23 12:13:45,385 INFO L273 TraceCheckUtils]: 43: Hoare triple {2113#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2113#false} is VALID [2018-11-23 12:13:45,386 INFO L273 TraceCheckUtils]: 44: Hoare triple {2113#false} assume !(~i~2 < 59); {2113#false} is VALID [2018-11-23 12:13:45,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {2113#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2113#false} is VALID [2018-11-23 12:13:45,386 INFO L256 TraceCheckUtils]: 46: Hoare triple {2113#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:45,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {2113#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; {2113#false} is VALID [2018-11-23 12:13:45,387 INFO L273 TraceCheckUtils]: 48: Hoare triple {2113#false} assume !!(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {2113#false} assume !(~i~1 > 30); {2113#false} is VALID [2018-11-23 12:13:45,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:45,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {2113#false} assume !!(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {2113#false} assume ~i~1 > 30;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; {2113#false} is VALID [2018-11-23 12:13:45,388 INFO L273 TraceCheckUtils]: 53: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:45,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {2113#false} assume !(~i~1 < 60); {2113#false} is VALID [2018-11-23 12:13:45,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {2113#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); {2113#false} is VALID [2018-11-23 12:13:45,389 INFO L273 TraceCheckUtils]: 56: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:45,389 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2113#false} {2113#false} #88#return; {2113#false} is VALID [2018-11-23 12:13:45,389 INFO L273 TraceCheckUtils]: 58: Hoare triple {2113#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2113#false} is VALID [2018-11-23 12:13:45,389 INFO L273 TraceCheckUtils]: 59: Hoare triple {2113#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2113#false} is VALID [2018-11-23 12:13:45,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2018-11-23 12:13:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:13:45,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:45,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:45,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:13:45,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:45,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:45,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:45,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:45,500 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-23 12:13:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,701 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 12:13:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:45,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:13:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:45,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2018-11-23 12:13:45,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:45,792 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:13:45,792 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:13:45,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:13:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 12:13:45,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:45,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:45,823 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:45,823 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,826 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:13:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:13:45,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:45,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:45,827 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 12:13:45,827 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 12:13:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,829 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:13:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:13:45,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:45,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:45,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:45,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:13:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 12:13:45,831 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 61 [2018-11-23 12:13:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:45,832 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 12:13:45,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:13:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:13:45,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:45,833 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 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] [2018-11-23 12:13:45,833 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:45,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1929644946, now seen corresponding path program 3 times [2018-11-23 12:13:45,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:45,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:45,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:45,848 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:45,849 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:45,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:45,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:45,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:13:45,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:45,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:46,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {2544#true} call ULTIMATE.init(); {2544#true} is VALID [2018-11-23 12:13:46,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {2544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2544#true} is VALID [2018-11-23 12:13:46,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:46,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2544#true} {2544#true} #78#return; {2544#true} is VALID [2018-11-23 12:13:46,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {2544#true} call #t~ret12 := main(); {2544#true} is VALID [2018-11-23 12:13:46,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {2544#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {2544#true} is VALID [2018-11-23 12:13:46,055 INFO L256 TraceCheckUtils]: 6: Hoare triple {2544#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:46,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {2544#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2544#true} is VALID [2018-11-23 12:13:46,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {2544#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:46,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:46,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {2544#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:46,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:46,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {2544#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:46,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:46,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {2544#true} assume !(~i~0 < 60); {2544#true} is VALID [2018-11-23 12:13:46,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:46,056 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2544#true} {2544#true} #82#return; {2544#true} is VALID [2018-11-23 12:13:46,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2544#true} is VALID [2018-11-23 12:13:46,057 INFO L256 TraceCheckUtils]: 18: Hoare triple {2544#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:46,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#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; {2544#true} is VALID [2018-11-23 12:13:46,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#true} assume !!(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {2544#true} assume !(~i~1 > 30); {2544#true} is VALID [2018-11-23 12:13:46,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:46,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {2544#true} assume !!(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {2544#true} assume ~i~1 > 30;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; {2544#true} is VALID [2018-11-23 12:13:46,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:46,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {2544#true} assume !(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {2544#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); {2544#true} is VALID [2018-11-23 12:13:46,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:46,059 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2544#true} {2544#true} #84#return; {2544#true} is VALID [2018-11-23 12:13:46,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {2544#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); {2544#true} is VALID [2018-11-23 12:13:46,059 INFO L256 TraceCheckUtils]: 31: Hoare triple {2544#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:46,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {2544#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; {2544#true} is VALID [2018-11-23 12:13:46,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {2544#true} assume !!(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {2544#true} assume !(~i~1 > 30); {2544#true} is VALID [2018-11-23 12:13:46,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:46,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {2544#true} assume !!(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {2544#true} assume ~i~1 > 30;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; {2544#true} is VALID [2018-11-23 12:13:46,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:46,061 INFO L273 TraceCheckUtils]: 39: Hoare triple {2544#true} assume !(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,061 INFO L273 TraceCheckUtils]: 40: Hoare triple {2544#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); {2544#true} is VALID [2018-11-23 12:13:46,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:46,062 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2544#true} {2544#true} #86#return; {2544#true} is VALID [2018-11-23 12:13:46,062 INFO L273 TraceCheckUtils]: 43: Hoare triple {2544#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; {2544#true} is VALID [2018-11-23 12:13:46,062 INFO L273 TraceCheckUtils]: 44: Hoare triple {2544#true} assume !!(~i~2 < 59);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; {2544#true} is VALID [2018-11-23 12:13:46,062 INFO L273 TraceCheckUtils]: 45: Hoare triple {2544#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2544#true} is VALID [2018-11-23 12:13:46,062 INFO L273 TraceCheckUtils]: 46: Hoare triple {2544#true} assume !(~i~2 < 59); {2544#true} is VALID [2018-11-23 12:13:46,063 INFO L273 TraceCheckUtils]: 47: Hoare triple {2544#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2544#true} is VALID [2018-11-23 12:13:46,063 INFO L256 TraceCheckUtils]: 48: Hoare triple {2544#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:46,063 INFO L273 TraceCheckUtils]: 49: Hoare triple {2544#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; {2544#true} is VALID [2018-11-23 12:13:46,063 INFO L273 TraceCheckUtils]: 50: Hoare triple {2544#true} assume !!(~i~1 < 60); {2544#true} is VALID [2018-11-23 12:13:46,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {2544#true} assume !(~i~1 > 30); {2702#(<= rangesum_~i~1 30)} is VALID [2018-11-23 12:13:46,096 INFO L273 TraceCheckUtils]: 52: Hoare triple {2702#(<= rangesum_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2706#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:46,105 INFO L273 TraceCheckUtils]: 53: Hoare triple {2706#(<= rangesum_~i~1 31)} assume !!(~i~1 < 60); {2706#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:46,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {2706#(<= rangesum_~i~1 31)} assume ~i~1 > 30;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; {2706#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:46,128 INFO L273 TraceCheckUtils]: 55: Hoare triple {2706#(<= rangesum_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2716#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:46,139 INFO L273 TraceCheckUtils]: 56: Hoare triple {2716#(<= rangesum_~i~1 32)} assume !(~i~1 < 60); {2545#false} is VALID [2018-11-23 12:13:46,139 INFO L273 TraceCheckUtils]: 57: Hoare triple {2545#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); {2545#false} is VALID [2018-11-23 12:13:46,139 INFO L273 TraceCheckUtils]: 58: Hoare triple {2545#false} assume true; {2545#false} is VALID [2018-11-23 12:13:46,139 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {2545#false} {2544#true} #88#return; {2545#false} is VALID [2018-11-23 12:13:46,140 INFO L273 TraceCheckUtils]: 60: Hoare triple {2545#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2545#false} is VALID [2018-11-23 12:13:46,140 INFO L273 TraceCheckUtils]: 61: Hoare triple {2545#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2545#false} is VALID [2018-11-23 12:13:46,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2018-11-23 12:13:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-23 12:13:46,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:46,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:46,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 12:13:46,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:46,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:46,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:46,337 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-23 12:13:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:46,492 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-11-23 12:13:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:46,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 12:13:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 12:13:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 12:13:46,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-23 12:13:46,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:46,710 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:13:46,710 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:13:46,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:13:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 12:13:46,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:46,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 12:13:46,768 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 12:13:46,768 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 12:13:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:46,772 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:13:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:13:46,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:46,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:46,773 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 12:13:46,773 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 12:13:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:46,776 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:13:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:13:46,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:46,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:46,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:46,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:13:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 12:13:46,779 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2018-11-23 12:13:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:46,779 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 12:13:46,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:13:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:13:46,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:46,780 INFO L402 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] [2018-11-23 12:13:46,781 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:46,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash -575638740, now seen corresponding path program 4 times [2018-11-23 12:13:46,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:46,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:46,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:46,796 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:46,796 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:46,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:46,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:46,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:46,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:47,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {2994#true} call ULTIMATE.init(); {2994#true} is VALID [2018-11-23 12:13:47,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {2994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2994#true} is VALID [2018-11-23 12:13:47,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {2994#true} assume true; {2994#true} is VALID [2018-11-23 12:13:47,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2994#true} {2994#true} #78#return; {2994#true} is VALID [2018-11-23 12:13:47,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {2994#true} call #t~ret12 := main(); {2994#true} is VALID [2018-11-23 12:13:47,054 INFO L273 TraceCheckUtils]: 5: Hoare triple {2994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {2994#true} is VALID [2018-11-23 12:13:47,054 INFO L256 TraceCheckUtils]: 6: Hoare triple {2994#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2994#true} is VALID [2018-11-23 12:13:47,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {2994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2994#true} is VALID [2018-11-23 12:13:47,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {2994#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2994#true} is VALID [2018-11-23 12:13:47,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {2994#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2994#true} is VALID [2018-11-23 12:13:47,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {2994#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2994#true} is VALID [2018-11-23 12:13:47,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {2994#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2994#true} is VALID [2018-11-23 12:13:47,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {2994#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2994#true} is VALID [2018-11-23 12:13:47,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {2994#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2994#true} is VALID [2018-11-23 12:13:47,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {2994#true} assume !(~i~0 < 60); {2994#true} is VALID [2018-11-23 12:13:47,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {2994#true} assume true; {2994#true} is VALID [2018-11-23 12:13:47,057 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2994#true} {2994#true} #82#return; {2994#true} is VALID [2018-11-23 12:13:47,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {2994#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2994#true} is VALID [2018-11-23 12:13:47,057 INFO L256 TraceCheckUtils]: 18: Hoare triple {2994#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2994#true} is VALID [2018-11-23 12:13:47,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {2994#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; {2994#true} is VALID [2018-11-23 12:13:47,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {2994#true} assume !!(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {2994#true} assume !(~i~1 > 30); {2994#true} is VALID [2018-11-23 12:13:47,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {2994#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2994#true} is VALID [2018-11-23 12:13:47,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {2994#true} assume !!(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {2994#true} assume ~i~1 > 30;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; {2994#true} is VALID [2018-11-23 12:13:47,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {2994#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2994#true} is VALID [2018-11-23 12:13:47,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {2994#true} assume !!(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {2994#true} assume ~i~1 > 30;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; {2994#true} is VALID [2018-11-23 12:13:47,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {2994#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2994#true} is VALID [2018-11-23 12:13:47,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {2994#true} assume !(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {2994#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); {2994#true} is VALID [2018-11-23 12:13:47,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {2994#true} assume true; {2994#true} is VALID [2018-11-23 12:13:47,059 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2994#true} {2994#true} #84#return; {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {2994#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); {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L256 TraceCheckUtils]: 34: Hoare triple {2994#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {2994#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; {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {2994#true} assume !!(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {2994#true} assume !(~i~1 > 30); {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {2994#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2994#true} is VALID [2018-11-23 12:13:47,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {2994#true} assume !!(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,061 INFO L273 TraceCheckUtils]: 40: Hoare triple {2994#true} assume ~i~1 > 30;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; {2994#true} is VALID [2018-11-23 12:13:47,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {2994#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2994#true} is VALID [2018-11-23 12:13:47,062 INFO L273 TraceCheckUtils]: 42: Hoare triple {2994#true} assume !!(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,062 INFO L273 TraceCheckUtils]: 43: Hoare triple {2994#true} assume ~i~1 > 30;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; {2994#true} is VALID [2018-11-23 12:13:47,062 INFO L273 TraceCheckUtils]: 44: Hoare triple {2994#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2994#true} is VALID [2018-11-23 12:13:47,062 INFO L273 TraceCheckUtils]: 45: Hoare triple {2994#true} assume !(~i~1 < 60); {2994#true} is VALID [2018-11-23 12:13:47,062 INFO L273 TraceCheckUtils]: 46: Hoare triple {2994#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); {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L273 TraceCheckUtils]: 47: Hoare triple {2994#true} assume true; {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2994#true} {2994#true} #86#return; {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L273 TraceCheckUtils]: 49: Hoare triple {2994#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; {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L273 TraceCheckUtils]: 50: Hoare triple {2994#true} assume !!(~i~2 < 59);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; {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L273 TraceCheckUtils]: 51: Hoare triple {2994#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L273 TraceCheckUtils]: 52: Hoare triple {2994#true} assume !(~i~2 < 59); {2994#true} is VALID [2018-11-23 12:13:47,063 INFO L273 TraceCheckUtils]: 53: Hoare triple {2994#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2994#true} is VALID [2018-11-23 12:13:47,064 INFO L256 TraceCheckUtils]: 54: Hoare triple {2994#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2994#true} is VALID [2018-11-23 12:13:47,070 INFO L273 TraceCheckUtils]: 55: Hoare triple {2994#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; {3164#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:47,071 INFO L273 TraceCheckUtils]: 56: Hoare triple {3164#(<= rangesum_~i~1 0)} assume !!(~i~1 < 60); {3164#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:47,071 INFO L273 TraceCheckUtils]: 57: Hoare triple {3164#(<= rangesum_~i~1 0)} assume !(~i~1 > 30); {3164#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:47,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {3164#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3174#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:47,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {3174#(<= rangesum_~i~1 1)} assume !!(~i~1 < 60); {3174#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:47,092 INFO L273 TraceCheckUtils]: 60: Hoare triple {3174#(<= rangesum_~i~1 1)} assume ~i~1 > 30;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; {3174#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:47,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {3174#(<= rangesum_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3184#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:47,093 INFO L273 TraceCheckUtils]: 62: Hoare triple {3184#(<= rangesum_~i~1 2)} assume !!(~i~1 < 60); {3184#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:47,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {3184#(<= rangesum_~i~1 2)} assume ~i~1 > 30;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; {2995#false} is VALID [2018-11-23 12:13:47,094 INFO L273 TraceCheckUtils]: 64: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:47,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {2995#false} assume !(~i~1 < 60); {2995#false} is VALID [2018-11-23 12:13:47,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {2995#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); {2995#false} is VALID [2018-11-23 12:13:47,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {2995#false} assume true; {2995#false} is VALID [2018-11-23 12:13:47,095 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2995#false} {2994#true} #88#return; {2995#false} is VALID [2018-11-23 12:13:47,095 INFO L273 TraceCheckUtils]: 69: Hoare triple {2995#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2995#false} is VALID [2018-11-23 12:13:47,095 INFO L273 TraceCheckUtils]: 70: Hoare triple {2995#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2995#false} is VALID [2018-11-23 12:13:47,095 INFO L273 TraceCheckUtils]: 71: Hoare triple {2995#false} assume !false; {2995#false} is VALID [2018-11-23 12:13:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 79 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-23 12:13:47,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:47,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-23 12:13:47,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:47,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:47,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:47,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:47,164 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 5 states. [2018-11-23 12:13:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:47,446 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-23 12:13:47,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:47,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-23 12:13:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:47,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:13:47,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:47,614 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:13:47,614 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:13:47,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:13:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:13:47,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:47,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:13:47,666 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:13:47,666 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:13:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:47,669 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 12:13:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:13:47,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:47,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:47,670 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:13:47,670 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:13:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:47,672 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 12:13:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:13:47,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:47,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:47,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:47,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:13:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 12:13:47,675 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 72 [2018-11-23 12:13:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:47,675 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 12:13:47,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:13:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 12:13:47,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:47,677 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 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] [2018-11-23 12:13:47,677 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:47,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash 619731884, now seen corresponding path program 5 times [2018-11-23 12:13:47,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:47,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:47,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:47,691 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:47,692 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:47,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:47,707 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:47,727 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-23 12:13:47,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:47,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:47,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {3500#true} call ULTIMATE.init(); {3500#true} is VALID [2018-11-23 12:13:47,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {3500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3500#true} is VALID [2018-11-23 12:13:47,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {3500#true} assume true; {3500#true} is VALID [2018-11-23 12:13:47,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3500#true} {3500#true} #78#return; {3500#true} is VALID [2018-11-23 12:13:47,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {3500#true} call #t~ret12 := main(); {3500#true} is VALID [2018-11-23 12:13:47,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {3500#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {3500#true} is VALID [2018-11-23 12:13:47,880 INFO L256 TraceCheckUtils]: 6: Hoare triple {3500#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3500#true} is VALID [2018-11-23 12:13:47,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {3500#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3500#true} is VALID [2018-11-23 12:13:47,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {3500#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3500#true} is VALID [2018-11-23 12:13:47,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {3500#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3500#true} is VALID [2018-11-23 12:13:47,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {3500#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3500#true} is VALID [2018-11-23 12:13:47,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {3500#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3500#true} is VALID [2018-11-23 12:13:47,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {3500#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {3500#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {3500#true} assume !(~i~0 < 60); {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {3500#true} assume true; {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3500#true} {3500#true} #82#return; {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {3500#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L256 TraceCheckUtils]: 18: Hoare triple {3500#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {3500#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; {3500#true} is VALID [2018-11-23 12:13:47,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {3500#true} assume !!(~i~1 < 60); {3500#true} is VALID [2018-11-23 12:13:47,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {3500#true} assume !(~i~1 > 30); {3500#true} is VALID [2018-11-23 12:13:47,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {3500#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3500#true} is VALID [2018-11-23 12:13:47,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {3500#true} assume !!(~i~1 < 60); {3500#true} is VALID [2018-11-23 12:13:47,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {3500#true} assume !(~i~1 > 30); {3500#true} is VALID [2018-11-23 12:13:47,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {3500#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3500#true} is VALID [2018-11-23 12:13:47,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {3500#true} assume !!(~i~1 < 60); {3500#true} is VALID [2018-11-23 12:13:47,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {3500#true} assume !(~i~1 > 30); {3586#(<= rangesum_~i~1 30)} is VALID [2018-11-23 12:13:47,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {3586#(<= rangesum_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3590#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:47,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {3590#(<= rangesum_~i~1 31)} assume !!(~i~1 < 60); {3590#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:47,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {3590#(<= rangesum_~i~1 31)} assume ~i~1 > 30;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; {3590#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:47,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {3590#(<= rangesum_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3600#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:47,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {3600#(<= rangesum_~i~1 32)} assume !!(~i~1 < 60); {3600#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:47,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {3600#(<= rangesum_~i~1 32)} assume ~i~1 > 30;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; {3600#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:47,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {3600#(<= rangesum_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3610#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:13:47,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#(<= rangesum_~i~1 33)} assume !(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {3501#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); {3501#false} is VALID [2018-11-23 12:13:47,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {3501#false} assume true; {3501#false} is VALID [2018-11-23 12:13:47,888 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3501#false} {3500#true} #84#return; {3501#false} is VALID [2018-11-23 12:13:47,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {3501#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); {3501#false} is VALID [2018-11-23 12:13:47,888 INFO L256 TraceCheckUtils]: 40: Hoare triple {3501#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3501#false} is VALID [2018-11-23 12:13:47,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {3501#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; {3501#false} is VALID [2018-11-23 12:13:47,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,889 INFO L273 TraceCheckUtils]: 43: Hoare triple {3501#false} assume !(~i~1 > 30); {3501#false} is VALID [2018-11-23 12:13:47,889 INFO L273 TraceCheckUtils]: 44: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {3501#false} assume !(~i~1 > 30); {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {3501#false} assume !(~i~1 > 30); {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 51: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 52: Hoare triple {3501#false} assume ~i~1 > 30;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; {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 53: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 55: Hoare triple {3501#false} assume ~i~1 > 30;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; {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 56: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 57: Hoare triple {3501#false} assume !(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {3501#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); {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 59: Hoare triple {3501#false} assume true; {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {3501#false} {3501#false} #86#return; {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 61: Hoare triple {3501#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; {3501#false} is VALID [2018-11-23 12:13:47,891 INFO L273 TraceCheckUtils]: 62: Hoare triple {3501#false} assume !!(~i~2 < 59);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; {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 63: Hoare triple {3501#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 64: Hoare triple {3501#false} assume !(~i~2 < 59); {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 65: Hoare triple {3501#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L256 TraceCheckUtils]: 66: Hoare triple {3501#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 67: Hoare triple {3501#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; {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 68: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {3501#false} assume !(~i~1 > 30); {3501#false} is VALID [2018-11-23 12:13:47,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 72: Hoare triple {3501#false} assume !(~i~1 > 30); {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 73: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 74: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 75: Hoare triple {3501#false} assume !(~i~1 > 30); {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 76: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 77: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,893 INFO L273 TraceCheckUtils]: 78: Hoare triple {3501#false} assume ~i~1 > 30;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; {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 79: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 80: Hoare triple {3501#false} assume !!(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 81: Hoare triple {3501#false} assume ~i~1 > 30;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; {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 82: Hoare triple {3501#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 83: Hoare triple {3501#false} assume !(~i~1 < 60); {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 84: Hoare triple {3501#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); {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L273 TraceCheckUtils]: 85: Hoare triple {3501#false} assume true; {3501#false} is VALID [2018-11-23 12:13:47,894 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {3501#false} {3501#false} #88#return; {3501#false} is VALID [2018-11-23 12:13:47,895 INFO L273 TraceCheckUtils]: 87: Hoare triple {3501#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3501#false} is VALID [2018-11-23 12:13:47,895 INFO L273 TraceCheckUtils]: 88: Hoare triple {3501#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3501#false} is VALID [2018-11-23 12:13:47,895 INFO L273 TraceCheckUtils]: 89: Hoare triple {3501#false} assume !false; {3501#false} is VALID [2018-11-23 12:13:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 195 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-23 12:13:47,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:47,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:47,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-11-23 12:13:47,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:47,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:47,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:47,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:47,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:47,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:47,972 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-11-23 12:13:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:48,157 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-11-23 12:13:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:48,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-11-23 12:13:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:13:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:13:48,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 12:13:48,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:48,391 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:13:48,391 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:13:48,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:13:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 12:13:48,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:48,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-23 12:13:48,425 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-23 12:13:48,425 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-23 12:13:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:48,428 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 12:13:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:13:48,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:48,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:48,429 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-23 12:13:48,429 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-23 12:13:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:48,430 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 12:13:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:13:48,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:48,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:48,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:48,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:13:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-23 12:13:48,433 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 90 [2018-11-23 12:13:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:48,433 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 12:13:48,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 12:13:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 12:13:48,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:48,435 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 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] [2018-11-23 12:13:48,435 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:48,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1729394898, now seen corresponding path program 6 times [2018-11-23 12:13:48,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:48,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:48,450 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:48,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:48,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:48,476 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:13:48,519 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:13:48,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:48,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:48,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {4086#true} call ULTIMATE.init(); {4086#true} is VALID [2018-11-23 12:13:48,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {4086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4086#true} is VALID [2018-11-23 12:13:48,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {4086#true} assume true; {4086#true} is VALID [2018-11-23 12:13:48,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4086#true} {4086#true} #78#return; {4086#true} is VALID [2018-11-23 12:13:48,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {4086#true} call #t~ret12 := main(); {4086#true} is VALID [2018-11-23 12:13:48,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {4086#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {4086#true} is VALID [2018-11-23 12:13:48,778 INFO L256 TraceCheckUtils]: 6: Hoare triple {4086#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4086#true} is VALID [2018-11-23 12:13:48,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {4086#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4086#true} is VALID [2018-11-23 12:13:48,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {4086#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4086#true} is VALID [2018-11-23 12:13:48,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {4086#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4086#true} is VALID [2018-11-23 12:13:48,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {4086#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {4086#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {4086#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {4086#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {4086#true} assume !(~i~0 < 60); {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {4086#true} assume true; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4086#true} {4086#true} #82#return; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {4086#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4086#true} is VALID [2018-11-23 12:13:48,779 INFO L256 TraceCheckUtils]: 18: Hoare triple {4086#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4086#true} is VALID [2018-11-23 12:13:48,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {4086#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; {4086#true} is VALID [2018-11-23 12:13:48,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {4086#true} assume !(~i~1 > 30); {4086#true} is VALID [2018-11-23 12:13:48,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {4086#true} assume !(~i~1 > 30); {4086#true} is VALID [2018-11-23 12:13:48,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {4086#true} assume !(~i~1 > 30); {4086#true} is VALID [2018-11-23 12:13:48,781 INFO L273 TraceCheckUtils]: 28: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {4086#true} assume ~i~1 > 30;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; {4086#true} is VALID [2018-11-23 12:13:48,782 INFO L273 TraceCheckUtils]: 31: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,782 INFO L273 TraceCheckUtils]: 32: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {4086#true} assume ~i~1 > 30;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; {4086#true} is VALID [2018-11-23 12:13:48,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {4086#true} assume ~i~1 > 30;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; {4086#true} is VALID [2018-11-23 12:13:48,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {4086#true} assume !(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {4086#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); {4086#true} is VALID [2018-11-23 12:13:48,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {4086#true} assume true; {4086#true} is VALID [2018-11-23 12:13:48,783 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {4086#true} {4086#true} #84#return; {4086#true} is VALID [2018-11-23 12:13:48,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {4086#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); {4086#true} is VALID [2018-11-23 12:13:48,784 INFO L256 TraceCheckUtils]: 43: Hoare triple {4086#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4086#true} is VALID [2018-11-23 12:13:48,784 INFO L273 TraceCheckUtils]: 44: Hoare triple {4086#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; {4086#true} is VALID [2018-11-23 12:13:48,784 INFO L273 TraceCheckUtils]: 45: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,784 INFO L273 TraceCheckUtils]: 46: Hoare triple {4086#true} assume !(~i~1 > 30); {4086#true} is VALID [2018-11-23 12:13:48,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,785 INFO L273 TraceCheckUtils]: 48: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,785 INFO L273 TraceCheckUtils]: 49: Hoare triple {4086#true} assume !(~i~1 > 30); {4086#true} is VALID [2018-11-23 12:13:48,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,785 INFO L273 TraceCheckUtils]: 51: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,785 INFO L273 TraceCheckUtils]: 52: Hoare triple {4086#true} assume !(~i~1 > 30); {4086#true} is VALID [2018-11-23 12:13:48,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,786 INFO L273 TraceCheckUtils]: 55: Hoare triple {4086#true} assume ~i~1 > 30;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; {4086#true} is VALID [2018-11-23 12:13:48,786 INFO L273 TraceCheckUtils]: 56: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,786 INFO L273 TraceCheckUtils]: 57: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,786 INFO L273 TraceCheckUtils]: 58: Hoare triple {4086#true} assume ~i~1 > 30;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; {4086#true} is VALID [2018-11-23 12:13:48,787 INFO L273 TraceCheckUtils]: 59: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,787 INFO L273 TraceCheckUtils]: 60: Hoare triple {4086#true} assume !!(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,787 INFO L273 TraceCheckUtils]: 61: Hoare triple {4086#true} assume ~i~1 > 30;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; {4086#true} is VALID [2018-11-23 12:13:48,787 INFO L273 TraceCheckUtils]: 62: Hoare triple {4086#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4086#true} is VALID [2018-11-23 12:13:48,787 INFO L273 TraceCheckUtils]: 63: Hoare triple {4086#true} assume !(~i~1 < 60); {4086#true} is VALID [2018-11-23 12:13:48,787 INFO L273 TraceCheckUtils]: 64: Hoare triple {4086#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); {4086#true} is VALID [2018-11-23 12:13:48,788 INFO L273 TraceCheckUtils]: 65: Hoare triple {4086#true} assume true; {4086#true} is VALID [2018-11-23 12:13:48,788 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {4086#true} {4086#true} #86#return; {4086#true} is VALID [2018-11-23 12:13:48,803 INFO L273 TraceCheckUtils]: 67: Hoare triple {4086#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; {4292#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:48,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {4292#(<= main_~i~2 0)} assume !!(~i~2 < 59);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; {4292#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:48,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {4292#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4299#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:48,809 INFO L273 TraceCheckUtils]: 70: Hoare triple {4299#(<= main_~i~2 1)} assume !(~i~2 < 59); {4087#false} is VALID [2018-11-23 12:13:48,809 INFO L273 TraceCheckUtils]: 71: Hoare triple {4087#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L256 TraceCheckUtils]: 72: Hoare triple {4087#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {4087#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; {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 74: Hoare triple {4087#false} assume !!(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 75: Hoare triple {4087#false} assume !(~i~1 > 30); {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 76: Hoare triple {4087#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 77: Hoare triple {4087#false} assume !!(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 78: Hoare triple {4087#false} assume !(~i~1 > 30); {4087#false} is VALID [2018-11-23 12:13:48,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {4087#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 80: Hoare triple {4087#false} assume !!(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 81: Hoare triple {4087#false} assume !(~i~1 > 30); {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {4087#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 83: Hoare triple {4087#false} assume !!(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {4087#false} assume ~i~1 > 30;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; {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 85: Hoare triple {4087#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 86: Hoare triple {4087#false} assume !!(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,811 INFO L273 TraceCheckUtils]: 87: Hoare triple {4087#false} assume ~i~1 > 30;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; {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {4087#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {4087#false} assume !!(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 90: Hoare triple {4087#false} assume ~i~1 > 30;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; {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 91: Hoare triple {4087#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 92: Hoare triple {4087#false} assume !(~i~1 < 60); {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 93: Hoare triple {4087#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); {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L273 TraceCheckUtils]: 94: Hoare triple {4087#false} assume true; {4087#false} is VALID [2018-11-23 12:13:48,812 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {4087#false} {4087#false} #88#return; {4087#false} is VALID [2018-11-23 12:13:48,813 INFO L273 TraceCheckUtils]: 96: Hoare triple {4087#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4087#false} is VALID [2018-11-23 12:13:48,813 INFO L273 TraceCheckUtils]: 97: Hoare triple {4087#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4087#false} is VALID [2018-11-23 12:13:48,813 INFO L273 TraceCheckUtils]: 98: Hoare triple {4087#false} assume !false; {4087#false} is VALID [2018-11-23 12:13:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-11-23 12:13:48,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:48,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:48,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-23 12:13:48,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:48,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:48,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:48,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:48,897 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 4 states. [2018-11-23 12:13:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:49,057 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-11-23 12:13:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:49,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-23 12:13:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:13:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:13:49,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:13:49,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:49,117 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:13:49,117 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:13:49,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:13:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 12:13:49,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:49,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-23 12:13:49,165 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-23 12:13:49,165 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-23 12:13:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:49,167 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 12:13:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 12:13:49,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:49,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:49,168 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-23 12:13:49,168 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-23 12:13:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:49,170 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 12:13:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 12:13:49,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:49,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:49,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:49,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:13:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-23 12:13:49,172 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 99 [2018-11-23 12:13:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:49,173 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 12:13:49,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:13:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:13:49,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:49,174 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 3, 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] [2018-11-23 12:13:49,174 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:49,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash -458602804, now seen corresponding path program 7 times [2018-11-23 12:13:49,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:49,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:49,188 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:49,188 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:49,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:49,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:49,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:49,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {4699#true} call ULTIMATE.init(); {4699#true} is VALID [2018-11-23 12:13:49,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {4699#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4699#true} is VALID [2018-11-23 12:13:49,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {4699#true} assume true; {4699#true} is VALID [2018-11-23 12:13:49,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4699#true} {4699#true} #78#return; {4699#true} is VALID [2018-11-23 12:13:49,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {4699#true} call #t~ret12 := main(); {4699#true} is VALID [2018-11-23 12:13:49,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {4699#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {4699#true} is VALID [2018-11-23 12:13:49,556 INFO L256 TraceCheckUtils]: 6: Hoare triple {4699#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4699#true} is VALID [2018-11-23 12:13:49,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {4699#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4725#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:49,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {4725#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4725#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:49,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {4725#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4732#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:49,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {4732#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4732#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:49,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {4732#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4739#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:49,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {4739#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4739#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:49,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {4739#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4746#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:49,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {4746#(<= init_nondet_~i~0 3)} assume !(~i~0 < 60); {4700#false} is VALID [2018-11-23 12:13:49,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {4700#false} assume true; {4700#false} is VALID [2018-11-23 12:13:49,561 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4700#false} {4699#true} #82#return; {4700#false} is VALID [2018-11-23 12:13:49,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {4700#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4700#false} is VALID [2018-11-23 12:13:49,561 INFO L256 TraceCheckUtils]: 18: Hoare triple {4700#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4700#false} is VALID [2018-11-23 12:13:49,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {4700#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; {4700#false} is VALID [2018-11-23 12:13:49,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {4700#false} assume !(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {4700#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); {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {4700#false} assume true; {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {4700#false} {4700#false} #84#return; {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {4700#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); {4700#false} is VALID [2018-11-23 12:13:49,565 INFO L256 TraceCheckUtils]: 43: Hoare triple {4700#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4700#false} is VALID [2018-11-23 12:13:49,566 INFO L273 TraceCheckUtils]: 44: Hoare triple {4700#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; {4700#false} is VALID [2018-11-23 12:13:49,566 INFO L273 TraceCheckUtils]: 45: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,567 INFO L273 TraceCheckUtils]: 51: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,567 INFO L273 TraceCheckUtils]: 52: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,568 INFO L273 TraceCheckUtils]: 55: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,568 INFO L273 TraceCheckUtils]: 56: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,568 INFO L273 TraceCheckUtils]: 57: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,569 INFO L273 TraceCheckUtils]: 61: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,569 INFO L273 TraceCheckUtils]: 62: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,569 INFO L273 TraceCheckUtils]: 63: Hoare triple {4700#false} assume !(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,569 INFO L273 TraceCheckUtils]: 64: Hoare triple {4700#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); {4700#false} is VALID [2018-11-23 12:13:49,569 INFO L273 TraceCheckUtils]: 65: Hoare triple {4700#false} assume true; {4700#false} is VALID [2018-11-23 12:13:49,570 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {4700#false} {4700#false} #86#return; {4700#false} is VALID [2018-11-23 12:13:49,570 INFO L273 TraceCheckUtils]: 67: Hoare triple {4700#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; {4700#false} is VALID [2018-11-23 12:13:49,570 INFO L273 TraceCheckUtils]: 68: Hoare triple {4700#false} assume !!(~i~2 < 59);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; {4700#false} is VALID [2018-11-23 12:13:49,570 INFO L273 TraceCheckUtils]: 69: Hoare triple {4700#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4700#false} is VALID [2018-11-23 12:13:49,570 INFO L273 TraceCheckUtils]: 70: Hoare triple {4700#false} assume !!(~i~2 < 59);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; {4700#false} is VALID [2018-11-23 12:13:49,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {4700#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4700#false} is VALID [2018-11-23 12:13:49,571 INFO L273 TraceCheckUtils]: 72: Hoare triple {4700#false} assume !(~i~2 < 59); {4700#false} is VALID [2018-11-23 12:13:49,571 INFO L273 TraceCheckUtils]: 73: Hoare triple {4700#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {4700#false} is VALID [2018-11-23 12:13:49,571 INFO L256 TraceCheckUtils]: 74: Hoare triple {4700#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4700#false} is VALID [2018-11-23 12:13:49,571 INFO L273 TraceCheckUtils]: 75: Hoare triple {4700#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; {4700#false} is VALID [2018-11-23 12:13:49,571 INFO L273 TraceCheckUtils]: 76: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,571 INFO L273 TraceCheckUtils]: 77: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,572 INFO L273 TraceCheckUtils]: 78: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,572 INFO L273 TraceCheckUtils]: 79: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,572 INFO L273 TraceCheckUtils]: 80: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,572 INFO L273 TraceCheckUtils]: 81: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,572 INFO L273 TraceCheckUtils]: 82: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,572 INFO L273 TraceCheckUtils]: 83: Hoare triple {4700#false} assume !(~i~1 > 30); {4700#false} is VALID [2018-11-23 12:13:49,573 INFO L273 TraceCheckUtils]: 84: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,573 INFO L273 TraceCheckUtils]: 85: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,573 INFO L273 TraceCheckUtils]: 86: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,573 INFO L273 TraceCheckUtils]: 87: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,573 INFO L273 TraceCheckUtils]: 88: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,573 INFO L273 TraceCheckUtils]: 89: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,574 INFO L273 TraceCheckUtils]: 90: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,574 INFO L273 TraceCheckUtils]: 91: Hoare triple {4700#false} assume !!(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,574 INFO L273 TraceCheckUtils]: 92: Hoare triple {4700#false} assume ~i~1 > 30;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; {4700#false} is VALID [2018-11-23 12:13:49,574 INFO L273 TraceCheckUtils]: 93: Hoare triple {4700#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4700#false} is VALID [2018-11-23 12:13:49,574 INFO L273 TraceCheckUtils]: 94: Hoare triple {4700#false} assume !(~i~1 < 60); {4700#false} is VALID [2018-11-23 12:13:49,574 INFO L273 TraceCheckUtils]: 95: Hoare triple {4700#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); {4700#false} is VALID [2018-11-23 12:13:49,575 INFO L273 TraceCheckUtils]: 96: Hoare triple {4700#false} assume true; {4700#false} is VALID [2018-11-23 12:13:49,575 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {4700#false} {4700#false} #88#return; {4700#false} is VALID [2018-11-23 12:13:49,575 INFO L273 TraceCheckUtils]: 98: Hoare triple {4700#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4700#false} is VALID [2018-11-23 12:13:49,575 INFO L273 TraceCheckUtils]: 99: Hoare triple {4700#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4700#false} is VALID [2018-11-23 12:13:49,575 INFO L273 TraceCheckUtils]: 100: Hoare triple {4700#false} assume !false; {4700#false} is VALID [2018-11-23 12:13:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-23 12:13:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:49,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:49,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-23 12:13:49,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:49,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:49,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:49,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:49,709 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-11-23 12:13:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:49,910 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-11-23 12:13:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:49,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-23 12:13:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 12:13:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 12:13:49,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2018-11-23 12:13:50,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:50,088 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:13:50,089 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:13:50,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:13:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 12:13:50,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:50,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 12:13:50,121 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 12:13:50,121 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 12:13:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:50,123 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 12:13:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:13:50,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:50,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:50,124 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 12:13:50,124 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 12:13:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:50,126 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 12:13:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:13:50,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:50,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:50,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:50,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:13:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-23 12:13:50,130 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 101 [2018-11-23 12:13:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:50,130 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-23 12:13:50,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-23 12:13:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:13:50,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:50,132 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 4, 4, 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] [2018-11-23 12:13:50,132 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:50,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1508067766, now seen corresponding path program 8 times [2018-11-23 12:13:50,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:50,160 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:50,160 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:50,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:50,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:50,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:50,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:50,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:50,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {5347#true} call ULTIMATE.init(); {5347#true} is VALID [2018-11-23 12:13:50,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {5347#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5347#true} is VALID [2018-11-23 12:13:50,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {5347#true} assume true; {5347#true} is VALID [2018-11-23 12:13:50,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5347#true} {5347#true} #78#return; {5347#true} is VALID [2018-11-23 12:13:50,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {5347#true} call #t~ret12 := main(); {5347#true} is VALID [2018-11-23 12:13:50,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {5347#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {5347#true} is VALID [2018-11-23 12:13:50,413 INFO L256 TraceCheckUtils]: 6: Hoare triple {5347#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5347#true} is VALID [2018-11-23 12:13:50,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {5347#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5373#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:50,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {5373#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5373#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:50,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {5373#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5380#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:50,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {5380#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5380#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:50,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {5380#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5387#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:50,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {5387#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5387#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:50,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {5387#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:50,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {5394#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5394#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:50,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {5394#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:50,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {5401#(<= init_nondet_~i~0 4)} assume !(~i~0 < 60); {5348#false} is VALID [2018-11-23 12:13:50,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {5348#false} assume true; {5348#false} is VALID [2018-11-23 12:13:50,420 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {5348#false} {5347#true} #82#return; {5348#false} is VALID [2018-11-23 12:13:50,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {5348#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5348#false} is VALID [2018-11-23 12:13:50,421 INFO L256 TraceCheckUtils]: 20: Hoare triple {5348#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5348#false} is VALID [2018-11-23 12:13:50,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {5348#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; {5348#false} is VALID [2018-11-23 12:13:50,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 36: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,424 INFO L273 TraceCheckUtils]: 37: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,425 INFO L273 TraceCheckUtils]: 39: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {5348#false} assume !(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,425 INFO L273 TraceCheckUtils]: 41: Hoare triple {5348#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); {5348#false} is VALID [2018-11-23 12:13:50,425 INFO L273 TraceCheckUtils]: 42: Hoare triple {5348#false} assume true; {5348#false} is VALID [2018-11-23 12:13:50,425 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {5348#false} {5348#false} #84#return; {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {5348#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); {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L256 TraceCheckUtils]: 45: Hoare triple {5348#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {5348#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; {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,426 INFO L273 TraceCheckUtils]: 50: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,428 INFO L273 TraceCheckUtils]: 63: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {5348#false} assume !(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L273 TraceCheckUtils]: 66: Hoare triple {5348#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); {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L273 TraceCheckUtils]: 67: Hoare triple {5348#false} assume true; {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {5348#false} {5348#false} #86#return; {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {5348#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; {5348#false} is VALID [2018-11-23 12:13:50,429 INFO L273 TraceCheckUtils]: 70: Hoare triple {5348#false} assume !!(~i~2 < 59);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; {5348#false} is VALID [2018-11-23 12:13:50,430 INFO L273 TraceCheckUtils]: 71: Hoare triple {5348#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5348#false} is VALID [2018-11-23 12:13:50,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {5348#false} assume !!(~i~2 < 59);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; {5348#false} is VALID [2018-11-23 12:13:50,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {5348#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5348#false} is VALID [2018-11-23 12:13:50,430 INFO L273 TraceCheckUtils]: 74: Hoare triple {5348#false} assume !(~i~2 < 59); {5348#false} is VALID [2018-11-23 12:13:50,430 INFO L273 TraceCheckUtils]: 75: Hoare triple {5348#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {5348#false} is VALID [2018-11-23 12:13:50,430 INFO L256 TraceCheckUtils]: 76: Hoare triple {5348#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {5348#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; {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 79: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 80: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 82: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,431 INFO L273 TraceCheckUtils]: 83: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 84: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 85: Hoare triple {5348#false} assume !(~i~1 > 30); {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 86: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 87: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 88: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 89: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,432 INFO L273 TraceCheckUtils]: 90: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,433 INFO L273 TraceCheckUtils]: 91: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,433 INFO L273 TraceCheckUtils]: 92: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,433 INFO L273 TraceCheckUtils]: 93: Hoare triple {5348#false} assume !!(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,433 INFO L273 TraceCheckUtils]: 94: Hoare triple {5348#false} assume ~i~1 > 30;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; {5348#false} is VALID [2018-11-23 12:13:50,433 INFO L273 TraceCheckUtils]: 95: Hoare triple {5348#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5348#false} is VALID [2018-11-23 12:13:50,433 INFO L273 TraceCheckUtils]: 96: Hoare triple {5348#false} assume !(~i~1 < 60); {5348#false} is VALID [2018-11-23 12:13:50,434 INFO L273 TraceCheckUtils]: 97: Hoare triple {5348#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); {5348#false} is VALID [2018-11-23 12:13:50,434 INFO L273 TraceCheckUtils]: 98: Hoare triple {5348#false} assume true; {5348#false} is VALID [2018-11-23 12:13:50,434 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {5348#false} {5348#false} #88#return; {5348#false} is VALID [2018-11-23 12:13:50,434 INFO L273 TraceCheckUtils]: 100: Hoare triple {5348#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5348#false} is VALID [2018-11-23 12:13:50,434 INFO L273 TraceCheckUtils]: 101: Hoare triple {5348#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5348#false} is VALID [2018-11-23 12:13:50,434 INFO L273 TraceCheckUtils]: 102: Hoare triple {5348#false} assume !false; {5348#false} is VALID [2018-11-23 12:13:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-23 12:13:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:13:50,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-23 12:13:50,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:50,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:13:50,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:50,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:13:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:13:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:50,523 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-11-23 12:13:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:50,698 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-11-23 12:13:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:13:50,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-23 12:13:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-23 12:13:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-23 12:13:50,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2018-11-23 12:13:50,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:50,824 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:13:50,824 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:13:50,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:13:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 12:13:51,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:51,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 12:13:51,388 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 12:13:51,388 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 12:13:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:51,391 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:13:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:13:51,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:51,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:51,392 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 12:13:51,392 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 12:13:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:51,394 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:13:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:13:51,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:51,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:51,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:51,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:13:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-23 12:13:51,398 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 103 [2018-11-23 12:13:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:51,398 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-23 12:13:51,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:13:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:13:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 12:13:51,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:51,400 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 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] [2018-11-23 12:13:51,400 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -726581688, now seen corresponding path program 9 times [2018-11-23 12:13:51,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:51,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:51,415 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:51,415 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:51,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:51,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:51,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:13:51,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:51,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:51,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6012#true} is VALID [2018-11-23 12:13:51,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {6012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6012#true} is VALID [2018-11-23 12:13:51,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2018-11-23 12:13:51,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #78#return; {6012#true} is VALID [2018-11-23 12:13:51,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret12 := main(); {6012#true} is VALID [2018-11-23 12:13:51,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {6012#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {6012#true} is VALID [2018-11-23 12:13:51,661 INFO L256 TraceCheckUtils]: 6: Hoare triple {6012#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6012#true} is VALID [2018-11-23 12:13:51,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {6012#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {6012#true} is VALID [2018-11-23 12:13:51,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {6012#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6012#true} is VALID [2018-11-23 12:13:51,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {6012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#true} is VALID [2018-11-23 12:13:51,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {6012#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6012#true} is VALID [2018-11-23 12:13:51,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {6012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#true} is VALID [2018-11-23 12:13:51,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {6012#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6012#true} is VALID [2018-11-23 12:13:51,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {6012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#true} is VALID [2018-11-23 12:13:51,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {6012#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6012#true} is VALID [2018-11-23 12:13:51,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {6012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#true} is VALID [2018-11-23 12:13:51,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {6012#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {6012#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {6012#true} assume !(~i~0 < 60); {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {6012#true} assume true; {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6012#true} {6012#true} #82#return; {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {6012#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L256 TraceCheckUtils]: 22: Hoare triple {6012#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {6012#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; {6012#true} is VALID [2018-11-23 12:13:51,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {6012#true} assume !(~i~1 > 30); {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {6012#true} assume !(~i~1 > 30); {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {6012#true} assume !(~i~1 > 30); {6012#true} is VALID [2018-11-23 12:13:51,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {6012#true} assume ~i~1 > 30;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; {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {6012#true} assume ~i~1 > 30;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; {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {6012#true} assume ~i~1 > 30;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; {6012#true} is VALID [2018-11-23 12:13:51,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L273 TraceCheckUtils]: 42: Hoare triple {6012#true} assume !(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {6012#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); {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {6012#true} assume true; {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {6012#true} {6012#true} #84#return; {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {6012#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); {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L256 TraceCheckUtils]: 47: Hoare triple {6012#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L273 TraceCheckUtils]: 48: Hoare triple {6012#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; {6012#true} is VALID [2018-11-23 12:13:51,667 INFO L273 TraceCheckUtils]: 49: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {6012#true} assume !(~i~1 > 30); {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {6012#true} assume !(~i~1 > 30); {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 55: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {6012#true} assume !(~i~1 > 30); {6012#true} is VALID [2018-11-23 12:13:51,668 INFO L273 TraceCheckUtils]: 57: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 59: Hoare triple {6012#true} assume ~i~1 > 30;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; {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 60: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 62: Hoare triple {6012#true} assume ~i~1 > 30;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; {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 63: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 64: Hoare triple {6012#true} assume !!(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 65: Hoare triple {6012#true} assume ~i~1 > 30;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; {6012#true} is VALID [2018-11-23 12:13:51,669 INFO L273 TraceCheckUtils]: 66: Hoare triple {6012#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6012#true} is VALID [2018-11-23 12:13:51,670 INFO L273 TraceCheckUtils]: 67: Hoare triple {6012#true} assume !(~i~1 < 60); {6012#true} is VALID [2018-11-23 12:13:51,670 INFO L273 TraceCheckUtils]: 68: Hoare triple {6012#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); {6012#true} is VALID [2018-11-23 12:13:51,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {6012#true} assume true; {6012#true} is VALID [2018-11-23 12:13:51,670 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {6012#true} {6012#true} #86#return; {6012#true} is VALID [2018-11-23 12:13:51,671 INFO L273 TraceCheckUtils]: 71: Hoare triple {6012#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; {6230#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:51,671 INFO L273 TraceCheckUtils]: 72: Hoare triple {6230#(<= main_~i~2 0)} assume !!(~i~2 < 59);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; {6230#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:51,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {6230#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6237#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:51,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {6237#(<= main_~i~2 1)} assume !!(~i~2 < 59);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; {6237#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:51,675 INFO L273 TraceCheckUtils]: 75: Hoare triple {6237#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6244#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:51,675 INFO L273 TraceCheckUtils]: 76: Hoare triple {6244#(<= main_~i~2 2)} assume !(~i~2 < 59); {6013#false} is VALID [2018-11-23 12:13:51,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {6013#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {6013#false} is VALID [2018-11-23 12:13:51,675 INFO L256 TraceCheckUtils]: 78: Hoare triple {6013#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6013#false} is VALID [2018-11-23 12:13:51,675 INFO L273 TraceCheckUtils]: 79: Hoare triple {6013#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; {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {6013#false} assume !!(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 81: Hoare triple {6013#false} assume !(~i~1 > 30); {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 82: Hoare triple {6013#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 83: Hoare triple {6013#false} assume !!(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 84: Hoare triple {6013#false} assume !(~i~1 > 30); {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 85: Hoare triple {6013#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 86: Hoare triple {6013#false} assume !!(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,676 INFO L273 TraceCheckUtils]: 87: Hoare triple {6013#false} assume !(~i~1 > 30); {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 88: Hoare triple {6013#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 89: Hoare triple {6013#false} assume !!(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 90: Hoare triple {6013#false} assume ~i~1 > 30;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; {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 91: Hoare triple {6013#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 92: Hoare triple {6013#false} assume !!(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 93: Hoare triple {6013#false} assume ~i~1 > 30;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; {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 94: Hoare triple {6013#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 95: Hoare triple {6013#false} assume !!(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,677 INFO L273 TraceCheckUtils]: 96: Hoare triple {6013#false} assume ~i~1 > 30;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; {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 97: Hoare triple {6013#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 98: Hoare triple {6013#false} assume !(~i~1 < 60); {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 99: Hoare triple {6013#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); {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 100: Hoare triple {6013#false} assume true; {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {6013#false} {6013#false} #88#return; {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 102: Hoare triple {6013#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 103: Hoare triple {6013#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6013#false} is VALID [2018-11-23 12:13:51,678 INFO L273 TraceCheckUtils]: 104: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2018-11-23 12:13:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-11-23 12:13:51,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:51,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:51,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-23 12:13:51,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:51,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:51,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:51,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:51,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:51,783 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 5 states. [2018-11-23 12:13:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:51,958 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-11-23 12:13:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:51,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-23 12:13:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:13:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:13:51,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-23 12:13:52,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:52,015 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:13:52,015 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:13:52,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:13:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 12:13:52,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:52,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-23 12:13:52,045 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-23 12:13:52,045 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-23 12:13:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:52,046 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-23 12:13:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-23 12:13:52,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:52,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:52,047 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-23 12:13:52,047 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-23 12:13:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:52,049 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-23 12:13:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-23 12:13:52,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:52,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:52,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:52,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:13:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-23 12:13:52,052 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 105 [2018-11-23 12:13:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:52,052 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-23 12:13:52,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:13:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 12:13:52,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:52,054 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 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] [2018-11-23 12:13:52,054 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:52,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1172217702, now seen corresponding path program 10 times [2018-11-23 12:13:52,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:52,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:52,067 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:52,068 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:52,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:52,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:52,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:52,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:52,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {6674#true} call ULTIMATE.init(); {6674#true} is VALID [2018-11-23 12:13:52,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {6674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6674#true} is VALID [2018-11-23 12:13:52,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {6674#true} assume true; {6674#true} is VALID [2018-11-23 12:13:52,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6674#true} {6674#true} #78#return; {6674#true} is VALID [2018-11-23 12:13:52,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {6674#true} call #t~ret12 := main(); {6674#true} is VALID [2018-11-23 12:13:52,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {6674#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {6674#true} is VALID [2018-11-23 12:13:52,620 INFO L256 TraceCheckUtils]: 6: Hoare triple {6674#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6674#true} is VALID [2018-11-23 12:13:52,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {6674#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {6700#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:52,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {6700#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6700#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:52,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {6700#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:52,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {6707#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6707#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:52,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {6707#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6714#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:52,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {6714#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6714#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:52,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {6714#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6721#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:52,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {6721#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6721#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:52,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {6721#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6728#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:52,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {6728#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6728#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:52,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {6728#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6735#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:52,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {6735#(<= init_nondet_~i~0 5)} assume !(~i~0 < 60); {6675#false} is VALID [2018-11-23 12:13:52,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {6675#false} assume true; {6675#false} is VALID [2018-11-23 12:13:52,627 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6675#false} {6674#true} #82#return; {6675#false} is VALID [2018-11-23 12:13:52,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {6675#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6675#false} is VALID [2018-11-23 12:13:52,627 INFO L256 TraceCheckUtils]: 22: Hoare triple {6675#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6675#false} is VALID [2018-11-23 12:13:52,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {6675#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; {6675#false} is VALID [2018-11-23 12:13:52,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,628 INFO L273 TraceCheckUtils]: 25: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,628 INFO L273 TraceCheckUtils]: 26: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,629 INFO L273 TraceCheckUtils]: 30: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,629 INFO L273 TraceCheckUtils]: 31: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,629 INFO L273 TraceCheckUtils]: 32: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,629 INFO L273 TraceCheckUtils]: 33: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,630 INFO L273 TraceCheckUtils]: 34: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,630 INFO L273 TraceCheckUtils]: 36: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,630 INFO L273 TraceCheckUtils]: 37: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,630 INFO L273 TraceCheckUtils]: 38: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 39: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 40: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 41: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 42: Hoare triple {6675#false} assume !(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 43: Hoare triple {6675#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); {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 44: Hoare triple {6675#false} assume true; {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {6675#false} {6675#false} #84#return; {6675#false} is VALID [2018-11-23 12:13:52,631 INFO L273 TraceCheckUtils]: 46: Hoare triple {6675#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); {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L256 TraceCheckUtils]: 47: Hoare triple {6675#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {6675#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; {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 49: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 50: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 52: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 53: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 54: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,632 INFO L273 TraceCheckUtils]: 55: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 56: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 57: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 58: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 59: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 60: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 61: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 62: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,633 INFO L273 TraceCheckUtils]: 63: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 64: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 65: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 66: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {6675#false} assume !(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {6675#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); {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 69: Hoare triple {6675#false} assume true; {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {6675#false} {6675#false} #86#return; {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 71: Hoare triple {6675#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; {6675#false} is VALID [2018-11-23 12:13:52,634 INFO L273 TraceCheckUtils]: 72: Hoare triple {6675#false} assume !!(~i~2 < 59);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; {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 73: Hoare triple {6675#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 74: Hoare triple {6675#false} assume !!(~i~2 < 59);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; {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 75: Hoare triple {6675#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 76: Hoare triple {6675#false} assume !!(~i~2 < 59);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; {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 77: Hoare triple {6675#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 78: Hoare triple {6675#false} assume !(~i~2 < 59); {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L273 TraceCheckUtils]: 79: Hoare triple {6675#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {6675#false} is VALID [2018-11-23 12:13:52,635 INFO L256 TraceCheckUtils]: 80: Hoare triple {6675#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 81: Hoare triple {6675#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; {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 82: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 83: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 84: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 85: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 86: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 87: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,636 INFO L273 TraceCheckUtils]: 88: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 89: Hoare triple {6675#false} assume !(~i~1 > 30); {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 90: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 91: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 92: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 93: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 94: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 95: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 96: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,637 INFO L273 TraceCheckUtils]: 97: Hoare triple {6675#false} assume !!(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 98: Hoare triple {6675#false} assume ~i~1 > 30;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; {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 99: Hoare triple {6675#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 100: Hoare triple {6675#false} assume !(~i~1 < 60); {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 101: Hoare triple {6675#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); {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 102: Hoare triple {6675#false} assume true; {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {6675#false} {6675#false} #88#return; {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 104: Hoare triple {6675#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6675#false} is VALID [2018-11-23 12:13:52,638 INFO L273 TraceCheckUtils]: 105: Hoare triple {6675#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6675#false} is VALID [2018-11-23 12:13:52,639 INFO L273 TraceCheckUtils]: 106: Hoare triple {6675#false} assume !false; {6675#false} is VALID [2018-11-23 12:13:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2018-11-23 12:13:52,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:52,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:13:52,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-11-23 12:13:52,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:52,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:13:52,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:52,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:13:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:13:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:52,706 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2018-11-23 12:13:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:53,076 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-11-23 12:13:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:13:53,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-11-23 12:13:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2018-11-23 12:13:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2018-11-23 12:13:53,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2018-11-23 12:13:53,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:53,496 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:13:53,496 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:13:53,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:13:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 12:13:53,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:53,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2018-11-23 12:13:53,545 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2018-11-23 12:13:53,545 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2018-11-23 12:13:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:53,547 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:13:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:13:53,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:53,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:53,548 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2018-11-23 12:13:53,548 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2018-11-23 12:13:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:53,550 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:13:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:13:53,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:53,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:53,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:53,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:13:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-23 12:13:53,552 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 107 [2018-11-23 12:13:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:53,553 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-23 12:13:53,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:13:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 12:13:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:13:53,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:53,554 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 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] [2018-11-23 12:13:53,554 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:53,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2032994204, now seen corresponding path program 11 times [2018-11-23 12:13:53,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:53,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:53,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:53,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:53,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:53,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:13:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:53,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 12:13:53,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:53,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:54,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {7375#true} call ULTIMATE.init(); {7375#true} is VALID [2018-11-23 12:13:54,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {7375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {7375#true} assume true; {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7375#true} {7375#true} #78#return; {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L256 TraceCheckUtils]: 4: Hoare triple {7375#true} call #t~ret12 := main(); {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {7375#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L256 TraceCheckUtils]: 6: Hoare triple {7375#true} call init_nondet(~#x~0.base, ~#x~0.offset); {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {7375#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {7375#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7375#true} is VALID [2018-11-23 12:13:54,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {7375#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {7375#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {7375#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {7375#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {7375#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {7375#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {7375#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {7375#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {7375#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7375#true} is VALID [2018-11-23 12:13:54,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {7375#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {7375#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {7375#true} assume !(~i~0 < 60); {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {7375#true} assume true; {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {7375#true} {7375#true} #82#return; {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {7375#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L256 TraceCheckUtils]: 24: Hoare triple {7375#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {7375#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; {7375#true} is VALID [2018-11-23 12:13:54,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {7375#true} assume !!(~i~1 < 60); {7375#true} is VALID [2018-11-23 12:13:54,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {7375#true} assume !(~i~1 > 30); {7375#true} is VALID [2018-11-23 12:13:54,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {7375#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7375#true} is VALID [2018-11-23 12:13:54,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {7375#true} assume !!(~i~1 < 60); {7375#true} is VALID [2018-11-23 12:13:54,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {7375#true} assume !(~i~1 > 30); {7375#true} is VALID [2018-11-23 12:13:54,099 INFO L273 TraceCheckUtils]: 31: Hoare triple {7375#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7375#true} is VALID [2018-11-23 12:13:54,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {7375#true} assume !!(~i~1 < 60); {7375#true} is VALID [2018-11-23 12:13:54,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {7375#true} assume !(~i~1 > 30); {7479#(<= rangesum_~i~1 30)} is VALID [2018-11-23 12:13:54,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {7479#(<= rangesum_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7483#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:54,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {7483#(<= rangesum_~i~1 31)} assume !!(~i~1 < 60); {7483#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:54,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {7483#(<= rangesum_~i~1 31)} assume ~i~1 > 30;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; {7483#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:13:54,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {7483#(<= rangesum_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7493#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:54,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {7493#(<= rangesum_~i~1 32)} assume !!(~i~1 < 60); {7493#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:54,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {7493#(<= rangesum_~i~1 32)} assume ~i~1 > 30;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; {7493#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:13:54,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {7493#(<= rangesum_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7503#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:13:54,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {7503#(<= rangesum_~i~1 33)} assume !!(~i~1 < 60); {7503#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:13:54,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {7503#(<= rangesum_~i~1 33)} assume ~i~1 > 30;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; {7503#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:13:54,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {7503#(<= rangesum_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7513#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:13:54,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {7513#(<= rangesum_~i~1 34)} assume !(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {7376#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); {7376#false} is VALID [2018-11-23 12:13:54,105 INFO L273 TraceCheckUtils]: 46: Hoare triple {7376#false} assume true; {7376#false} is VALID [2018-11-23 12:13:54,105 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {7376#false} {7375#true} #84#return; {7376#false} is VALID [2018-11-23 12:13:54,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {7376#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); {7376#false} is VALID [2018-11-23 12:13:54,106 INFO L256 TraceCheckUtils]: 49: Hoare triple {7376#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {7376#false} is VALID [2018-11-23 12:13:54,106 INFO L273 TraceCheckUtils]: 50: Hoare triple {7376#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; {7376#false} is VALID [2018-11-23 12:13:54,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {7376#false} assume !(~i~1 > 30); {7376#false} is VALID [2018-11-23 12:13:54,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,107 INFO L273 TraceCheckUtils]: 54: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {7376#false} assume !(~i~1 > 30); {7376#false} is VALID [2018-11-23 12:13:54,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,107 INFO L273 TraceCheckUtils]: 57: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,107 INFO L273 TraceCheckUtils]: 58: Hoare triple {7376#false} assume !(~i~1 > 30); {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 59: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {7376#false} assume ~i~1 > 30;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; {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 62: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 63: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 64: Hoare triple {7376#false} assume ~i~1 > 30;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; {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 65: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,108 INFO L273 TraceCheckUtils]: 66: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 67: Hoare triple {7376#false} assume ~i~1 > 30;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; {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 68: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 69: Hoare triple {7376#false} assume !(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 70: Hoare triple {7376#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); {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 71: Hoare triple {7376#false} assume true; {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {7376#false} {7376#false} #86#return; {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 73: Hoare triple {7376#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; {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 74: Hoare triple {7376#false} assume !!(~i~2 < 59);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; {7376#false} is VALID [2018-11-23 12:13:54,109 INFO L273 TraceCheckUtils]: 75: Hoare triple {7376#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 76: Hoare triple {7376#false} assume !!(~i~2 < 59);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; {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 77: Hoare triple {7376#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 78: Hoare triple {7376#false} assume !!(~i~2 < 59);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; {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 79: Hoare triple {7376#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 80: Hoare triple {7376#false} assume !(~i~2 < 59); {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 81: Hoare triple {7376#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L256 TraceCheckUtils]: 82: Hoare triple {7376#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {7376#false} is VALID [2018-11-23 12:13:54,110 INFO L273 TraceCheckUtils]: 83: Hoare triple {7376#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; {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 84: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 85: Hoare triple {7376#false} assume !(~i~1 > 30); {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 86: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 87: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 88: Hoare triple {7376#false} assume !(~i~1 > 30); {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 89: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 90: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 91: Hoare triple {7376#false} assume !(~i~1 > 30); {7376#false} is VALID [2018-11-23 12:13:54,111 INFO L273 TraceCheckUtils]: 92: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 93: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 94: Hoare triple {7376#false} assume ~i~1 > 30;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; {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 95: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 96: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 97: Hoare triple {7376#false} assume ~i~1 > 30;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; {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 98: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 99: Hoare triple {7376#false} assume !!(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,112 INFO L273 TraceCheckUtils]: 100: Hoare triple {7376#false} assume ~i~1 > 30;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; {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {7376#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 102: Hoare triple {7376#false} assume !(~i~1 < 60); {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 103: Hoare triple {7376#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); {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 104: Hoare triple {7376#false} assume true; {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {7376#false} {7376#false} #88#return; {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 106: Hoare triple {7376#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 107: Hoare triple {7376#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7376#false} is VALID [2018-11-23 12:13:54,113 INFO L273 TraceCheckUtils]: 108: Hoare triple {7376#false} assume !false; {7376#false} is VALID [2018-11-23 12:13:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 273 proven. 15 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-11-23 12:13:54,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:54,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:13:54,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-23 12:13:54,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:54,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:13:54,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:54,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:13:54,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:13:54,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:54,185 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 7 states. [2018-11-23 12:13:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:54,468 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2018-11-23 12:13:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:13:54,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-23 12:13:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2018-11-23 12:13:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2018-11-23 12:13:54,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2018-11-23 12:13:54,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:54,625 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:13:54,626 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:13:54,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:13:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:13:54,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:54,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:13:54,651 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:13:54,651 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:13:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:54,654 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 12:13:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-23 12:13:54,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:54,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:54,655 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:13:54,655 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:13:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:54,657 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 12:13:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-23 12:13:54,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:54,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:54,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:54,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:13:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-11-23 12:13:54,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 109 [2018-11-23 12:13:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:54,660 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-11-23 12:13:54,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:13:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-23 12:13:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:13:54,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:54,662 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 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] [2018-11-23 12:13:54,662 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:54,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash -176167818, now seen corresponding path program 12 times [2018-11-23 12:13:54,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:54,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:54,675 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:54,676 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:54,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:54,692 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:13:56,105 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:13:56,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:56,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:56,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {8093#true} call ULTIMATE.init(); {8093#true} is VALID [2018-11-23 12:13:56,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {8093#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8093#true} is VALID [2018-11-23 12:13:56,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {8093#true} assume true; {8093#true} is VALID [2018-11-23 12:13:56,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8093#true} {8093#true} #78#return; {8093#true} is VALID [2018-11-23 12:13:56,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {8093#true} call #t~ret12 := main(); {8093#true} is VALID [2018-11-23 12:13:56,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {8093#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {8093#true} is VALID [2018-11-23 12:13:56,254 INFO L256 TraceCheckUtils]: 6: Hoare triple {8093#true} call init_nondet(~#x~0.base, ~#x~0.offset); {8093#true} is VALID [2018-11-23 12:13:56,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {8093#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {8093#true} is VALID [2018-11-23 12:13:56,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {8093#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8093#true} is VALID [2018-11-23 12:13:56,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {8093#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8093#true} is VALID [2018-11-23 12:13:56,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {8093#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8093#true} is VALID [2018-11-23 12:13:56,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {8093#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8093#true} is VALID [2018-11-23 12:13:56,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {8093#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {8093#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {8093#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {8093#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {8093#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {8093#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {8093#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8093#true} is VALID [2018-11-23 12:13:56,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {8093#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {8093#true} assume !(~i~0 < 60); {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {8093#true} assume true; {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {8093#true} {8093#true} #82#return; {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {8093#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L256 TraceCheckUtils]: 24: Hoare triple {8093#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {8093#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; {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {8093#true} assume !(~i~1 > 30); {8093#true} is VALID [2018-11-23 12:13:56,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {8093#true} assume !(~i~1 > 30); {8093#true} is VALID [2018-11-23 12:13:56,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {8093#true} assume !(~i~1 > 30); {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 46: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {8093#true} assume !(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {8093#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); {8093#true} is VALID [2018-11-23 12:13:56,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {8093#true} assume true; {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {8093#true} {8093#true} #84#return; {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {8093#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); {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L256 TraceCheckUtils]: 52: Hoare triple {8093#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {8093#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; {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {8093#true} assume !(~i~1 > 30); {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 57: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {8093#true} assume !(~i~1 > 30); {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {8093#true} assume !(~i~1 > 30); {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,262 INFO L273 TraceCheckUtils]: 66: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 67: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 68: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {8093#true} assume !!(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {8093#true} assume ~i~1 > 30;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; {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 74: Hoare triple {8093#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8093#true} is VALID [2018-11-23 12:13:56,263 INFO L273 TraceCheckUtils]: 75: Hoare triple {8093#true} assume !(~i~1 < 60); {8093#true} is VALID [2018-11-23 12:13:56,264 INFO L273 TraceCheckUtils]: 76: Hoare triple {8093#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); {8093#true} is VALID [2018-11-23 12:13:56,264 INFO L273 TraceCheckUtils]: 77: Hoare triple {8093#true} assume true; {8093#true} is VALID [2018-11-23 12:13:56,264 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {8093#true} {8093#true} #86#return; {8093#true} is VALID [2018-11-23 12:13:56,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {8093#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; {8335#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:56,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {8335#(<= main_~i~2 0)} assume !!(~i~2 < 59);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; {8335#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:56,269 INFO L273 TraceCheckUtils]: 81: Hoare triple {8335#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8342#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:56,271 INFO L273 TraceCheckUtils]: 82: Hoare triple {8342#(<= main_~i~2 1)} assume !!(~i~2 < 59);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; {8342#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:56,271 INFO L273 TraceCheckUtils]: 83: Hoare triple {8342#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8349#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:56,273 INFO L273 TraceCheckUtils]: 84: Hoare triple {8349#(<= main_~i~2 2)} assume !!(~i~2 < 59);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; {8349#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:56,273 INFO L273 TraceCheckUtils]: 85: Hoare triple {8349#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8356#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:56,291 INFO L273 TraceCheckUtils]: 86: Hoare triple {8356#(<= main_~i~2 3)} assume !(~i~2 < 59); {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L273 TraceCheckUtils]: 87: Hoare triple {8094#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L256 TraceCheckUtils]: 88: Hoare triple {8094#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L273 TraceCheckUtils]: 89: Hoare triple {8094#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; {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L273 TraceCheckUtils]: 90: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L273 TraceCheckUtils]: 91: Hoare triple {8094#false} assume !(~i~1 > 30); {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L273 TraceCheckUtils]: 92: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,292 INFO L273 TraceCheckUtils]: 93: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 94: Hoare triple {8094#false} assume !(~i~1 > 30); {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 95: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 96: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 97: Hoare triple {8094#false} assume !(~i~1 > 30); {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 98: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 99: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 100: Hoare triple {8094#false} assume ~i~1 > 30;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; {8094#false} is VALID [2018-11-23 12:13:56,293 INFO L273 TraceCheckUtils]: 101: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,294 INFO L273 TraceCheckUtils]: 102: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,294 INFO L273 TraceCheckUtils]: 103: Hoare triple {8094#false} assume ~i~1 > 30;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; {8094#false} is VALID [2018-11-23 12:13:56,294 INFO L273 TraceCheckUtils]: 104: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,294 INFO L273 TraceCheckUtils]: 105: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,294 INFO L273 TraceCheckUtils]: 106: Hoare triple {8094#false} assume ~i~1 > 30;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; {8094#false} is VALID [2018-11-23 12:13:56,295 INFO L273 TraceCheckUtils]: 107: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,295 INFO L273 TraceCheckUtils]: 108: Hoare triple {8094#false} assume !!(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,295 INFO L273 TraceCheckUtils]: 109: Hoare triple {8094#false} assume ~i~1 > 30;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; {8094#false} is VALID [2018-11-23 12:13:56,295 INFO L273 TraceCheckUtils]: 110: Hoare triple {8094#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8094#false} is VALID [2018-11-23 12:13:56,295 INFO L273 TraceCheckUtils]: 111: Hoare triple {8094#false} assume !(~i~1 < 60); {8094#false} is VALID [2018-11-23 12:13:56,295 INFO L273 TraceCheckUtils]: 112: Hoare triple {8094#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); {8094#false} is VALID [2018-11-23 12:13:56,296 INFO L273 TraceCheckUtils]: 113: Hoare triple {8094#false} assume true; {8094#false} is VALID [2018-11-23 12:13:56,296 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {8094#false} {8094#false} #88#return; {8094#false} is VALID [2018-11-23 12:13:56,296 INFO L273 TraceCheckUtils]: 115: Hoare triple {8094#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8094#false} is VALID [2018-11-23 12:13:56,296 INFO L273 TraceCheckUtils]: 116: Hoare triple {8094#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8094#false} is VALID [2018-11-23 12:13:56,296 INFO L273 TraceCheckUtils]: 117: Hoare triple {8094#false} assume !false; {8094#false} is VALID [2018-11-23 12:13:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 332 proven. 9 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-11-23 12:13:56,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:56,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:56,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2018-11-23 12:13:56,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:56,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:56,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:56,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:56,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:56,389 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 6 states. [2018-11-23 12:13:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:56,509 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-11-23 12:13:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:56,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2018-11-23 12:13:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:13:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:13:56,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 12:13:57,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:57,161 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:13:57,162 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:13:57,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:13:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:13:57,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:57,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:13:57,186 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:13:57,187 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:13:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:57,189 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 12:13:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 12:13:57,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:57,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:57,189 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:13:57,189 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:13:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:57,191 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 12:13:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 12:13:57,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:57,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:57,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:57,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:13:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-11-23 12:13:57,194 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 118 [2018-11-23 12:13:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:57,194 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-23 12:13:57,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-23 12:13:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 12:13:57,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:57,195 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 6, 6, 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] [2018-11-23 12:13:57,195 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:57,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1037599848, now seen corresponding path program 13 times [2018-11-23 12:13:57,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:57,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:57,212 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:57,212 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:57,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:57,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:57,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {8833#true} call ULTIMATE.init(); {8833#true} is VALID [2018-11-23 12:13:57,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {8833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8833#true} is VALID [2018-11-23 12:13:57,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {8833#true} assume true; {8833#true} is VALID [2018-11-23 12:13:57,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8833#true} {8833#true} #78#return; {8833#true} is VALID [2018-11-23 12:13:57,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {8833#true} call #t~ret12 := main(); {8833#true} is VALID [2018-11-23 12:13:57,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {8833#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {8833#true} is VALID [2018-11-23 12:13:57,783 INFO L256 TraceCheckUtils]: 6: Hoare triple {8833#true} call init_nondet(~#x~0.base, ~#x~0.offset); {8833#true} is VALID [2018-11-23 12:13:57,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {8833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {8859#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:57,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {8859#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8859#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:57,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {8859#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8866#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:57,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {8866#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8866#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:57,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {8866#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8873#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:57,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {8873#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8873#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:57,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {8873#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8880#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:57,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {8880#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8880#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:57,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {8880#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8887#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:57,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {8887#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8887#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:57,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {8887#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:57,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {8894#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8894#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:57,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {8894#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:57,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {8901#(<= init_nondet_~i~0 6)} assume !(~i~0 < 60); {8834#false} is VALID [2018-11-23 12:13:57,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {8834#false} assume true; {8834#false} is VALID [2018-11-23 12:13:57,792 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {8834#false} {8833#true} #82#return; {8834#false} is VALID [2018-11-23 12:13:57,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {8834#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {8834#false} is VALID [2018-11-23 12:13:57,792 INFO L256 TraceCheckUtils]: 24: Hoare triple {8834#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {8834#false} is VALID [2018-11-23 12:13:57,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {8834#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; {8834#false} is VALID [2018-11-23 12:13:57,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 36: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 42: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {8834#false} assume !(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {8834#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); {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {8834#false} assume true; {8834#false} is VALID [2018-11-23 12:13:57,795 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {8834#false} {8834#false} #84#return; {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 51: Hoare triple {8834#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); {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L256 TraceCheckUtils]: 52: Hoare triple {8834#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 53: Hoare triple {8834#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; {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 55: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 56: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 61: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 62: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 63: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 64: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 65: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 66: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,797 INFO L273 TraceCheckUtils]: 67: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 68: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 69: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 70: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 71: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 72: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 73: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 74: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 75: Hoare triple {8834#false} assume !(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,798 INFO L273 TraceCheckUtils]: 76: Hoare triple {8834#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); {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 77: Hoare triple {8834#false} assume true; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {8834#false} {8834#false} #86#return; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 79: Hoare triple {8834#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; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 80: Hoare triple {8834#false} assume !!(~i~2 < 59);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; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 81: Hoare triple {8834#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 82: Hoare triple {8834#false} assume !!(~i~2 < 59);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; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 83: Hoare triple {8834#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 84: Hoare triple {8834#false} assume !!(~i~2 < 59);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; {8834#false} is VALID [2018-11-23 12:13:57,799 INFO L273 TraceCheckUtils]: 85: Hoare triple {8834#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 86: Hoare triple {8834#false} assume !!(~i~2 < 59);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; {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 87: Hoare triple {8834#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 88: Hoare triple {8834#false} assume !(~i~2 < 59); {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 89: Hoare triple {8834#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L256 TraceCheckUtils]: 90: Hoare triple {8834#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 91: Hoare triple {8834#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; {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 92: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 93: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,800 INFO L273 TraceCheckUtils]: 94: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 95: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 96: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 97: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 98: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 99: Hoare triple {8834#false} assume !(~i~1 > 30); {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 100: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 101: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 102: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,801 INFO L273 TraceCheckUtils]: 103: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 104: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 105: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 106: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 107: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 108: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 109: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 110: Hoare triple {8834#false} assume !!(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,802 INFO L273 TraceCheckUtils]: 111: Hoare triple {8834#false} assume ~i~1 > 30;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; {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 112: Hoare triple {8834#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 113: Hoare triple {8834#false} assume !(~i~1 < 60); {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 114: Hoare triple {8834#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); {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 115: Hoare triple {8834#false} assume true; {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {8834#false} {8834#false} #88#return; {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 117: Hoare triple {8834#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 118: Hoare triple {8834#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8834#false} is VALID [2018-11-23 12:13:57,803 INFO L273 TraceCheckUtils]: 119: Hoare triple {8834#false} assume !false; {8834#false} is VALID [2018-11-23 12:13:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2018-11-23 12:13:57,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:57,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:13:57,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2018-11-23 12:13:57,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:57,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:13:57,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:57,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:13:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:13:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:13:57,873 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 9 states. [2018-11-23 12:13:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:58,506 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2018-11-23 12:13:58,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:13:58,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2018-11-23 12:13:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:13:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 12:13:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:13:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 12:13:58,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2018-11-23 12:13:58,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:58,957 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:13:58,957 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:13:58,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:13:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:13:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:13:59,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:59,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:13:59,002 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:13:59,002 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:13:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:59,006 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 12:13:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:13:59,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:59,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:59,006 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:13:59,006 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:13:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:59,008 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 12:13:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:13:59,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:59,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:59,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:59,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:13:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-11-23 12:13:59,011 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 120 [2018-11-23 12:13:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:59,011 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-11-23 12:13:59,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:13:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-11-23 12:13:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:13:59,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:59,012 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 7, 7, 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] [2018-11-23 12:13:59,012 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:59,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash 84946778, now seen corresponding path program 14 times [2018-11-23 12:13:59,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:59,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:59,026 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:59,026 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:59,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:59,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:59,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:59,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:59,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:59,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {9615#true} call ULTIMATE.init(); {9615#true} is VALID [2018-11-23 12:13:59,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {9615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9615#true} is VALID [2018-11-23 12:13:59,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {9615#true} assume true; {9615#true} is VALID [2018-11-23 12:13:59,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9615#true} {9615#true} #78#return; {9615#true} is VALID [2018-11-23 12:13:59,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {9615#true} call #t~ret12 := main(); {9615#true} is VALID [2018-11-23 12:13:59,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {9615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {9615#true} is VALID [2018-11-23 12:13:59,549 INFO L256 TraceCheckUtils]: 6: Hoare triple {9615#true} call init_nondet(~#x~0.base, ~#x~0.offset); {9615#true} is VALID [2018-11-23 12:13:59,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {9615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {9641#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:59,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {9641#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9641#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:59,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {9641#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9648#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:59,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {9648#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9648#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:59,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {9648#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9655#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:59,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {9655#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9655#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:59,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {9655#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:59,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {9662#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9662#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:59,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {9662#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9669#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:59,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {9669#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9669#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:59,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {9669#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:59,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {9676#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9676#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:59,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {9676#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9683#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:59,557 INFO L273 TraceCheckUtils]: 20: Hoare triple {9683#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9683#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:59,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {9683#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9690#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:13:59,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {9690#(<= init_nondet_~i~0 7)} assume !(~i~0 < 60); {9616#false} is VALID [2018-11-23 12:13:59,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {9616#false} assume true; {9616#false} is VALID [2018-11-23 12:13:59,559 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {9616#false} {9615#true} #82#return; {9616#false} is VALID [2018-11-23 12:13:59,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {9616#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {9616#false} is VALID [2018-11-23 12:13:59,559 INFO L256 TraceCheckUtils]: 26: Hoare triple {9616#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {9616#false} is VALID [2018-11-23 12:13:59,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {9616#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; {9616#false} is VALID [2018-11-23 12:13:59,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,560 INFO L273 TraceCheckUtils]: 33: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,561 INFO L273 TraceCheckUtils]: 35: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,562 INFO L273 TraceCheckUtils]: 39: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,562 INFO L273 TraceCheckUtils]: 40: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 43: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 46: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 47: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 48: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 49: Hoare triple {9616#false} assume !(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 50: Hoare triple {9616#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); {9616#false} is VALID [2018-11-23 12:13:59,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {9616#false} assume true; {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {9616#false} {9616#false} #84#return; {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L273 TraceCheckUtils]: 53: Hoare triple {9616#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); {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L256 TraceCheckUtils]: 54: Hoare triple {9616#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L273 TraceCheckUtils]: 55: Hoare triple {9616#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; {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L273 TraceCheckUtils]: 56: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 61: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 62: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 63: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 64: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 65: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 66: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 67: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,565 INFO L273 TraceCheckUtils]: 68: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 69: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 70: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 71: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 72: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 73: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 74: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 75: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 76: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,566 INFO L273 TraceCheckUtils]: 77: Hoare triple {9616#false} assume !(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 78: Hoare triple {9616#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); {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 79: Hoare triple {9616#false} assume true; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {9616#false} {9616#false} #86#return; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 81: Hoare triple {9616#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; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {9616#false} assume !!(~i~2 < 59);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; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 83: Hoare triple {9616#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 84: Hoare triple {9616#false} assume !!(~i~2 < 59);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; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 85: Hoare triple {9616#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9616#false} is VALID [2018-11-23 12:13:59,567 INFO L273 TraceCheckUtils]: 86: Hoare triple {9616#false} assume !!(~i~2 < 59);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; {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 87: Hoare triple {9616#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 88: Hoare triple {9616#false} assume !!(~i~2 < 59);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; {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 89: Hoare triple {9616#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 90: Hoare triple {9616#false} assume !(~i~2 < 59); {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 91: Hoare triple {9616#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L256 TraceCheckUtils]: 92: Hoare triple {9616#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 93: Hoare triple {9616#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; {9616#false} is VALID [2018-11-23 12:13:59,568 INFO L273 TraceCheckUtils]: 94: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 95: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 96: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 97: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 98: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 99: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 100: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 101: Hoare triple {9616#false} assume !(~i~1 > 30); {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 102: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,569 INFO L273 TraceCheckUtils]: 103: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 104: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 105: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 106: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 107: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 108: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 109: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 110: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 111: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,570 INFO L273 TraceCheckUtils]: 112: Hoare triple {9616#false} assume !!(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 113: Hoare triple {9616#false} assume ~i~1 > 30;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; {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 114: Hoare triple {9616#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 115: Hoare triple {9616#false} assume !(~i~1 < 60); {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 116: Hoare triple {9616#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); {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 117: Hoare triple {9616#false} assume true; {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {9616#false} {9616#false} #88#return; {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 119: Hoare triple {9616#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 120: Hoare triple {9616#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9616#false} is VALID [2018-11-23 12:13:59,571 INFO L273 TraceCheckUtils]: 121: Hoare triple {9616#false} assume !false; {9616#false} is VALID [2018-11-23 12:13:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2018-11-23 12:13:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:13:59,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2018-11-23 12:13:59,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:59,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:13:59,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:59,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:13:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:13:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:13:59,649 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 10 states. [2018-11-23 12:14:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:00,070 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-11-23 12:14:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:14:00,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2018-11-23 12:14:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 12:14:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 12:14:00,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2018-11-23 12:14:00,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:00,219 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:14:00,219 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:14:00,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:14:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 12:14:00,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:00,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 12:14:00,249 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 12:14:00,249 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 12:14:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:00,252 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:14:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:14:00,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:00,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:00,253 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 12:14:00,253 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 12:14:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:00,255 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:14:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:14:00,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:00,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:00,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:00,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:14:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-11-23 12:14:00,258 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 122 [2018-11-23 12:14:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:00,258 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-11-23 12:14:00,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:14:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-23 12:14:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:14:00,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:00,260 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 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] [2018-11-23 12:14:00,260 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:00,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash 815463068, now seen corresponding path program 15 times [2018-11-23 12:14:00,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:00,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:00,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:00,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:00,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:00,275 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:00,275 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:00,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:00,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:14:00,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:14:00,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:00,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:00,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {10414#true} call ULTIMATE.init(); {10414#true} is VALID [2018-11-23 12:14:00,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {10414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10414#true} is VALID [2018-11-23 12:14:00,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {10414#true} assume true; {10414#true} is VALID [2018-11-23 12:14:00,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10414#true} {10414#true} #78#return; {10414#true} is VALID [2018-11-23 12:14:00,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {10414#true} call #t~ret12 := main(); {10414#true} is VALID [2018-11-23 12:14:00,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {10414#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {10414#true} is VALID [2018-11-23 12:14:00,748 INFO L256 TraceCheckUtils]: 6: Hoare triple {10414#true} call init_nondet(~#x~0.base, ~#x~0.offset); {10414#true} is VALID [2018-11-23 12:14:00,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {10414#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {10414#true} is VALID [2018-11-23 12:14:00,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {10414#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {10414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {10414#true} assume !(~i~0 < 60); {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {10414#true} assume true; {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {10414#true} {10414#true} #82#return; {10414#true} is VALID [2018-11-23 12:14:00,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {10414#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L256 TraceCheckUtils]: 28: Hoare triple {10414#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {10414#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; {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {10414#true} assume !(~i~1 > 30); {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {10414#true} assume !(~i~1 > 30); {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 36: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {10414#true} assume !(~i~1 > 30); {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 45: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 46: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {10414#true} assume !(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {10414#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); {10414#true} is VALID [2018-11-23 12:14:00,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {10414#true} assume true; {10414#true} is VALID [2018-11-23 12:14:00,755 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {10414#true} {10414#true} #84#return; {10414#true} is VALID [2018-11-23 12:14:00,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {10414#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); {10414#true} is VALID [2018-11-23 12:14:00,756 INFO L256 TraceCheckUtils]: 56: Hoare triple {10414#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {10414#true} is VALID [2018-11-23 12:14:00,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {10414#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; {10414#true} is VALID [2018-11-23 12:14:00,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {10414#true} assume !(~i~1 > 30); {10414#true} is VALID [2018-11-23 12:14:00,757 INFO L273 TraceCheckUtils]: 60: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,757 INFO L273 TraceCheckUtils]: 61: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {10414#true} assume !(~i~1 > 30); {10414#true} is VALID [2018-11-23 12:14:00,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,758 INFO L273 TraceCheckUtils]: 65: Hoare triple {10414#true} assume !(~i~1 > 30); {10414#true} is VALID [2018-11-23 12:14:00,758 INFO L273 TraceCheckUtils]: 66: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,758 INFO L273 TraceCheckUtils]: 67: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,758 INFO L273 TraceCheckUtils]: 68: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,758 INFO L273 TraceCheckUtils]: 69: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,759 INFO L273 TraceCheckUtils]: 70: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,759 INFO L273 TraceCheckUtils]: 71: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,759 INFO L273 TraceCheckUtils]: 72: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,759 INFO L273 TraceCheckUtils]: 74: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {10414#true} assume !!(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,760 INFO L273 TraceCheckUtils]: 77: Hoare triple {10414#true} assume ~i~1 > 30;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; {10414#true} is VALID [2018-11-23 12:14:00,760 INFO L273 TraceCheckUtils]: 78: Hoare triple {10414#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10414#true} is VALID [2018-11-23 12:14:00,760 INFO L273 TraceCheckUtils]: 79: Hoare triple {10414#true} assume !(~i~1 < 60); {10414#true} is VALID [2018-11-23 12:14:00,761 INFO L273 TraceCheckUtils]: 80: Hoare triple {10414#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); {10414#true} is VALID [2018-11-23 12:14:00,761 INFO L273 TraceCheckUtils]: 81: Hoare triple {10414#true} assume true; {10414#true} is VALID [2018-11-23 12:14:00,761 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {10414#true} {10414#true} #86#return; {10414#true} is VALID [2018-11-23 12:14:00,767 INFO L273 TraceCheckUtils]: 83: Hoare triple {10414#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; {10668#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:00,768 INFO L273 TraceCheckUtils]: 84: Hoare triple {10668#(<= main_~i~2 0)} assume !!(~i~2 < 59);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; {10668#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:00,769 INFO L273 TraceCheckUtils]: 85: Hoare triple {10668#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10675#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:00,769 INFO L273 TraceCheckUtils]: 86: Hoare triple {10675#(<= main_~i~2 1)} assume !!(~i~2 < 59);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; {10675#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:00,770 INFO L273 TraceCheckUtils]: 87: Hoare triple {10675#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10682#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:00,770 INFO L273 TraceCheckUtils]: 88: Hoare triple {10682#(<= main_~i~2 2)} assume !!(~i~2 < 59);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; {10682#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:00,770 INFO L273 TraceCheckUtils]: 89: Hoare triple {10682#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10689#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:00,771 INFO L273 TraceCheckUtils]: 90: Hoare triple {10689#(<= main_~i~2 3)} assume !!(~i~2 < 59);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; {10689#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:00,772 INFO L273 TraceCheckUtils]: 91: Hoare triple {10689#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10696#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:00,773 INFO L273 TraceCheckUtils]: 92: Hoare triple {10696#(<= main_~i~2 4)} assume !(~i~2 < 59); {10415#false} is VALID [2018-11-23 12:14:00,773 INFO L273 TraceCheckUtils]: 93: Hoare triple {10415#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {10415#false} is VALID [2018-11-23 12:14:00,773 INFO L256 TraceCheckUtils]: 94: Hoare triple {10415#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {10415#false} is VALID [2018-11-23 12:14:00,773 INFO L273 TraceCheckUtils]: 95: Hoare triple {10415#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; {10415#false} is VALID [2018-11-23 12:14:00,774 INFO L273 TraceCheckUtils]: 96: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,774 INFO L273 TraceCheckUtils]: 97: Hoare triple {10415#false} assume !(~i~1 > 30); {10415#false} is VALID [2018-11-23 12:14:00,774 INFO L273 TraceCheckUtils]: 98: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,774 INFO L273 TraceCheckUtils]: 99: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,775 INFO L273 TraceCheckUtils]: 100: Hoare triple {10415#false} assume !(~i~1 > 30); {10415#false} is VALID [2018-11-23 12:14:00,775 INFO L273 TraceCheckUtils]: 101: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,775 INFO L273 TraceCheckUtils]: 102: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,775 INFO L273 TraceCheckUtils]: 103: Hoare triple {10415#false} assume !(~i~1 > 30); {10415#false} is VALID [2018-11-23 12:14:00,776 INFO L273 TraceCheckUtils]: 104: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,776 INFO L273 TraceCheckUtils]: 105: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,776 INFO L273 TraceCheckUtils]: 106: Hoare triple {10415#false} assume ~i~1 > 30;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; {10415#false} is VALID [2018-11-23 12:14:00,776 INFO L273 TraceCheckUtils]: 107: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,776 INFO L273 TraceCheckUtils]: 108: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,776 INFO L273 TraceCheckUtils]: 109: Hoare triple {10415#false} assume ~i~1 > 30;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; {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 110: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 111: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 112: Hoare triple {10415#false} assume ~i~1 > 30;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; {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 113: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 114: Hoare triple {10415#false} assume !!(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 115: Hoare triple {10415#false} assume ~i~1 > 30;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; {10415#false} is VALID [2018-11-23 12:14:00,777 INFO L273 TraceCheckUtils]: 116: Hoare triple {10415#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10415#false} is VALID [2018-11-23 12:14:00,778 INFO L273 TraceCheckUtils]: 117: Hoare triple {10415#false} assume !(~i~1 < 60); {10415#false} is VALID [2018-11-23 12:14:00,778 INFO L273 TraceCheckUtils]: 118: Hoare triple {10415#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); {10415#false} is VALID [2018-11-23 12:14:00,778 INFO L273 TraceCheckUtils]: 119: Hoare triple {10415#false} assume true; {10415#false} is VALID [2018-11-23 12:14:00,778 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {10415#false} {10415#false} #88#return; {10415#false} is VALID [2018-11-23 12:14:00,778 INFO L273 TraceCheckUtils]: 121: Hoare triple {10415#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {10415#false} is VALID [2018-11-23 12:14:00,778 INFO L273 TraceCheckUtils]: 122: Hoare triple {10415#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10415#false} is VALID [2018-11-23 12:14:00,779 INFO L273 TraceCheckUtils]: 123: Hoare triple {10415#false} assume !false; {10415#false} is VALID [2018-11-23 12:14:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 332 proven. 16 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-23 12:14:00,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:14:00,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:14:00,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-23 12:14:00,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:00,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:14:00,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:00,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:14:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:14:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:14:00,876 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 7 states. [2018-11-23 12:14:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,046 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-23 12:14:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:14:01,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-23 12:14:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:14:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 12:14:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:14:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 12:14:01,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2018-11-23 12:14:01,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:01,107 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:14:01,107 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:14:01,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:14:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:14:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 12:14:01,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:01,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 12:14:01,131 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 12:14:01,131 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 12:14:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,133 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-23 12:14:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 12:14:01,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:01,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:01,134 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 12:14:01,134 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 12:14:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,135 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-23 12:14:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 12:14:01,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:01,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:01,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:01,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:14:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-11-23 12:14:01,138 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 124 [2018-11-23 12:14:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:01,138 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-11-23 12:14:01,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:14:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-11-23 12:14:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:14:01,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:01,139 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 5, 5, 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] [2018-11-23 12:14:01,139 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:01,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1563058114, now seen corresponding path program 16 times [2018-11-23 12:14:01,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:01,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:01,152 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:01,152 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:01,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:14:01,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:14:01,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:01,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:01,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {11203#true} call ULTIMATE.init(); {11203#true} is VALID [2018-11-23 12:14:01,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {11203#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11203#true} is VALID [2018-11-23 12:14:01,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {11203#true} assume true; {11203#true} is VALID [2018-11-23 12:14:01,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11203#true} {11203#true} #78#return; {11203#true} is VALID [2018-11-23 12:14:01,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {11203#true} call #t~ret12 := main(); {11203#true} is VALID [2018-11-23 12:14:01,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {11203#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {11203#true} is VALID [2018-11-23 12:14:01,452 INFO L256 TraceCheckUtils]: 6: Hoare triple {11203#true} call init_nondet(~#x~0.base, ~#x~0.offset); {11203#true} is VALID [2018-11-23 12:14:01,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {11203#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {11229#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:14:01,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {11229#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11229#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:14:01,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {11229#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11236#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:14:01,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {11236#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11236#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:14:01,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {11236#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11243#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:14:01,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {11243#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11243#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:14:01,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {11243#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11250#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:14:01,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {11250#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11250#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:14:01,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {11250#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11257#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:14:01,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {11257#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11257#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:14:01,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {11257#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:14:01,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {11264#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11264#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:14:01,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {11264#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:14:01,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {11271#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11271#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:14:01,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {11271#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:14:01,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {11278#(<= init_nondet_~i~0 7)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11278#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:14:01,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {11278#(<= init_nondet_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:14:01,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {11285#(<= init_nondet_~i~0 8)} assume !(~i~0 < 60); {11204#false} is VALID [2018-11-23 12:14:01,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {11204#false} assume true; {11204#false} is VALID [2018-11-23 12:14:01,463 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {11204#false} {11203#true} #82#return; {11204#false} is VALID [2018-11-23 12:14:01,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {11204#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {11204#false} is VALID [2018-11-23 12:14:01,463 INFO L256 TraceCheckUtils]: 28: Hoare triple {11204#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {11204#false} is VALID [2018-11-23 12:14:01,463 INFO L273 TraceCheckUtils]: 29: Hoare triple {11204#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; {11204#false} is VALID [2018-11-23 12:14:01,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,464 INFO L273 TraceCheckUtils]: 31: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,464 INFO L273 TraceCheckUtils]: 32: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,464 INFO L273 TraceCheckUtils]: 33: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 35: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 39: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 40: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 43: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 44: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 45: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 46: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 47: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 48: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 49: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,466 INFO L273 TraceCheckUtils]: 50: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L273 TraceCheckUtils]: 51: Hoare triple {11204#false} assume !(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L273 TraceCheckUtils]: 52: Hoare triple {11204#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); {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L273 TraceCheckUtils]: 53: Hoare triple {11204#false} assume true; {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {11204#false} {11204#false} #84#return; {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {11204#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); {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L256 TraceCheckUtils]: 56: Hoare triple {11204#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {11204#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; {11204#false} is VALID [2018-11-23 12:14:01,467 INFO L273 TraceCheckUtils]: 58: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 61: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 62: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 64: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 65: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 66: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,468 INFO L273 TraceCheckUtils]: 67: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 68: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 69: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 70: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 74: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 75: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 77: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 78: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 79: Hoare triple {11204#false} assume !(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 80: Hoare triple {11204#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); {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {11204#false} assume true; {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {11204#false} {11204#false} #86#return; {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 83: Hoare triple {11204#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; {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 84: Hoare triple {11204#false} assume !!(~i~2 < 59);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; {11204#false} is VALID [2018-11-23 12:14:01,470 INFO L273 TraceCheckUtils]: 85: Hoare triple {11204#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 86: Hoare triple {11204#false} assume !!(~i~2 < 59);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; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 87: Hoare triple {11204#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 88: Hoare triple {11204#false} assume !!(~i~2 < 59);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; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {11204#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 90: Hoare triple {11204#false} assume !!(~i~2 < 59);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; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 91: Hoare triple {11204#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 92: Hoare triple {11204#false} assume !!(~i~2 < 59);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; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 93: Hoare triple {11204#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11204#false} is VALID [2018-11-23 12:14:01,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {11204#false} assume !(~i~2 < 59); {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 95: Hoare triple {11204#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L256 TraceCheckUtils]: 96: Hoare triple {11204#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {11204#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; {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 98: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 99: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 100: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 101: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,472 INFO L273 TraceCheckUtils]: 102: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 103: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 104: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 105: Hoare triple {11204#false} assume !(~i~1 > 30); {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 106: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 107: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 108: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 109: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 110: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,473 INFO L273 TraceCheckUtils]: 111: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 112: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 113: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 114: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 115: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 116: Hoare triple {11204#false} assume !!(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 117: Hoare triple {11204#false} assume ~i~1 > 30;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; {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 118: Hoare triple {11204#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 119: Hoare triple {11204#false} assume !(~i~1 < 60); {11204#false} is VALID [2018-11-23 12:14:01,474 INFO L273 TraceCheckUtils]: 120: Hoare triple {11204#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); {11204#false} is VALID [2018-11-23 12:14:01,475 INFO L273 TraceCheckUtils]: 121: Hoare triple {11204#false} assume true; {11204#false} is VALID [2018-11-23 12:14:01,475 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {11204#false} {11204#false} #88#return; {11204#false} is VALID [2018-11-23 12:14:01,475 INFO L273 TraceCheckUtils]: 123: Hoare triple {11204#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11204#false} is VALID [2018-11-23 12:14:01,475 INFO L273 TraceCheckUtils]: 124: Hoare triple {11204#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11204#false} is VALID [2018-11-23 12:14:01,475 INFO L273 TraceCheckUtils]: 125: Hoare triple {11204#false} assume !false; {11204#false} is VALID [2018-11-23 12:14:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2018-11-23 12:14:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:14:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:14:01,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-23 12:14:01,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:01,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:14:01,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:01,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:14:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:14:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:01,549 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 11 states. [2018-11-23 12:14:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,706 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2018-11-23 12:14:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:14:01,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-23 12:14:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:14:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:14:01,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-23 12:14:01,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:01,807 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:14:01,807 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:14:01,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:14:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:14:01,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:01,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:14:01,832 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:14:01,832 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:14:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,835 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-23 12:14:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-23 12:14:01,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:01,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:01,836 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:14:01,836 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:14:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,838 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-23 12:14:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-23 12:14:01,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:01,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:01,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:01,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:14:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-23 12:14:01,840 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 126 [2018-11-23 12:14:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:01,841 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-23 12:14:01,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:14:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-23 12:14:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:14:01,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:01,842 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 12, 9, 9, 9, 5, 5, 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] [2018-11-23 12:14:01,842 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:01,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash 698677888, now seen corresponding path program 17 times [2018-11-23 12:14:01,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:01,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:01,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:01,858 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:01,858 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:01,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:14:01,909 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:14:01,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:01,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:02,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {12038#true} call ULTIMATE.init(); {12038#true} is VALID [2018-11-23 12:14:02,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {12038#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12038#true} is VALID [2018-11-23 12:14:02,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {12038#true} assume true; {12038#true} is VALID [2018-11-23 12:14:02,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12038#true} {12038#true} #78#return; {12038#true} is VALID [2018-11-23 12:14:02,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {12038#true} call #t~ret12 := main(); {12038#true} is VALID [2018-11-23 12:14:02,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {12038#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {12038#true} is VALID [2018-11-23 12:14:02,230 INFO L256 TraceCheckUtils]: 6: Hoare triple {12038#true} call init_nondet(~#x~0.base, ~#x~0.offset); {12038#true} is VALID [2018-11-23 12:14:02,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {12038#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {12038#true} is VALID [2018-11-23 12:14:02,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 17: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {12038#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {12038#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12038#true} is VALID [2018-11-23 12:14:02,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {12038#true} assume !(~i~0 < 60); {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {12038#true} assume true; {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {12038#true} {12038#true} #82#return; {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {12038#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L256 TraceCheckUtils]: 30: Hoare triple {12038#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {12038#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; {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {12038#true} assume !!(~i~1 < 60); {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {12038#true} assume !(~i~1 > 30); {12038#true} is VALID [2018-11-23 12:14:02,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {12038#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12038#true} is VALID [2018-11-23 12:14:02,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {12038#true} assume !!(~i~1 < 60); {12038#true} is VALID [2018-11-23 12:14:02,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {12038#true} assume !(~i~1 > 30); {12038#true} is VALID [2018-11-23 12:14:02,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {12038#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12038#true} is VALID [2018-11-23 12:14:02,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {12038#true} assume !!(~i~1 < 60); {12038#true} is VALID [2018-11-23 12:14:02,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {12038#true} assume !(~i~1 > 30); {12160#(<= rangesum_~i~1 30)} is VALID [2018-11-23 12:14:02,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {12160#(<= rangesum_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12164#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:14:02,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {12164#(<= rangesum_~i~1 31)} assume !!(~i~1 < 60); {12164#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:14:02,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {12164#(<= rangesum_~i~1 31)} assume ~i~1 > 30;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; {12164#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:14:02,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {12164#(<= rangesum_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12174#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:14:02,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {12174#(<= rangesum_~i~1 32)} assume !!(~i~1 < 60); {12174#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:14:02,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {12174#(<= rangesum_~i~1 32)} assume ~i~1 > 30;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; {12174#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:14:02,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {12174#(<= rangesum_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12184#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:14:02,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {12184#(<= rangesum_~i~1 33)} assume !!(~i~1 < 60); {12184#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:14:02,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {12184#(<= rangesum_~i~1 33)} assume ~i~1 > 30;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; {12184#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:14:02,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {12184#(<= rangesum_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12194#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:14:02,238 INFO L273 TraceCheckUtils]: 50: Hoare triple {12194#(<= rangesum_~i~1 34)} assume !!(~i~1 < 60); {12194#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:14:02,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {12194#(<= rangesum_~i~1 34)} assume ~i~1 > 30;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; {12194#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:14:02,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {12194#(<= rangesum_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12204#(<= rangesum_~i~1 35)} is VALID [2018-11-23 12:14:02,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {12204#(<= rangesum_~i~1 35)} assume !(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {12039#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); {12039#false} is VALID [2018-11-23 12:14:02,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {12039#false} assume true; {12039#false} is VALID [2018-11-23 12:14:02,241 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {12039#false} {12038#true} #84#return; {12039#false} is VALID [2018-11-23 12:14:02,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {12039#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); {12039#false} is VALID [2018-11-23 12:14:02,241 INFO L256 TraceCheckUtils]: 58: Hoare triple {12039#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {12039#false} is VALID [2018-11-23 12:14:02,242 INFO L273 TraceCheckUtils]: 59: Hoare triple {12039#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; {12039#false} is VALID [2018-11-23 12:14:02,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {12039#false} assume !(~i~1 > 30); {12039#false} is VALID [2018-11-23 12:14:02,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 64: Hoare triple {12039#false} assume !(~i~1 > 30); {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 66: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 67: Hoare triple {12039#false} assume !(~i~1 > 30); {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 68: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,243 INFO L273 TraceCheckUtils]: 72: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 73: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 74: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 76: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 77: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 78: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 79: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,244 INFO L273 TraceCheckUtils]: 80: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 81: Hoare triple {12039#false} assume !(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 82: Hoare triple {12039#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); {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 83: Hoare triple {12039#false} assume true; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {12039#false} {12039#false} #86#return; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 85: Hoare triple {12039#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; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 86: Hoare triple {12039#false} assume !!(~i~2 < 59);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; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 87: Hoare triple {12039#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 88: Hoare triple {12039#false} assume !!(~i~2 < 59);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; {12039#false} is VALID [2018-11-23 12:14:02,245 INFO L273 TraceCheckUtils]: 89: Hoare triple {12039#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 90: Hoare triple {12039#false} assume !!(~i~2 < 59);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; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 91: Hoare triple {12039#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 92: Hoare triple {12039#false} assume !!(~i~2 < 59);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; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 93: Hoare triple {12039#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 94: Hoare triple {12039#false} assume !!(~i~2 < 59);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; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 95: Hoare triple {12039#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 96: Hoare triple {12039#false} assume !(~i~2 < 59); {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L273 TraceCheckUtils]: 97: Hoare triple {12039#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {12039#false} is VALID [2018-11-23 12:14:02,246 INFO L256 TraceCheckUtils]: 98: Hoare triple {12039#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 99: Hoare triple {12039#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; {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 100: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 101: Hoare triple {12039#false} assume !(~i~1 > 30); {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 102: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 103: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 104: Hoare triple {12039#false} assume !(~i~1 > 30); {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 105: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 106: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,247 INFO L273 TraceCheckUtils]: 107: Hoare triple {12039#false} assume !(~i~1 > 30); {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 108: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 109: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 110: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 111: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 112: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 113: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 114: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,248 INFO L273 TraceCheckUtils]: 115: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 116: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 117: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 118: Hoare triple {12039#false} assume !!(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 119: Hoare triple {12039#false} assume ~i~1 > 30;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; {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 120: Hoare triple {12039#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 121: Hoare triple {12039#false} assume !(~i~1 < 60); {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 122: Hoare triple {12039#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); {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L273 TraceCheckUtils]: 123: Hoare triple {12039#false} assume true; {12039#false} is VALID [2018-11-23 12:14:02,249 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {12039#false} {12039#false} #88#return; {12039#false} is VALID [2018-11-23 12:14:02,250 INFO L273 TraceCheckUtils]: 125: Hoare triple {12039#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12039#false} is VALID [2018-11-23 12:14:02,250 INFO L273 TraceCheckUtils]: 126: Hoare triple {12039#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12039#false} is VALID [2018-11-23 12:14:02,250 INFO L273 TraceCheckUtils]: 127: Hoare triple {12039#false} assume !false; {12039#false} is VALID [2018-11-23 12:14:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 363 proven. 26 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-11-23 12:14:02,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:14:02,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:14:02,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2018-11-23 12:14:02,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:02,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:14:02,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:02,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:14:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:14:02,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:02,327 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 8 states. [2018-11-23 12:14:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:02,534 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-11-23 12:14:02,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:14:02,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2018-11-23 12:14:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:14:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-23 12:14:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:14:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-23 12:14:02,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2018-11-23 12:14:02,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:02,617 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:14:02,617 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:14:02,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:14:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-23 12:14:02,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:02,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2018-11-23 12:14:02,705 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2018-11-23 12:14:02,705 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2018-11-23 12:14:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:02,707 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-11-23 12:14:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-23 12:14:02,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:02,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:02,708 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2018-11-23 12:14:02,708 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2018-11-23 12:14:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:02,709 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-11-23 12:14:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-23 12:14:02,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:02,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:02,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:02,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:14:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-23 12:14:02,711 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 128 [2018-11-23 12:14:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:02,712 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-23 12:14:02,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:14:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-23 12:14:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 12:14:02,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:02,713 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 15, 9, 9, 9, 5, 5, 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] [2018-11-23 12:14:02,713 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:02,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1750883546, now seen corresponding path program 18 times [2018-11-23 12:14:02,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:02,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:02,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:02,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:02,730 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:02,730 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:02,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:02,747 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:47,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:16:47,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:48,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2018-11-23 12:16:48,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {12888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12888#true} is VALID [2018-11-23 12:16:48,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {12888#true} assume true; {12888#true} is VALID [2018-11-23 12:16:48,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12888#true} {12888#true} #78#return; {12888#true} is VALID [2018-11-23 12:16:48,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {12888#true} call #t~ret12 := main(); {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {12888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L256 TraceCheckUtils]: 6: Hoare triple {12888#true} call init_nondet(~#x~0.base, ~#x~0.offset); {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {12888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {12888#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {12888#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {12888#true} assume !(~i~0 < 60); {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {12888#true} assume true; {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {12888#true} {12888#true} #82#return; {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {12888#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L256 TraceCheckUtils]: 30: Hoare triple {12888#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {12888#true} is VALID [2018-11-23 12:16:48,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {12888#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; {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {12888#true} assume !(~i~1 > 30); {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {12888#true} assume !(~i~1 > 30); {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 39: Hoare triple {12888#true} assume !(~i~1 > 30); {12888#true} is VALID [2018-11-23 12:16:48,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 43: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 44: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 45: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 46: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 47: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,069 INFO L273 TraceCheckUtils]: 49: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 51: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 52: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 53: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 54: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 55: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 56: Hoare triple {12888#true} assume !(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {12888#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); {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 58: Hoare triple {12888#true} assume true; {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {12888#true} {12888#true} #84#return; {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 60: Hoare triple {12888#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); {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L256 TraceCheckUtils]: 61: Hoare triple {12888#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 62: Hoare triple {12888#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; {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 63: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 64: Hoare triple {12888#true} assume !(~i~1 > 30); {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 65: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,071 INFO L273 TraceCheckUtils]: 66: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 67: Hoare triple {12888#true} assume !(~i~1 > 30); {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 68: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 69: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 70: Hoare triple {12888#true} assume !(~i~1 > 30); {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 71: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 72: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 73: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 74: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 76: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 77: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 79: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 80: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 81: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 82: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,073 INFO L273 TraceCheckUtils]: 83: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L273 TraceCheckUtils]: 84: Hoare triple {12888#true} assume !!(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L273 TraceCheckUtils]: 85: Hoare triple {12888#true} assume ~i~1 > 30;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; {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L273 TraceCheckUtils]: 86: Hoare triple {12888#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L273 TraceCheckUtils]: 87: Hoare triple {12888#true} assume !(~i~1 < 60); {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L273 TraceCheckUtils]: 88: Hoare triple {12888#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); {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L273 TraceCheckUtils]: 89: Hoare triple {12888#true} assume true; {12888#true} is VALID [2018-11-23 12:16:48,074 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {12888#true} {12888#true} #86#return; {12888#true} is VALID [2018-11-23 12:16:48,080 INFO L273 TraceCheckUtils]: 91: Hoare triple {12888#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; {13166#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:48,080 INFO L273 TraceCheckUtils]: 92: Hoare triple {13166#(<= main_~i~2 0)} assume !!(~i~2 < 59);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; {13166#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:48,083 INFO L273 TraceCheckUtils]: 93: Hoare triple {13166#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13173#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:48,083 INFO L273 TraceCheckUtils]: 94: Hoare triple {13173#(<= main_~i~2 1)} assume !!(~i~2 < 59);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; {13173#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:48,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {13173#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13180#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:48,086 INFO L273 TraceCheckUtils]: 96: Hoare triple {13180#(<= main_~i~2 2)} assume !!(~i~2 < 59);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; {13180#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:48,089 INFO L273 TraceCheckUtils]: 97: Hoare triple {13180#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13187#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:48,089 INFO L273 TraceCheckUtils]: 98: Hoare triple {13187#(<= main_~i~2 3)} assume !!(~i~2 < 59);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; {13187#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:48,092 INFO L273 TraceCheckUtils]: 99: Hoare triple {13187#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13194#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:48,092 INFO L273 TraceCheckUtils]: 100: Hoare triple {13194#(<= main_~i~2 4)} assume !!(~i~2 < 59);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; {13194#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:48,095 INFO L273 TraceCheckUtils]: 101: Hoare triple {13194#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13201#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:48,095 INFO L273 TraceCheckUtils]: 102: Hoare triple {13201#(<= main_~i~2 5)} assume !(~i~2 < 59); {12889#false} is VALID [2018-11-23 12:16:48,095 INFO L273 TraceCheckUtils]: 103: Hoare triple {12889#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {12889#false} is VALID [2018-11-23 12:16:48,095 INFO L256 TraceCheckUtils]: 104: Hoare triple {12889#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {12889#false} is VALID [2018-11-23 12:16:48,095 INFO L273 TraceCheckUtils]: 105: Hoare triple {12889#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; {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 106: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 107: Hoare triple {12889#false} assume !(~i~1 > 30); {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 108: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 109: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 110: Hoare triple {12889#false} assume !(~i~1 > 30); {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 111: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 112: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 113: Hoare triple {12889#false} assume !(~i~1 > 30); {12889#false} is VALID [2018-11-23 12:16:48,096 INFO L273 TraceCheckUtils]: 114: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 115: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 116: Hoare triple {12889#false} assume ~i~1 > 30;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; {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 117: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 118: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 119: Hoare triple {12889#false} assume ~i~1 > 30;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; {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 120: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 121: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,097 INFO L273 TraceCheckUtils]: 122: Hoare triple {12889#false} assume ~i~1 > 30;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; {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 123: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 124: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 125: Hoare triple {12889#false} assume ~i~1 > 30;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; {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 126: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 127: Hoare triple {12889#false} assume !!(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 128: Hoare triple {12889#false} assume ~i~1 > 30;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; {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 129: Hoare triple {12889#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 130: Hoare triple {12889#false} assume !(~i~1 < 60); {12889#false} is VALID [2018-11-23 12:16:48,098 INFO L273 TraceCheckUtils]: 131: Hoare triple {12889#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); {12889#false} is VALID [2018-11-23 12:16:48,099 INFO L273 TraceCheckUtils]: 132: Hoare triple {12889#false} assume true; {12889#false} is VALID [2018-11-23 12:16:48,099 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {12889#false} {12889#false} #88#return; {12889#false} is VALID [2018-11-23 12:16:48,099 INFO L273 TraceCheckUtils]: 134: Hoare triple {12889#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12889#false} is VALID [2018-11-23 12:16:48,099 INFO L273 TraceCheckUtils]: 135: Hoare triple {12889#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12889#false} is VALID [2018-11-23 12:16:48,099 INFO L273 TraceCheckUtils]: 136: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2018-11-23 12:16:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 426 proven. 25 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-23 12:16:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:48,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:16:48,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2018-11-23 12:16:48,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:48,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:48,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:48,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:48,198 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-11-23 12:16:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,346 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2018-11-23 12:16:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:48,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2018-11-23 12:16:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 12:16:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 12:16:48,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2018-11-23 12:16:48,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:48,409 INFO L225 Difference]: With dead ends: 118 [2018-11-23 12:16:48,410 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:16:48,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:16:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 12:16:48,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:48,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 12:16:48,443 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 12:16:48,443 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 12:16:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,445 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-23 12:16:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-11-23 12:16:48,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:48,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:48,446 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 12:16:48,446 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 12:16:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,448 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-23 12:16:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-11-23 12:16:48,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:48,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:48,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:48,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:16:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-23 12:16:48,451 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 137 [2018-11-23 12:16:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:48,451 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-23 12:16:48,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-23 12:16:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:16:48,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:48,452 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 15, 9, 9, 9, 6, 6, 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] [2018-11-23 12:16:48,453 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:48,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1336918776, now seen corresponding path program 19 times [2018-11-23 12:16:48,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:48,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:48,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:48,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:48,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:48,466 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:16:48,466 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:16:48,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:16:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:49,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2018-11-23 12:16:49,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {13755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13755#true} is VALID [2018-11-23 12:16:49,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2018-11-23 12:16:49,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #78#return; {13755#true} is VALID [2018-11-23 12:16:49,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret12 := main(); {13755#true} is VALID [2018-11-23 12:16:49,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {13755#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {13755#true} is VALID [2018-11-23 12:16:49,317 INFO L256 TraceCheckUtils]: 6: Hoare triple {13755#true} call init_nondet(~#x~0.base, ~#x~0.offset); {13755#true} is VALID [2018-11-23 12:16:49,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {13755#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {13781#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:16:49,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {13781#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13781#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:16:49,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {13781#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13788#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:16:49,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {13788#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13788#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:16:49,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {13788#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13795#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:16:49,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {13795#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13795#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:16:49,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {13795#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13802#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:16:49,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {13802#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13802#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:16:49,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {13802#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13809#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:16:49,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {13809#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13809#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:16:49,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {13809#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13816#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:16:49,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {13816#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13816#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:16:49,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {13816#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13823#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:16:49,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {13823#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13823#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:16:49,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {13823#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13830#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:16:49,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {13830#(<= init_nondet_~i~0 7)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13830#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:16:49,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {13830#(<= init_nondet_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13837#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:16:49,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {13837#(<= init_nondet_~i~0 8)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13837#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:16:49,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {13837#(<= init_nondet_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13844#(<= init_nondet_~i~0 9)} is VALID [2018-11-23 12:16:49,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {13844#(<= init_nondet_~i~0 9)} assume !(~i~0 < 60); {13756#false} is VALID [2018-11-23 12:16:49,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {13756#false} assume true; {13756#false} is VALID [2018-11-23 12:16:49,329 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13756#false} {13755#true} #82#return; {13756#false} is VALID [2018-11-23 12:16:49,329 INFO L273 TraceCheckUtils]: 29: Hoare triple {13756#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {13756#false} is VALID [2018-11-23 12:16:49,329 INFO L256 TraceCheckUtils]: 30: Hoare triple {13756#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {13756#false} is VALID [2018-11-23 12:16:49,329 INFO L273 TraceCheckUtils]: 31: Hoare triple {13756#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; {13756#false} is VALID [2018-11-23 12:16:49,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,332 INFO L273 TraceCheckUtils]: 43: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,332 INFO L273 TraceCheckUtils]: 44: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,333 INFO L273 TraceCheckUtils]: 48: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,333 INFO L273 TraceCheckUtils]: 49: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,333 INFO L273 TraceCheckUtils]: 53: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L273 TraceCheckUtils]: 55: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {13756#false} assume !(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L273 TraceCheckUtils]: 57: Hoare triple {13756#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); {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L273 TraceCheckUtils]: 58: Hoare triple {13756#false} assume true; {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {13756#false} {13756#false} #84#return; {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L273 TraceCheckUtils]: 60: Hoare triple {13756#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); {13756#false} is VALID [2018-11-23 12:16:49,334 INFO L256 TraceCheckUtils]: 61: Hoare triple {13756#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {13756#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; {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 63: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 65: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 66: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 67: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 68: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 69: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,335 INFO L273 TraceCheckUtils]: 70: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 71: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 72: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 73: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 74: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 75: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 76: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 77: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 78: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,336 INFO L273 TraceCheckUtils]: 79: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 80: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 81: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 82: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 83: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 84: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 85: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 86: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {13756#false} assume !(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,337 INFO L273 TraceCheckUtils]: 88: Hoare triple {13756#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); {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {13756#false} assume true; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {13756#false} {13756#false} #86#return; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 91: Hoare triple {13756#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; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 92: Hoare triple {13756#false} assume !!(~i~2 < 59);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; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 93: Hoare triple {13756#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 94: Hoare triple {13756#false} assume !!(~i~2 < 59);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; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 95: Hoare triple {13756#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 96: Hoare triple {13756#false} assume !!(~i~2 < 59);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; {13756#false} is VALID [2018-11-23 12:16:49,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {13756#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 98: Hoare triple {13756#false} assume !!(~i~2 < 59);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; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 99: Hoare triple {13756#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 100: Hoare triple {13756#false} assume !!(~i~2 < 59);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; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 101: Hoare triple {13756#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 102: Hoare triple {13756#false} assume !!(~i~2 < 59);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; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 103: Hoare triple {13756#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 104: Hoare triple {13756#false} assume !(~i~2 < 59); {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L273 TraceCheckUtils]: 105: Hoare triple {13756#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {13756#false} is VALID [2018-11-23 12:16:49,339 INFO L256 TraceCheckUtils]: 106: Hoare triple {13756#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 107: Hoare triple {13756#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; {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 108: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 109: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 110: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 111: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 112: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 113: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,340 INFO L273 TraceCheckUtils]: 114: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 115: Hoare triple {13756#false} assume !(~i~1 > 30); {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 116: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 117: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 118: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 119: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 120: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 121: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 122: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,341 INFO L273 TraceCheckUtils]: 123: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 124: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 125: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 126: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 127: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 128: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 129: Hoare triple {13756#false} assume !!(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 130: Hoare triple {13756#false} assume ~i~1 > 30;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; {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 131: Hoare triple {13756#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13756#false} is VALID [2018-11-23 12:16:49,342 INFO L273 TraceCheckUtils]: 132: Hoare triple {13756#false} assume !(~i~1 < 60); {13756#false} is VALID [2018-11-23 12:16:49,343 INFO L273 TraceCheckUtils]: 133: Hoare triple {13756#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); {13756#false} is VALID [2018-11-23 12:16:49,343 INFO L273 TraceCheckUtils]: 134: Hoare triple {13756#false} assume true; {13756#false} is VALID [2018-11-23 12:16:49,343 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {13756#false} {13756#false} #88#return; {13756#false} is VALID [2018-11-23 12:16:49,343 INFO L273 TraceCheckUtils]: 136: Hoare triple {13756#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {13756#false} is VALID [2018-11-23 12:16:49,343 INFO L273 TraceCheckUtils]: 137: Hoare triple {13756#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13756#false} is VALID [2018-11-23 12:16:49,343 INFO L273 TraceCheckUtils]: 138: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2018-11-23 12:16:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2018-11-23 12:16:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:49,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:16:49,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2018-11-23 12:16:49,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:49,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:16:49,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:49,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:16:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:16:49,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:49,422 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 12 states. [2018-11-23 12:16:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,674 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2018-11-23 12:16:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:16:49,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2018-11-23 12:16:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 86 transitions. [2018-11-23 12:16:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 86 transitions. [2018-11-23 12:16:49,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 86 transitions. [2018-11-23 12:16:49,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:49,788 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:16:49,788 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 12:16:49,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 12:16:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 12:16:49,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:49,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 12:16:49,826 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 12:16:49,827 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 12:16:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,829 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-23 12:16:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-23 12:16:49,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:49,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:49,830 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 12:16:49,831 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 12:16:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,832 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-23 12:16:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-23 12:16:49,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:49,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:49,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:49,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:16:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-11-23 12:16:49,835 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 139 [2018-11-23 12:16:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:49,835 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-11-23 12:16:49,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:16:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-11-23 12:16:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:16:49,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:49,837 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 15, 10, 10, 9, 6, 6, 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] [2018-11-23 12:16:49,837 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:49,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash -984570890, now seen corresponding path program 20 times [2018-11-23 12:16:49,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:49,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:49,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:49,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:49,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:49,851 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:16:49,851 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:16:49,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:16:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:49,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:49,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:50,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {14671#true} call ULTIMATE.init(); {14671#true} is VALID [2018-11-23 12:16:50,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {14671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14671#true} is VALID [2018-11-23 12:16:50,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {14671#true} assume true; {14671#true} is VALID [2018-11-23 12:16:50,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14671#true} {14671#true} #78#return; {14671#true} is VALID [2018-11-23 12:16:50,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {14671#true} call #t~ret12 := main(); {14671#true} is VALID [2018-11-23 12:16:50,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {14671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {14671#true} is VALID [2018-11-23 12:16:50,274 INFO L256 TraceCheckUtils]: 6: Hoare triple {14671#true} call init_nondet(~#x~0.base, ~#x~0.offset); {14671#true} is VALID [2018-11-23 12:16:50,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {14671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {14697#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:16:50,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {14697#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14697#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:16:50,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {14697#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14704#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:16:50,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {14704#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14704#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:16:50,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {14704#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14711#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:16:50,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {14711#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14711#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:16:50,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {14711#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14718#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:16:50,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {14718#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14718#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:16:50,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {14718#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14725#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:16:50,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {14725#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14725#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:16:50,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {14725#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14732#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:16:50,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {14732#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14732#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:16:50,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {14732#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14739#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:16:50,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {14739#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14739#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:16:50,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {14739#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14746#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:16:50,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {14746#(<= init_nondet_~i~0 7)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14746#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:16:50,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {14746#(<= init_nondet_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14753#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:16:50,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {14753#(<= init_nondet_~i~0 8)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14753#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:16:50,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {14753#(<= init_nondet_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14760#(<= init_nondet_~i~0 9)} is VALID [2018-11-23 12:16:50,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {14760#(<= init_nondet_~i~0 9)} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14760#(<= init_nondet_~i~0 9)} is VALID [2018-11-23 12:16:50,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {14760#(<= init_nondet_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14767#(<= init_nondet_~i~0 10)} is VALID [2018-11-23 12:16:50,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {14767#(<= init_nondet_~i~0 10)} assume !(~i~0 < 60); {14672#false} is VALID [2018-11-23 12:16:50,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {14672#false} assume true; {14672#false} is VALID [2018-11-23 12:16:50,287 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {14672#false} {14671#true} #82#return; {14672#false} is VALID [2018-11-23 12:16:50,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {14672#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {14672#false} is VALID [2018-11-23 12:16:50,287 INFO L256 TraceCheckUtils]: 32: Hoare triple {14672#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {14672#false} is VALID [2018-11-23 12:16:50,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {14672#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; {14672#false} is VALID [2018-11-23 12:16:50,287 INFO L273 TraceCheckUtils]: 34: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,288 INFO L273 TraceCheckUtils]: 36: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,288 INFO L273 TraceCheckUtils]: 39: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 42: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 45: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 47: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 50: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 57: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {14672#false} assume !(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {14672#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); {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 60: Hoare triple {14672#false} assume true; {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {14672#false} {14672#false} #84#return; {14672#false} is VALID [2018-11-23 12:16:50,291 INFO L273 TraceCheckUtils]: 62: Hoare triple {14672#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); {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L256 TraceCheckUtils]: 63: Hoare triple {14672#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 64: Hoare triple {14672#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; {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 65: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 66: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 67: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,292 INFO L273 TraceCheckUtils]: 70: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 73: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 74: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 75: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 76: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 77: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 78: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,293 INFO L273 TraceCheckUtils]: 79: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 82: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 83: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 84: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 85: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 86: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,294 INFO L273 TraceCheckUtils]: 88: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 89: Hoare triple {14672#false} assume !(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 90: Hoare triple {14672#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); {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 91: Hoare triple {14672#false} assume true; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14672#false} {14672#false} #86#return; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 93: Hoare triple {14672#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; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 94: Hoare triple {14672#false} assume !!(~i~2 < 59);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; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 95: Hoare triple {14672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 96: Hoare triple {14672#false} assume !!(~i~2 < 59);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; {14672#false} is VALID [2018-11-23 12:16:50,295 INFO L273 TraceCheckUtils]: 97: Hoare triple {14672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 98: Hoare triple {14672#false} assume !!(~i~2 < 59);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; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 99: Hoare triple {14672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 100: Hoare triple {14672#false} assume !!(~i~2 < 59);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; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 101: Hoare triple {14672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 102: Hoare triple {14672#false} assume !!(~i~2 < 59);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; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 103: Hoare triple {14672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {14672#false} assume !!(~i~2 < 59);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; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 105: Hoare triple {14672#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14672#false} is VALID [2018-11-23 12:16:50,296 INFO L273 TraceCheckUtils]: 106: Hoare triple {14672#false} assume !(~i~2 < 59); {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 107: Hoare triple {14672#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L256 TraceCheckUtils]: 108: Hoare triple {14672#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 109: Hoare triple {14672#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; {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 110: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 111: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 112: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 113: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,297 INFO L273 TraceCheckUtils]: 114: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 115: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 116: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 117: Hoare triple {14672#false} assume !(~i~1 > 30); {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 118: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 119: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 120: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 121: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 122: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,298 INFO L273 TraceCheckUtils]: 123: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 124: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 125: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 126: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 127: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 128: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 129: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 130: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 131: Hoare triple {14672#false} assume !!(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,299 INFO L273 TraceCheckUtils]: 132: Hoare triple {14672#false} assume ~i~1 > 30;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; {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 133: Hoare triple {14672#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 134: Hoare triple {14672#false} assume !(~i~1 < 60); {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 135: Hoare triple {14672#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); {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 136: Hoare triple {14672#false} assume true; {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L268 TraceCheckUtils]: 137: Hoare quadruple {14672#false} {14672#false} #88#return; {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 138: Hoare triple {14672#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 139: Hoare triple {14672#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {14672#false} is VALID [2018-11-23 12:16:50,300 INFO L273 TraceCheckUtils]: 140: Hoare triple {14672#false} assume !false; {14672#false} is VALID [2018-11-23 12:16:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2018-11-23 12:16:50,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:50,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 12:16:50,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2018-11-23 12:16:50,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:50,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:16:50,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:50,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:16:50,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:16:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:50,380 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 13 states. [2018-11-23 12:16:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,629 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-11-23 12:16:50,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:16:50,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2018-11-23 12:16:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2018-11-23 12:16:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2018-11-23 12:16:50,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 88 transitions. [2018-11-23 12:16:50,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:50,714 INFO L225 Difference]: With dead ends: 142 [2018-11-23 12:16:50,715 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:16:50,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:16:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 12:16:50,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:50,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-23 12:16:50,758 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-23 12:16:50,758 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-23 12:16:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,760 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-11-23 12:16:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-23 12:16:50,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,761 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-23 12:16:50,761 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-23 12:16:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,763 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-11-23 12:16:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-23 12:16:50,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:50,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:16:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-11-23 12:16:50,765 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 141 [2018-11-23 12:16:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:50,765 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-11-23 12:16:50,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:16:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-11-23 12:16:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 12:16:50,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:50,767 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 15, 11, 11, 9, 6, 6, 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] [2018-11-23 12:16:50,767 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:50,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1446854004, now seen corresponding path program 21 times [2018-11-23 12:16:50,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:16:50,780 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:16:50,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:16:50,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:00,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 12:17:00,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:00,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:00,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {15604#true} call ULTIMATE.init(); {15604#true} is VALID [2018-11-23 12:17:00,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {15604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15604#true} is VALID [2018-11-23 12:17:00,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {15604#true} assume true; {15604#true} is VALID [2018-11-23 12:17:00,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15604#true} {15604#true} #78#return; {15604#true} is VALID [2018-11-23 12:17:00,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {15604#true} call #t~ret12 := main(); {15604#true} is VALID [2018-11-23 12:17:00,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {15604#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {15604#true} is VALID [2018-11-23 12:17:00,808 INFO L256 TraceCheckUtils]: 6: Hoare triple {15604#true} call init_nondet(~#x~0.base, ~#x~0.offset); {15604#true} is VALID [2018-11-23 12:17:00,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {15604#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {15604#true} is VALID [2018-11-23 12:17:00,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {15604#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {15604#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {15604#true} assume !(~i~0 < 60); {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {15604#true} assume true; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {15604#true} {15604#true} #82#return; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {15604#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L256 TraceCheckUtils]: 34: Hoare triple {15604#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {15604#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; {15604#true} is VALID [2018-11-23 12:17:00,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {15604#true} assume !(~i~1 > 30); {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 39: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 40: Hoare triple {15604#true} assume !(~i~1 > 30); {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 42: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {15604#true} assume !(~i~1 > 30); {15604#true} is VALID [2018-11-23 12:17:00,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 52: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,814 INFO L273 TraceCheckUtils]: 53: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 55: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 58: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 59: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 60: Hoare triple {15604#true} assume !(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 61: Hoare triple {15604#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); {15604#true} is VALID [2018-11-23 12:17:00,815 INFO L273 TraceCheckUtils]: 62: Hoare triple {15604#true} assume true; {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {15604#true} {15604#true} #84#return; {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 64: Hoare triple {15604#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); {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L256 TraceCheckUtils]: 65: Hoare triple {15604#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 66: Hoare triple {15604#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; {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 67: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {15604#true} assume !(~i~1 > 30); {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,816 INFO L273 TraceCheckUtils]: 71: Hoare triple {15604#true} assume !(~i~1 > 30); {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 72: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 73: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 74: Hoare triple {15604#true} assume !(~i~1 > 30); {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 76: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 77: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 78: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 79: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,817 INFO L273 TraceCheckUtils]: 80: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 81: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 82: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 83: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 84: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 85: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 86: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 87: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 88: Hoare triple {15604#true} assume !!(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,818 INFO L273 TraceCheckUtils]: 89: Hoare triple {15604#true} assume ~i~1 > 30;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; {15604#true} is VALID [2018-11-23 12:17:00,819 INFO L273 TraceCheckUtils]: 90: Hoare triple {15604#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15604#true} is VALID [2018-11-23 12:17:00,819 INFO L273 TraceCheckUtils]: 91: Hoare triple {15604#true} assume !(~i~1 < 60); {15604#true} is VALID [2018-11-23 12:17:00,819 INFO L273 TraceCheckUtils]: 92: Hoare triple {15604#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); {15604#true} is VALID [2018-11-23 12:17:00,819 INFO L273 TraceCheckUtils]: 93: Hoare triple {15604#true} assume true; {15604#true} is VALID [2018-11-23 12:17:00,819 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {15604#true} {15604#true} #86#return; {15604#true} is VALID [2018-11-23 12:17:00,820 INFO L273 TraceCheckUtils]: 95: Hoare triple {15604#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; {15894#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:00,820 INFO L273 TraceCheckUtils]: 96: Hoare triple {15894#(<= main_~i~2 0)} assume !!(~i~2 < 59);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; {15894#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:00,820 INFO L273 TraceCheckUtils]: 97: Hoare triple {15894#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15901#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:00,821 INFO L273 TraceCheckUtils]: 98: Hoare triple {15901#(<= main_~i~2 1)} assume !!(~i~2 < 59);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; {15901#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:00,821 INFO L273 TraceCheckUtils]: 99: Hoare triple {15901#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15908#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:00,821 INFO L273 TraceCheckUtils]: 100: Hoare triple {15908#(<= main_~i~2 2)} assume !!(~i~2 < 59);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; {15908#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:00,822 INFO L273 TraceCheckUtils]: 101: Hoare triple {15908#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15915#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:00,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {15915#(<= main_~i~2 3)} assume !!(~i~2 < 59);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; {15915#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:00,823 INFO L273 TraceCheckUtils]: 103: Hoare triple {15915#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15922#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:00,823 INFO L273 TraceCheckUtils]: 104: Hoare triple {15922#(<= main_~i~2 4)} assume !!(~i~2 < 59);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; {15922#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:00,824 INFO L273 TraceCheckUtils]: 105: Hoare triple {15922#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15929#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:00,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {15929#(<= main_~i~2 5)} assume !!(~i~2 < 59);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; {15929#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:00,825 INFO L273 TraceCheckUtils]: 107: Hoare triple {15929#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15936#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:00,826 INFO L273 TraceCheckUtils]: 108: Hoare triple {15936#(<= main_~i~2 6)} assume !(~i~2 < 59); {15605#false} is VALID [2018-11-23 12:17:00,826 INFO L273 TraceCheckUtils]: 109: Hoare triple {15605#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {15605#false} is VALID [2018-11-23 12:17:00,826 INFO L256 TraceCheckUtils]: 110: Hoare triple {15605#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {15605#false} is VALID [2018-11-23 12:17:00,826 INFO L273 TraceCheckUtils]: 111: Hoare triple {15605#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; {15605#false} is VALID [2018-11-23 12:17:00,826 INFO L273 TraceCheckUtils]: 112: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,827 INFO L273 TraceCheckUtils]: 113: Hoare triple {15605#false} assume !(~i~1 > 30); {15605#false} is VALID [2018-11-23 12:17:00,827 INFO L273 TraceCheckUtils]: 114: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,827 INFO L273 TraceCheckUtils]: 115: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,827 INFO L273 TraceCheckUtils]: 116: Hoare triple {15605#false} assume !(~i~1 > 30); {15605#false} is VALID [2018-11-23 12:17:00,827 INFO L273 TraceCheckUtils]: 117: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,828 INFO L273 TraceCheckUtils]: 118: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,828 INFO L273 TraceCheckUtils]: 119: Hoare triple {15605#false} assume !(~i~1 > 30); {15605#false} is VALID [2018-11-23 12:17:00,828 INFO L273 TraceCheckUtils]: 120: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,828 INFO L273 TraceCheckUtils]: 121: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,828 INFO L273 TraceCheckUtils]: 122: Hoare triple {15605#false} assume ~i~1 > 30;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; {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 123: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 124: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 125: Hoare triple {15605#false} assume ~i~1 > 30;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; {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 126: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 127: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 128: Hoare triple {15605#false} assume ~i~1 > 30;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; {15605#false} is VALID [2018-11-23 12:17:00,829 INFO L273 TraceCheckUtils]: 129: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 130: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 131: Hoare triple {15605#false} assume ~i~1 > 30;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; {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 132: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 133: Hoare triple {15605#false} assume !!(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 134: Hoare triple {15605#false} assume ~i~1 > 30;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; {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 135: Hoare triple {15605#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 136: Hoare triple {15605#false} assume !(~i~1 < 60); {15605#false} is VALID [2018-11-23 12:17:00,830 INFO L273 TraceCheckUtils]: 137: Hoare triple {15605#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); {15605#false} is VALID [2018-11-23 12:17:00,831 INFO L273 TraceCheckUtils]: 138: Hoare triple {15605#false} assume true; {15605#false} is VALID [2018-11-23 12:17:00,831 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {15605#false} {15605#false} #88#return; {15605#false} is VALID [2018-11-23 12:17:00,831 INFO L273 TraceCheckUtils]: 140: Hoare triple {15605#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15605#false} is VALID [2018-11-23 12:17:00,831 INFO L273 TraceCheckUtils]: 141: Hoare triple {15605#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15605#false} is VALID [2018-11-23 12:17:00,831 INFO L273 TraceCheckUtils]: 142: Hoare triple {15605#false} assume !false; {15605#false} is VALID [2018-11-23 12:17:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 426 proven. 36 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-23 12:17:00,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:17:00,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:17:00,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-11-23 12:17:00,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:00,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:17:00,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:17:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:17:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:00,926 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 9 states. [2018-11-23 12:17:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,059 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-11-23 12:17:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:17:01,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-11-23 12:17:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-23 12:17:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-23 12:17:01,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2018-11-23 12:17:01,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:01,127 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:17:01,128 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:17:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:17:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-11-23 12:17:01,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:01,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 88 states. [2018-11-23 12:17:01,159 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 88 states. [2018-11-23 12:17:01,160 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 88 states. [2018-11-23 12:17:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,161 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:17:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:17:01,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:01,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:01,162 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 89 states. [2018-11-23 12:17:01,162 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 89 states. [2018-11-23 12:17:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,164 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:17:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:17:01,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:01,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:01,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:01,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:17:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-11-23 12:17:01,167 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 143 [2018-11-23 12:17:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:01,167 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-23 12:17:01,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:17:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-23 12:17:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 12:17:01,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:01,169 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 15, 11, 11, 9, 7, 7, 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] [2018-11-23 12:17:01,169 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:01,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1222305042, now seen corresponding path program 22 times [2018-11-23 12:17:01,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:01,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:01,181 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:17:01,181 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:17:01,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:17:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:01,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:01,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:01,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {16520#true} call ULTIMATE.init(); {16520#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {16520#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16520#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {16520#true} assume true; {16520#true} is VALID [2018-11-23 12:17:01,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16520#true} {16520#true} #78#return; {16520#true} is VALID [2018-11-23 12:17:01,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {16520#true} call #t~ret12 := main(); {16520#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {16520#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {16520#true} is VALID [2018-11-23 12:17:01,537 INFO L256 TraceCheckUtils]: 6: Hoare triple {16520#true} call init_nondet(~#x~0.base, ~#x~0.offset); {16520#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {16520#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {16520#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 27: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {16520#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {16520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {16520#true} assume !(~i~0 < 60); {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {16520#true} assume true; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {16520#true} {16520#true} #82#return; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 33: Hoare triple {16520#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L256 TraceCheckUtils]: 34: Hoare triple {16520#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {16520#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 35: Hoare triple {16520#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; {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 36: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 37: Hoare triple {16520#true} assume !(~i~1 > 30); {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 38: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 39: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 40: Hoare triple {16520#true} assume !(~i~1 > 30); {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 41: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 43: Hoare triple {16520#true} assume !(~i~1 > 30); {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 46: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 47: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 48: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 49: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 50: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 51: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,542 INFO L273 TraceCheckUtils]: 52: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 53: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 54: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 55: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 56: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 57: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {16520#true} assume !(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,543 INFO L273 TraceCheckUtils]: 61: Hoare triple {16520#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); {16520#true} is VALID [2018-11-23 12:17:01,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {16520#true} assume true; {16520#true} is VALID [2018-11-23 12:17:01,544 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {16520#true} {16520#true} #84#return; {16520#true} is VALID [2018-11-23 12:17:01,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {16520#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); {16520#true} is VALID [2018-11-23 12:17:01,544 INFO L256 TraceCheckUtils]: 65: Hoare triple {16520#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {16520#true} is VALID [2018-11-23 12:17:01,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {16520#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; {16520#true} is VALID [2018-11-23 12:17:01,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,545 INFO L273 TraceCheckUtils]: 68: Hoare triple {16520#true} assume !(~i~1 > 30); {16520#true} is VALID [2018-11-23 12:17:01,545 INFO L273 TraceCheckUtils]: 69: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,545 INFO L273 TraceCheckUtils]: 70: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {16520#true} assume !(~i~1 > 30); {16520#true} is VALID [2018-11-23 12:17:01,545 INFO L273 TraceCheckUtils]: 72: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,545 INFO L273 TraceCheckUtils]: 73: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,546 INFO L273 TraceCheckUtils]: 74: Hoare triple {16520#true} assume !(~i~1 > 30); {16520#true} is VALID [2018-11-23 12:17:01,546 INFO L273 TraceCheckUtils]: 75: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,546 INFO L273 TraceCheckUtils]: 76: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,546 INFO L273 TraceCheckUtils]: 77: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,546 INFO L273 TraceCheckUtils]: 78: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,546 INFO L273 TraceCheckUtils]: 79: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,547 INFO L273 TraceCheckUtils]: 80: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,547 INFO L273 TraceCheckUtils]: 81: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,547 INFO L273 TraceCheckUtils]: 82: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,547 INFO L273 TraceCheckUtils]: 83: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,547 INFO L273 TraceCheckUtils]: 84: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,547 INFO L273 TraceCheckUtils]: 85: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,548 INFO L273 TraceCheckUtils]: 86: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,548 INFO L273 TraceCheckUtils]: 87: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,548 INFO L273 TraceCheckUtils]: 88: Hoare triple {16520#true} assume !!(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,548 INFO L273 TraceCheckUtils]: 89: Hoare triple {16520#true} assume ~i~1 > 30;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; {16520#true} is VALID [2018-11-23 12:17:01,548 INFO L273 TraceCheckUtils]: 90: Hoare triple {16520#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16520#true} is VALID [2018-11-23 12:17:01,548 INFO L273 TraceCheckUtils]: 91: Hoare triple {16520#true} assume !(~i~1 < 60); {16520#true} is VALID [2018-11-23 12:17:01,549 INFO L273 TraceCheckUtils]: 92: Hoare triple {16520#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); {16520#true} is VALID [2018-11-23 12:17:01,549 INFO L273 TraceCheckUtils]: 93: Hoare triple {16520#true} assume true; {16520#true} is VALID [2018-11-23 12:17:01,549 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {16520#true} {16520#true} #86#return; {16520#true} is VALID [2018-11-23 12:17:01,549 INFO L273 TraceCheckUtils]: 95: Hoare triple {16520#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; {16520#true} is VALID [2018-11-23 12:17:01,549 INFO L273 TraceCheckUtils]: 96: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,549 INFO L273 TraceCheckUtils]: 97: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,550 INFO L273 TraceCheckUtils]: 98: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,550 INFO L273 TraceCheckUtils]: 99: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,550 INFO L273 TraceCheckUtils]: 100: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,550 INFO L273 TraceCheckUtils]: 101: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,550 INFO L273 TraceCheckUtils]: 102: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,550 INFO L273 TraceCheckUtils]: 103: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,551 INFO L273 TraceCheckUtils]: 104: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,551 INFO L273 TraceCheckUtils]: 105: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,551 INFO L273 TraceCheckUtils]: 106: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,551 INFO L273 TraceCheckUtils]: 107: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,551 INFO L273 TraceCheckUtils]: 108: Hoare triple {16520#true} assume !!(~i~2 < 59);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; {16520#true} is VALID [2018-11-23 12:17:01,551 INFO L273 TraceCheckUtils]: 109: Hoare triple {16520#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16520#true} is VALID [2018-11-23 12:17:01,552 INFO L273 TraceCheckUtils]: 110: Hoare triple {16520#true} assume !(~i~2 < 59); {16520#true} is VALID [2018-11-23 12:17:01,552 INFO L273 TraceCheckUtils]: 111: Hoare triple {16520#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {16520#true} is VALID [2018-11-23 12:17:01,552 INFO L256 TraceCheckUtils]: 112: Hoare triple {16520#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {16520#true} is VALID [2018-11-23 12:17:01,568 INFO L273 TraceCheckUtils]: 113: Hoare triple {16520#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; {16864#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:17:01,577 INFO L273 TraceCheckUtils]: 114: Hoare triple {16864#(<= rangesum_~i~1 0)} assume !!(~i~1 < 60); {16864#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:17:01,578 INFO L273 TraceCheckUtils]: 115: Hoare triple {16864#(<= rangesum_~i~1 0)} assume !(~i~1 > 30); {16864#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:17:01,579 INFO L273 TraceCheckUtils]: 116: Hoare triple {16864#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16874#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:17:01,579 INFO L273 TraceCheckUtils]: 117: Hoare triple {16874#(<= rangesum_~i~1 1)} assume !!(~i~1 < 60); {16874#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:17:01,583 INFO L273 TraceCheckUtils]: 118: Hoare triple {16874#(<= rangesum_~i~1 1)} assume !(~i~1 > 30); {16874#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:17:01,583 INFO L273 TraceCheckUtils]: 119: Hoare triple {16874#(<= rangesum_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16884#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:17:01,585 INFO L273 TraceCheckUtils]: 120: Hoare triple {16884#(<= rangesum_~i~1 2)} assume !!(~i~1 < 60); {16884#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:17:01,585 INFO L273 TraceCheckUtils]: 121: Hoare triple {16884#(<= rangesum_~i~1 2)} assume !(~i~1 > 30); {16884#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:17:01,587 INFO L273 TraceCheckUtils]: 122: Hoare triple {16884#(<= rangesum_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16894#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:17:01,587 INFO L273 TraceCheckUtils]: 123: Hoare triple {16894#(<= rangesum_~i~1 3)} assume !!(~i~1 < 60); {16894#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:17:01,589 INFO L273 TraceCheckUtils]: 124: Hoare triple {16894#(<= rangesum_~i~1 3)} assume ~i~1 > 30;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; {16894#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:17:01,589 INFO L273 TraceCheckUtils]: 125: Hoare triple {16894#(<= rangesum_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= rangesum_~i~1 4)} is VALID [2018-11-23 12:17:01,589 INFO L273 TraceCheckUtils]: 126: Hoare triple {16904#(<= rangesum_~i~1 4)} assume !!(~i~1 < 60); {16904#(<= rangesum_~i~1 4)} is VALID [2018-11-23 12:17:01,590 INFO L273 TraceCheckUtils]: 127: Hoare triple {16904#(<= rangesum_~i~1 4)} assume ~i~1 > 30;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; {16521#false} is VALID [2018-11-23 12:17:01,590 INFO L273 TraceCheckUtils]: 128: Hoare triple {16521#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16521#false} is VALID [2018-11-23 12:17:01,590 INFO L273 TraceCheckUtils]: 129: Hoare triple {16521#false} assume !!(~i~1 < 60); {16521#false} is VALID [2018-11-23 12:17:01,590 INFO L273 TraceCheckUtils]: 130: Hoare triple {16521#false} assume ~i~1 > 30;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; {16521#false} is VALID [2018-11-23 12:17:01,590 INFO L273 TraceCheckUtils]: 131: Hoare triple {16521#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 132: Hoare triple {16521#false} assume !!(~i~1 < 60); {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 133: Hoare triple {16521#false} assume ~i~1 > 30;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; {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 134: Hoare triple {16521#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 135: Hoare triple {16521#false} assume !!(~i~1 < 60); {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 136: Hoare triple {16521#false} assume ~i~1 > 30;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; {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 137: Hoare triple {16521#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 138: Hoare triple {16521#false} assume !(~i~1 < 60); {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 139: Hoare triple {16521#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); {16521#false} is VALID [2018-11-23 12:17:01,591 INFO L273 TraceCheckUtils]: 140: Hoare triple {16521#false} assume true; {16521#false} is VALID [2018-11-23 12:17:01,592 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {16521#false} {16520#true} #88#return; {16521#false} is VALID [2018-11-23 12:17:01,592 INFO L273 TraceCheckUtils]: 142: Hoare triple {16521#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16521#false} is VALID [2018-11-23 12:17:01,592 INFO L273 TraceCheckUtils]: 143: Hoare triple {16521#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16521#false} is VALID [2018-11-23 12:17:01,592 INFO L273 TraceCheckUtils]: 144: Hoare triple {16521#false} assume !false; {16521#false} is VALID [2018-11-23 12:17:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 475 proven. 26 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2018-11-23 12:17:01,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:17:01,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:17:01,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-11-23 12:17:01,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:01,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:17:01,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:01,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:17:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:17:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:17:01,671 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 7 states. [2018-11-23 12:17:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,065 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-11-23 12:17:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:17:02,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-11-23 12:17:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:17:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:17:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:17:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:17:02,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2018-11-23 12:17:02,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:02,141 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:17:02,141 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:17:02,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:17:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:17:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-23 12:17:02,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:02,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 94 states. [2018-11-23 12:17:02,188 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 94 states. [2018-11-23 12:17:02,189 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 94 states. [2018-11-23 12:17:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,191 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-11-23 12:17:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-11-23 12:17:02,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,192 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 95 states. [2018-11-23 12:17:02,192 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 95 states. [2018-11-23 12:17:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,194 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-11-23 12:17:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-11-23 12:17:02,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:02,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:17:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-11-23 12:17:02,196 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 145 [2018-11-23 12:17:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:02,196 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-11-23 12:17:02,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:17:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-11-23 12:17:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:17:02,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:02,197 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 15, 15, 11, 11, 7, 7, 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] [2018-11-23 12:17:02,198 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:02,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2039261422, now seen corresponding path program 23 times [2018-11-23 12:17:02,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,210 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:17:02,210 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:17:02,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:17:02,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:02,329 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:17:02,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:02,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:02,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {17495#true} call ULTIMATE.init(); {17495#true} is VALID [2018-11-23 12:17:02,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {17495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17495#true} is VALID [2018-11-23 12:17:02,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {17495#true} assume true; {17495#true} is VALID [2018-11-23 12:17:02,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17495#true} {17495#true} #78#return; {17495#true} is VALID [2018-11-23 12:17:02,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {17495#true} call #t~ret12 := main(); {17495#true} is VALID [2018-11-23 12:17:02,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {17495#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); {17495#true} is VALID [2018-11-23 12:17:02,552 INFO L256 TraceCheckUtils]: 6: Hoare triple {17495#true} call init_nondet(~#x~0.base, ~#x~0.offset); {17495#true} is VALID [2018-11-23 12:17:02,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {17495#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {17495#true} is VALID [2018-11-23 12:17:02,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {17495#true} assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {17495#true} is VALID [2018-11-23 12:17:02,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {17495#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {17495#true} assume !(~i~0 < 60); {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {17495#true} assume true; {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {17495#true} {17495#true} #82#return; {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {17495#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L256 TraceCheckUtils]: 34: Hoare triple {17495#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 35: Hoare triple {17495#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; {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {17495#true} assume !!(~i~1 < 60); {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {17495#true} assume !(~i~1 > 30); {17495#true} is VALID [2018-11-23 12:17:02,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {17495#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {17495#true} assume !!(~i~1 < 60); {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {17495#true} assume !(~i~1 > 30); {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {17495#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {17495#true} assume !!(~i~1 < 60); {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 43: Hoare triple {17495#true} assume !(~i~1 > 30); {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {17495#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {17495#true} assume !!(~i~1 < 60); {17495#true} is VALID [2018-11-23 12:17:02,557 INFO L273 TraceCheckUtils]: 46: Hoare triple {17495#true} assume !(~i~1 > 30); {17495#true} is VALID [2018-11-23 12:17:02,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {17495#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17495#true} is VALID [2018-11-23 12:17:02,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {17495#true} assume !!(~i~1 < 60); {17495#true} is VALID [2018-11-23 12:17:02,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {17495#true} assume !(~i~1 > 30); {17647#(<= rangesum_~i~1 30)} is VALID [2018-11-23 12:17:02,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {17647#(<= rangesum_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17651#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:17:02,559 INFO L273 TraceCheckUtils]: 51: Hoare triple {17651#(<= rangesum_~i~1 31)} assume !!(~i~1 < 60); {17651#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:17:02,559 INFO L273 TraceCheckUtils]: 52: Hoare triple {17651#(<= rangesum_~i~1 31)} assume ~i~1 > 30;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; {17651#(<= rangesum_~i~1 31)} is VALID [2018-11-23 12:17:02,561 INFO L273 TraceCheckUtils]: 53: Hoare triple {17651#(<= rangesum_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17661#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:17:02,561 INFO L273 TraceCheckUtils]: 54: Hoare triple {17661#(<= rangesum_~i~1 32)} assume !!(~i~1 < 60); {17661#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:17:02,563 INFO L273 TraceCheckUtils]: 55: Hoare triple {17661#(<= rangesum_~i~1 32)} assume ~i~1 > 30;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; {17661#(<= rangesum_~i~1 32)} is VALID [2018-11-23 12:17:02,564 INFO L273 TraceCheckUtils]: 56: Hoare triple {17661#(<= rangesum_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17671#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:17:02,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {17671#(<= rangesum_~i~1 33)} assume !!(~i~1 < 60); {17671#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:17:02,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {17671#(<= rangesum_~i~1 33)} assume ~i~1 > 30;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; {17671#(<= rangesum_~i~1 33)} is VALID [2018-11-23 12:17:02,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {17671#(<= rangesum_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17681#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:17:02,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {17681#(<= rangesum_~i~1 34)} assume !!(~i~1 < 60); {17681#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:17:02,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {17681#(<= rangesum_~i~1 34)} assume ~i~1 > 30;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; {17681#(<= rangesum_~i~1 34)} is VALID [2018-11-23 12:17:02,566 INFO L273 TraceCheckUtils]: 62: Hoare triple {17681#(<= rangesum_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17691#(<= rangesum_~i~1 35)} is VALID [2018-11-23 12:17:02,566 INFO L273 TraceCheckUtils]: 63: Hoare triple {17691#(<= rangesum_~i~1 35)} assume !!(~i~1 < 60); {17691#(<= rangesum_~i~1 35)} is VALID [2018-11-23 12:17:02,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {17691#(<= rangesum_~i~1 35)} assume ~i~1 > 30;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; {17691#(<= rangesum_~i~1 35)} is VALID [2018-11-23 12:17:02,567 INFO L273 TraceCheckUtils]: 65: Hoare triple {17691#(<= rangesum_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17701#(<= rangesum_~i~1 36)} is VALID [2018-11-23 12:17:02,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {17701#(<= rangesum_~i~1 36)} assume !(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {17496#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); {17496#false} is VALID [2018-11-23 12:17:02,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {17496#false} assume true; {17496#false} is VALID [2018-11-23 12:17:02,569 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {17496#false} {17495#true} #84#return; {17496#false} is VALID [2018-11-23 12:17:02,569 INFO L273 TraceCheckUtils]: 70: Hoare triple {17496#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); {17496#false} is VALID [2018-11-23 12:17:02,569 INFO L256 TraceCheckUtils]: 71: Hoare triple {17496#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {17496#false} is VALID [2018-11-23 12:17:02,570 INFO L273 TraceCheckUtils]: 72: Hoare triple {17496#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; {17496#false} is VALID [2018-11-23 12:17:02,570 INFO L273 TraceCheckUtils]: 73: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,570 INFO L273 TraceCheckUtils]: 74: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,570 INFO L273 TraceCheckUtils]: 75: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,571 INFO L273 TraceCheckUtils]: 76: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,571 INFO L273 TraceCheckUtils]: 77: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,571 INFO L273 TraceCheckUtils]: 78: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 79: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 80: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 81: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 82: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 83: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 84: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 85: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,572 INFO L273 TraceCheckUtils]: 86: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 87: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 88: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 89: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 90: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 91: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 92: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 93: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 94: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,573 INFO L273 TraceCheckUtils]: 95: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 96: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 97: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 98: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 99: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 100: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 101: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 102: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 103: Hoare triple {17496#false} assume !(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,574 INFO L273 TraceCheckUtils]: 104: Hoare triple {17496#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); {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 105: Hoare triple {17496#false} assume true; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {17496#false} {17496#false} #86#return; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 107: Hoare triple {17496#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; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 108: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 109: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 110: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 111: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,575 INFO L273 TraceCheckUtils]: 112: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 113: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 114: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 115: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 116: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 117: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 118: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 119: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 120: Hoare triple {17496#false} assume !!(~i~2 < 59);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; {17496#false} is VALID [2018-11-23 12:17:02,576 INFO L273 TraceCheckUtils]: 121: Hoare triple {17496#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 122: Hoare triple {17496#false} assume !(~i~2 < 59); {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 123: Hoare triple {17496#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L256 TraceCheckUtils]: 124: Hoare triple {17496#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 125: Hoare triple {17496#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; {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 126: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 127: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 128: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 129: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,577 INFO L273 TraceCheckUtils]: 130: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 131: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 132: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 133: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 134: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 135: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 136: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 137: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 138: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,578 INFO L273 TraceCheckUtils]: 139: Hoare triple {17496#false} assume !(~i~1 > 30); {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 140: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 141: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 142: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 143: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 144: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 145: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 146: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 147: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,579 INFO L273 TraceCheckUtils]: 148: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 149: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 150: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 151: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 152: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 153: Hoare triple {17496#false} assume !!(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 154: Hoare triple {17496#false} assume ~i~1 > 30;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; {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 155: Hoare triple {17496#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 156: Hoare triple {17496#false} assume !(~i~1 < 60); {17496#false} is VALID [2018-11-23 12:17:02,580 INFO L273 TraceCheckUtils]: 157: Hoare triple {17496#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); {17496#false} is VALID [2018-11-23 12:17:02,581 INFO L273 TraceCheckUtils]: 158: Hoare triple {17496#false} assume true; {17496#false} is VALID [2018-11-23 12:17:02,581 INFO L268 TraceCheckUtils]: 159: Hoare quadruple {17496#false} {17496#false} #88#return; {17496#false} is VALID [2018-11-23 12:17:02,581 INFO L273 TraceCheckUtils]: 160: Hoare triple {17496#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17496#false} is VALID [2018-11-23 12:17:02,581 INFO L273 TraceCheckUtils]: 161: Hoare triple {17496#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17496#false} is VALID [2018-11-23 12:17:02,581 INFO L273 TraceCheckUtils]: 162: Hoare triple {17496#false} assume !false; {17496#false} is VALID [2018-11-23 12:17:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 723 proven. 40 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-11-23 12:17:02,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:17:02,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:17:02,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2018-11-23 12:17:02,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:02,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:17:02,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:02,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:17:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:17:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:02,670 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 9 states. [2018-11-23 12:17:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,867 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2018-11-23 12:17:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:17:02,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2018-11-23 12:17:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-11-23 12:17:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-11-23 12:17:02,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2018-11-23 12:17:02,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:02,953 INFO L225 Difference]: With dead ends: 158 [2018-11-23 12:17:02,953 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:17:02,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:17:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 12:17:03,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:03,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-23 12:17:03,039 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-23 12:17:03,039 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-23 12:17:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:03,041 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-23 12:17:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-23 12:17:03,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:03,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:03,043 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-23 12:17:03,044 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-23 12:17:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:03,045 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-23 12:17:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-23 12:17:03,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:03,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:03,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:03,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:17:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-11-23 12:17:03,048 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 163 [2018-11-23 12:17:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:03,049 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-11-23 12:17:03,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:17:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-11-23 12:17:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:17:03,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:03,050 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 18, 15, 11, 11, 7, 7, 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] [2018-11-23 12:17:03,050 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:03,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 787007752, now seen corresponding path program 24 times [2018-11-23 12:17:03,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:03,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:03,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:03,068 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:17:03,068 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:17:03,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:17:03,082 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE