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/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:41,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:41,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:41,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:41,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:41,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:41,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:41,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:41,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:41,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:41,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:41,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:41,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:41,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:41,973 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:41,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:41,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:41,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:41,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:41,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:41,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:41,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:42,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:42,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:42,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:42,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:42,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:42,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:42,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:42,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:42,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:42,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:42,006 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:42,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:42,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:42,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:42,008 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 13:08:42,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:42,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:42,025 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:42,025 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:42,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:42,026 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:42,027 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:42,027 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:42,027 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:42,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:42,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:42,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:42,028 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:42,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:42,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:42,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:42,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:42,030 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:42,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:42,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:42,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:42,031 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:42,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:42,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:42,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:42,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:42,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:42,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:42,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:42,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:42,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:42,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:42,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:42,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:42,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:42,123 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:42,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-23 13:08:42,195 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b579a79/2137d5252e284cd289532c2b409cae1b/FLAGdaeca18ad [2018-11-23 13:08:42,697 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:42,698 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-23 13:08:42,704 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b579a79/2137d5252e284cd289532c2b409cae1b/FLAGdaeca18ad [2018-11-23 13:08:43,052 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b579a79/2137d5252e284cd289532c2b409cae1b [2018-11-23 13:08:43,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:43,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:43,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:43,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:43,073 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:43,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d4ab50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43, skipping insertion in model container [2018-11-23 13:08:43,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:43,111 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:43,313 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:43,319 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:43,347 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:43,377 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:43,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43 WrapperNode [2018-11-23 13:08:43,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:43,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:43,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:43,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:43,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:43,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:43,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:43,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:43,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:43,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:43,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:43,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:43,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:08:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:08:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:08:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:43,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:43,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:08:44,176 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:44,176 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:08:44,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:44 BoogieIcfgContainer [2018-11-23 13:08:44,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:44,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:44,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:44,183 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:44,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:43" (1/3) ... [2018-11-23 13:08:44,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae7f7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:44, skipping insertion in model container [2018-11-23 13:08:44,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43" (2/3) ... [2018-11-23 13:08:44,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae7f7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:44, skipping insertion in model container [2018-11-23 13:08:44,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:44" (3/3) ... [2018-11-23 13:08:44,187 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-23 13:08:44,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:44,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:44,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:44,258 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:44,258 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:44,259 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:44,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:44,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:44,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:44,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:44,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:44,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:08:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:44,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:44,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:44,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:44,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2018-11-23 13:08:44,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:44,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:44,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:44,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:08:44,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 13:08:44,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:08:44,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #49#return; {27#true} is VALID [2018-11-23 13:08:44,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2018-11-23 13:08:44,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {27#true} is VALID [2018-11-23 13:08:44,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 13:08:44,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~index~0 := 0; {28#false} is VALID [2018-11-23 13:08:44,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {28#false} is VALID [2018-11-23 13:08:44,462 INFO L256 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2018-11-23 13:08:44,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 13:08:44,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:08:44,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:08:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:44,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:08:44,475 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:08:44,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:44,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:08:44,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:44,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:08:44,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:08:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:08:44,568 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 13:08:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:44,786 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 13:08:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:08:44,787 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:08:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 13:08:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 13:08:44,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 13:08:45,182 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 13:08:45,197 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:08:45,197 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:08:45,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:08:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:08:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:08:45,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:45,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,263 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,263 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,266 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:08:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:08:45,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:45,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:45,268 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,268 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,272 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:08:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:08:45,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:45,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:45,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:45,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:08:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 13:08:45,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 13:08:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:45,278 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 13:08:45,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:08:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:08:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:45,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:45,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:45,279 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1443575666, now seen corresponding path program 1 times [2018-11-23 13:08:45,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:45,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {147#true} is VALID [2018-11-23 13:08:45,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {147#true} is VALID [2018-11-23 13:08:45,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2018-11-23 13:08:45,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #49#return; {147#true} is VALID [2018-11-23 13:08:45,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2018-11-23 13:08:45,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {147#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {149#(= main_~index~0 0)} is VALID [2018-11-23 13:08:45,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {149#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {148#false} is VALID [2018-11-23 13:08:45,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {148#false} ~index~0 := 0; {148#false} is VALID [2018-11-23 13:08:45,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {148#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {148#false} is VALID [2018-11-23 13:08:45,373 INFO L256 TraceCheckUtils]: 9: Hoare triple {148#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {148#false} is VALID [2018-11-23 13:08:45,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2018-11-23 13:08:45,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2018-11-23 13:08:45,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {148#false} assume !false; {148#false} is VALID [2018-11-23 13:08:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:45,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:45,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:08:45,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:45,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:45,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:45,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:45,434 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-23 13:08:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,708 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 13:08:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:45,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:08:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 13:08:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 13:08:45,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-11-23 13:08:45,846 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 13:08:45,848 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:08:45,848 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:08:45,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:08:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:08:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-23 13:08:45,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:45,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 20 states. [2018-11-23 13:08:45,868 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 20 states. [2018-11-23 13:08:45,868 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 20 states. [2018-11-23 13:08:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,873 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:08:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:08:45,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:45,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:45,875 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states. [2018-11-23 13:08:45,875 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states. [2018-11-23 13:08:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,879 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:08:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:08:45,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:45,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:45,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:45,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:08:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:08:45,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-23 13:08:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:45,883 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:08:45,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:08:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:08:45,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:45,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:45,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:45,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash 31729808, now seen corresponding path program 1 times [2018-11-23 13:08:45,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:45,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:45,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:45,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:46,291 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-23 13:08:46,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2018-11-23 13:08:46,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {281#true} is VALID [2018-11-23 13:08:46,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2018-11-23 13:08:46,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #49#return; {281#true} is VALID [2018-11-23 13:08:46,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret5 := main(); {281#true} is VALID [2018-11-23 13:08:46,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {281#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {283#(= main_~index~0 0)} is VALID [2018-11-23 13:08:46,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {283#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {283#(= main_~index~0 0)} is VALID [2018-11-23 13:08:46,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {283#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {284#(and (<= main_~index~0 1) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:46,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {284#(and (<= main_~index~0 1) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {282#false} is VALID [2018-11-23 13:08:46,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#false} ~index~0 := 0; {282#false} is VALID [2018-11-23 13:08:46,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {282#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {282#false} is VALID [2018-11-23 13:08:46,401 INFO L256 TraceCheckUtils]: 11: Hoare triple {282#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {282#false} is VALID [2018-11-23 13:08:46,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {282#false} ~cond := #in~cond; {282#false} is VALID [2018-11-23 13:08:46,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {282#false} assume 0 == ~cond; {282#false} is VALID [2018-11-23 13:08:46,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {282#false} assume !false; {282#false} is VALID [2018-11-23 13:08:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:46,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:46,404 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 13:08:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:46,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:46,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:08:46,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:08:46,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:46,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:46,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:46,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-23 13:08:46,720 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:08:46,720 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_6|, main_~tmp~0]. (and (= |#memory_int| (store |v_#memory_int_6| |main_~#array~0.base| (store (select |v_#memory_int_6| |main_~#array~0.base|) |main_~#array~0.offset| main_~tmp~0))) (< 0 (mod main_~tmp~0 4294967296))) [2018-11-23 13:08:46,720 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296)) [2018-11-23 13:08:46,945 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:08:46,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:46,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 13:08:46,992 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:08:46,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 13:08:46,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:47,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:47,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:47,009 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:75, output treesize:9 [2018-11-23 13:08:47,016 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:08:47,016 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|, v_prenex_3, v_prenex_1, v_prenex_2]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse2 (< .cse6 10000)) (.cse1 (* 4 .cse6)) (.cse3 (= 0 main_~index~0)) (.cse4 (<= .cse6 2147483647))) (or (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (and (= |main_#t~mem4| (select .cse0 (+ .cse1 |main_~#array~0.offset|))) .cse2 .cse3 (< 0 (mod (select .cse0 |main_~#array~0.offset|) 4294967296)) .cse4)) (let ((.cse5 (select v_prenex_3 v_prenex_1))) (and (< 0 (mod (select .cse5 v_prenex_2) 4294967296)) .cse2 (= (select .cse5 (+ .cse1 v_prenex_2 (- 17179869184))) |main_#t~mem4|) .cse3 (not .cse4)))))) [2018-11-23 13:08:47,017 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~index~0) (< 0 (mod |main_#t~mem4| 4294967296))) [2018-11-23 13:08:47,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2018-11-23 13:08:47,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {281#true} is VALID [2018-11-23 13:08:47,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2018-11-23 13:08:47,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #49#return; {281#true} is VALID [2018-11-23 13:08:47,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret5 := main(); {281#true} is VALID [2018-11-23 13:08:47,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {281#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {283#(= main_~index~0 0)} is VALID [2018-11-23 13:08:47,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {283#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {306#(< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296))} is VALID [2018-11-23 13:08:47,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {306#(< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296))} is VALID [2018-11-23 13:08:47,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {306#(< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {306#(< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296))} is VALID [2018-11-23 13:08:47,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {306#(< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296))} ~index~0 := 0; {316#(and (= 0 main_~index~0) (< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296)))} is VALID [2018-11-23 13:08:47,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {316#(and (= 0 main_~index~0) (< 0 (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {320#(and (< 0 (mod |main_#t~mem4| 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:08:47,146 INFO L256 TraceCheckUtils]: 11: Hoare triple {320#(and (< 0 (mod |main_#t~mem4| 4294967296)) (= 0 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {324#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:08:47,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {324#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {328#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:08:47,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {282#false} is VALID [2018-11-23 13:08:47,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {282#false} assume !false; {282#false} is VALID [2018-11-23 13:08:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:47,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:47,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2018-11-23 13:08:47,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:08:47,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:47,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:08:47,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:08:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:08:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:08:47,228 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-11-23 13:08:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,877 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 13:08:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:08:47,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:08:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:08:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-23 13:08:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:08:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-23 13:08:47,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2018-11-23 13:08:48,008 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 13:08:48,011 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:08:48,011 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:08:48,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:08:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:08:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-23 13:08:48,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:48,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2018-11-23 13:08:48,050 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2018-11-23 13:08:48,050 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2018-11-23 13:08:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:48,053 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:08:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:08:48,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:48,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:48,055 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2018-11-23 13:08:48,055 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2018-11-23 13:08:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:48,058 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:08:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:08:48,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:48,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:48,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:48,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:08:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 13:08:48,062 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2018-11-23 13:08:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:48,062 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 13:08:48,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:08:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 13:08:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:08:48,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:48,064 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:48,064 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:48,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -744847771, now seen corresponding path program 1 times [2018-11-23 13:08:48,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:48,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:48,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:08:48,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:08:48,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:08:48,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #49#return; {515#true} is VALID [2018-11-23 13:08:48,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret5 := main(); {515#true} is VALID [2018-11-23 13:08:48,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {517#(= main_~index~0 0)} is VALID [2018-11-23 13:08:48,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {517#(= main_~index~0 0)} is VALID [2018-11-23 13:08:48,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {518#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:08:48,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {518#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:08:48,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {519#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 2))} is VALID [2018-11-23 13:08:48,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 2))} assume !(~index~0 % 4294967296 < 10000); {516#false} is VALID [2018-11-23 13:08:48,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} ~index~0 := 0; {516#false} is VALID [2018-11-23 13:08:48,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {516#false} is VALID [2018-11-23 13:08:48,421 INFO L256 TraceCheckUtils]: 13: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {515#true} is VALID [2018-11-23 13:08:48,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {515#true} ~cond := #in~cond; {515#true} is VALID [2018-11-23 13:08:48,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {515#true} assume !(0 == ~cond); {515#true} is VALID [2018-11-23 13:08:48,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:08:48,422 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {515#true} {516#false} #53#return; {516#false} is VALID [2018-11-23 13:08:48,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {516#false} havoc #t~mem4; {516#false} is VALID [2018-11-23 13:08:48,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {516#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {516#false} is VALID [2018-11-23 13:08:48,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {516#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {516#false} is VALID [2018-11-23 13:08:48,423 INFO L256 TraceCheckUtils]: 21: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {516#false} is VALID [2018-11-23 13:08:48,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:08:48,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:08:48,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:08:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:08:48,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:48,425 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:48,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:48,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:48,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:08:48,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:08:48,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:48,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:48,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:48,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:08:48,596 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:08:48,596 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|, main_~tmp~0]. (and (= |#memory_int| (store |v_#memory_int_7| |main_~#array~0.base| (store (select |v_#memory_int_7| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4) main_~tmp~0))) (< 1 (mod main_~tmp~0 4294967296))) [2018-11-23 13:08:48,596 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)) [2018-11-23 13:08:49,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-23 13:08:49,099 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:08:49,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:08:49,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:49,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:49,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:49,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:08:49,142 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:08:49,143 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_6, v_prenex_4, v_prenex_5, |#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse0 (= 1 main_~index~0)) (.cse2 (< .cse6 10000)) (.cse3 (* 4 .cse6)) (.cse4 (<= .cse6 2147483647))) (or (let ((.cse1 (select v_prenex_6 v_prenex_4))) (and .cse0 (< 1 (mod (select .cse1 (+ v_prenex_5 4)) 4294967296)) .cse2 (= |main_#t~mem4| (select .cse1 (+ .cse3 v_prenex_5))) .cse4)) (let ((.cse5 (select |#memory_int| |main_~#array~0.base|))) (and .cse0 .cse2 (= (select .cse5 (+ .cse3 |main_~#array~0.offset| (- 17179869184))) |main_#t~mem4|) (< 1 (mod (select .cse5 (+ |main_~#array~0.offset| 4)) 4294967296)) (not .cse4)))))) [2018-11-23 13:08:49,143 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 main_~index~0) (< 1 (mod |main_#t~mem4| 4294967296))) [2018-11-23 13:08:49,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:08:49,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:08:49,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:08:49,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #49#return; {515#true} is VALID [2018-11-23 13:08:49,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret5 := main(); {515#true} is VALID [2018-11-23 13:08:49,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {517#(= main_~index~0 0)} is VALID [2018-11-23 13:08:49,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {517#(= main_~index~0 0)} is VALID [2018-11-23 13:08:49,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {544#(= 1 main_~index~0)} is VALID [2018-11-23 13:08:49,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {544#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {548#(< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296))} is VALID [2018-11-23 13:08:49,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {548#(< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {548#(< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296))} is VALID [2018-11-23 13:08:49,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {548#(< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {548#(< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296))} is VALID [2018-11-23 13:08:49,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {548#(< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296))} ~index~0 := 0; {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,321 INFO L256 TraceCheckUtils]: 13: Hoare triple {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} ~cond := #in~cond; {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} assume !(0 == ~cond); {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} assume true; {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,326 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {565#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (< 1 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| 4)) 4294967296)))} {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} #53#return; {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} havoc #t~mem4; {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {558#(and (= 0 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {584#(and (= 1 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} is VALID [2018-11-23 13:08:49,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {584#(and (= 1 main_~index~0) (< 1 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {588#(and (= 1 main_~index~0) (< 1 (mod |main_#t~mem4| 4294967296)))} is VALID [2018-11-23 13:08:49,333 INFO L256 TraceCheckUtils]: 21: Hoare triple {588#(and (= 1 main_~index~0) (< 1 (mod |main_#t~mem4| 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {592#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:08:49,334 INFO L273 TraceCheckUtils]: 22: Hoare triple {592#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {596#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:08:49,335 INFO L273 TraceCheckUtils]: 23: Hoare triple {596#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:08:49,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:08:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:49,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:49,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 13 [2018-11-23 13:08:49,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-23 13:08:49,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:49,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:08:49,428 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 13:08:49,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:08:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:08:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:08:49,430 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2018-11-23 13:08:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,590 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 13:08:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:08:56,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-23 13:08:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2018-11-23 13:08:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2018-11-23 13:08:56,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2018-11-23 13:08:56,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:56,711 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:08:56,711 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:08:56,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:08:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:08:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-23 13:08:56,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:56,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 38 states. [2018-11-23 13:08:56,787 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 38 states. [2018-11-23 13:08:56,787 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 38 states. [2018-11-23 13:08:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,791 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 13:08:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 13:08:56,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:56,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:56,792 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states. [2018-11-23 13:08:56,793 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states. [2018-11-23 13:08:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,796 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 13:08:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 13:08:56,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:56,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:56,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:56,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:08:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 13:08:56,800 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 25 [2018-11-23 13:08:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:56,800 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 13:08:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:08:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 13:08:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:08:56,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:56,802 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:56,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:56,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 344641978, now seen corresponding path program 2 times [2018-11-23 13:08:56,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:56,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:57,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 13:08:57,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {842#true} is VALID [2018-11-23 13:08:57,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 13:08:57,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #49#return; {842#true} is VALID [2018-11-23 13:08:57,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret5 := main(); {842#true} is VALID [2018-11-23 13:08:57,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {844#(= main_~index~0 0)} is VALID [2018-11-23 13:08:57,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {844#(= main_~index~0 0)} is VALID [2018-11-23 13:08:57,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {845#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:08:57,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {845#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {845#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:08:57,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {845#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {846#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:08:57,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {846#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {846#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:08:57,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {846#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {847#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 3))} is VALID [2018-11-23 13:08:57,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {847#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 3))} assume !(~index~0 % 4294967296 < 10000); {843#false} is VALID [2018-11-23 13:08:57,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#false} ~index~0 := 0; {843#false} is VALID [2018-11-23 13:08:57,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {843#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {843#false} is VALID [2018-11-23 13:08:57,528 INFO L256 TraceCheckUtils]: 15: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {842#true} is VALID [2018-11-23 13:08:57,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {842#true} ~cond := #in~cond; {842#true} is VALID [2018-11-23 13:08:57,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {842#true} assume !(0 == ~cond); {842#true} is VALID [2018-11-23 13:08:57,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 13:08:57,529 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {842#true} {843#false} #53#return; {843#false} is VALID [2018-11-23 13:08:57,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {843#false} havoc #t~mem4; {843#false} is VALID [2018-11-23 13:08:57,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {843#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {843#false} is VALID [2018-11-23 13:08:57,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {843#false} is VALID [2018-11-23 13:08:57,531 INFO L256 TraceCheckUtils]: 23: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {842#true} is VALID [2018-11-23 13:08:57,531 INFO L273 TraceCheckUtils]: 24: Hoare triple {842#true} ~cond := #in~cond; {842#true} is VALID [2018-11-23 13:08:57,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {842#true} assume !(0 == ~cond); {842#true} is VALID [2018-11-23 13:08:57,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 13:08:57,532 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {842#true} {843#false} #53#return; {843#false} is VALID [2018-11-23 13:08:57,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {843#false} havoc #t~mem4; {843#false} is VALID [2018-11-23 13:08:57,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {843#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {843#false} is VALID [2018-11-23 13:08:57,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {843#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {843#false} is VALID [2018-11-23 13:08:57,533 INFO L256 TraceCheckUtils]: 31: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {843#false} is VALID [2018-11-23 13:08:57,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {843#false} ~cond := #in~cond; {843#false} is VALID [2018-11-23 13:08:57,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {843#false} assume 0 == ~cond; {843#false} is VALID [2018-11-23 13:08:57,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 13:08:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:08:57,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:57,537 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:57,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:57,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:57,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:57,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:08:57,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:08:57,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:57,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:57,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:57,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:08:57,749 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:08:57,749 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, main_~tmp~0]. (and (= (store |v_#memory_int_8| |main_~#array~0.base| (store (select |v_#memory_int_8| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8) main_~tmp~0)) |#memory_int|) (< 2 (mod main_~tmp~0 4294967296))) [2018-11-23 13:08:57,749 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)) [2018-11-23 13:08:58,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-23 13:08:58,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:08:58,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:08:58,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:58,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:58,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:58,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:08:58,254 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:08:58,255 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_9, v_prenex_7, v_prenex_8, |#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse1 (< .cse6 10000)) (.cse2 (* 4 .cse6)) (.cse4 (<= .cse6 2147483647)) (.cse3 (= 2 main_~index~0))) (or (let ((.cse0 (select v_prenex_9 v_prenex_7))) (and (< 2 (mod (select .cse0 (+ v_prenex_8 8)) 4294967296)) .cse1 (= |main_#t~mem4| (select .cse0 (+ .cse2 v_prenex_8))) .cse3 .cse4)) (let ((.cse5 (select |#memory_int| |main_~#array~0.base|))) (and .cse1 (= (select .cse5 (+ .cse2 |main_~#array~0.offset| (- 17179869184))) |main_#t~mem4|) (not .cse4) .cse3 (< 2 (mod (select .cse5 (+ |main_~#array~0.offset| 8)) 4294967296))))))) [2018-11-23 13:08:58,255 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< 2 (mod |main_#t~mem4| 4294967296)) (= 2 main_~index~0)) [2018-11-23 13:08:58,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 13:08:58,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {842#true} is VALID [2018-11-23 13:08:58,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 13:08:58,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #49#return; {842#true} is VALID [2018-11-23 13:08:58,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret5 := main(); {842#true} is VALID [2018-11-23 13:08:58,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {844#(= main_~index~0 0)} is VALID [2018-11-23 13:08:58,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {844#(= main_~index~0 0)} is VALID [2018-11-23 13:08:58,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {872#(= 1 main_~index~0)} is VALID [2018-11-23 13:08:58,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {872#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {872#(= 1 main_~index~0)} is VALID [2018-11-23 13:08:58,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {872#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {879#(= 2 main_~index~0)} is VALID [2018-11-23 13:08:58,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {879#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {883#(< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296))} is VALID [2018-11-23 13:08:58,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {883#(< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {883#(< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296))} is VALID [2018-11-23 13:08:58,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {883#(< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {883#(< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296))} is VALID [2018-11-23 13:08:58,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {883#(< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296))} ~index~0 := 0; {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,357 INFO L256 TraceCheckUtils]: 15: Hoare triple {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} ~cond := #in~cond; {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} assume !(0 == ~cond); {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} assume true; {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,377 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} #53#return; {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} havoc #t~mem4; {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {893#(and (= 0 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,381 INFO L256 TraceCheckUtils]: 23: Hoare triple {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} ~cond := #in~cond; {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} assume !(0 == ~cond); {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} assume true; {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,390 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {900#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_2| Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (< 2 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) (+ |v_main_~#array~0.offset_BEFORE_CALL_2| 8)) 4294967296)))} {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} #53#return; {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} havoc #t~mem4; {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {919#(and (= 1 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {944#(and (= 2 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} is VALID [2018-11-23 13:08:58,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {944#(and (= 2 main_~index~0) (< 2 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {948#(and (< 2 (mod |main_#t~mem4| 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:08:58,395 INFO L256 TraceCheckUtils]: 31: Hoare triple {948#(and (< 2 (mod |main_#t~mem4| 4294967296)) (= 2 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {952#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:08:58,396 INFO L273 TraceCheckUtils]: 32: Hoare triple {952#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {956#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:08:58,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {956#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {843#false} is VALID [2018-11-23 13:08:58,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 13:08:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:08:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:58,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 16 [2018-11-23 13:08:58,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-23 13:08:58,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:58,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:08:58,499 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 13:08:58,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:08:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:08:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:08:58,500 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 16 states. [2018-11-23 13:09:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,630 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 13:09:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:09:10,630 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-23 13:09:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:09:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2018-11-23 13:09:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:09:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2018-11-23 13:09:10,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2018-11-23 13:09:10,767 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 13:09:10,770 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:09:10,770 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:09:10,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:09:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:09:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2018-11-23 13:09:10,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:10,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 48 states. [2018-11-23 13:09:10,933 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 48 states. [2018-11-23 13:09:10,933 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 48 states. [2018-11-23 13:09:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,936 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 13:09:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 13:09:10,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:10,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:10,937 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 55 states. [2018-11-23 13:09:10,938 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 55 states. [2018-11-23 13:09:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,941 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 13:09:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 13:09:10,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:10,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:10,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:10,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:09:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 13:09:10,945 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 35 [2018-11-23 13:09:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:10,945 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 13:09:10,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:09:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 13:09:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:09:10,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:10,947 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:10,947 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:10,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash -579179889, now seen corresponding path program 3 times [2018-11-23 13:09:10,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:10,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:10,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:11,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {1261#true} call ULTIMATE.init(); {1261#true} is VALID [2018-11-23 13:09:11,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {1261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1261#true} is VALID [2018-11-23 13:09:11,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {1261#true} assume true; {1261#true} is VALID [2018-11-23 13:09:11,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1261#true} {1261#true} #49#return; {1261#true} is VALID [2018-11-23 13:09:11,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {1261#true} call #t~ret5 := main(); {1261#true} is VALID [2018-11-23 13:09:11,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {1261#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {1263#(= main_~index~0 0)} is VALID [2018-11-23 13:09:11,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1263#(= main_~index~0 0)} is VALID [2018-11-23 13:09:11,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1264#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:09:11,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {1264#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1264#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:09:11,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {1264#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1265#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:11,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {1265#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1265#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:11,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {1265#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1266#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:11,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {1266#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1266#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:11,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {1266#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1267#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4))} is VALID [2018-11-23 13:09:11,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {1267#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4))} assume !(~index~0 % 4294967296 < 10000); {1262#false} is VALID [2018-11-23 13:09:11,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {1262#false} ~index~0 := 0; {1262#false} is VALID [2018-11-23 13:09:11,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:11,596 INFO L256 TraceCheckUtils]: 17: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1261#true} is VALID [2018-11-23 13:09:11,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {1261#true} ~cond := #in~cond; {1261#true} is VALID [2018-11-23 13:09:11,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {1261#true} assume !(0 == ~cond); {1261#true} is VALID [2018-11-23 13:09:11,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {1261#true} assume true; {1261#true} is VALID [2018-11-23 13:09:11,597 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1261#true} {1262#false} #53#return; {1262#false} is VALID [2018-11-23 13:09:11,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {1262#false} havoc #t~mem4; {1262#false} is VALID [2018-11-23 13:09:11,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {1262#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1262#false} is VALID [2018-11-23 13:09:11,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:11,598 INFO L256 TraceCheckUtils]: 25: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1261#true} is VALID [2018-11-23 13:09:11,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {1261#true} ~cond := #in~cond; {1261#true} is VALID [2018-11-23 13:09:11,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {1261#true} assume !(0 == ~cond); {1261#true} is VALID [2018-11-23 13:09:11,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {1261#true} assume true; {1261#true} is VALID [2018-11-23 13:09:11,599 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1261#true} {1262#false} #53#return; {1262#false} is VALID [2018-11-23 13:09:11,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {1262#false} havoc #t~mem4; {1262#false} is VALID [2018-11-23 13:09:11,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {1262#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1262#false} is VALID [2018-11-23 13:09:11,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:11,600 INFO L256 TraceCheckUtils]: 33: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1261#true} is VALID [2018-11-23 13:09:11,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {1261#true} ~cond := #in~cond; {1261#true} is VALID [2018-11-23 13:09:11,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {1261#true} assume !(0 == ~cond); {1261#true} is VALID [2018-11-23 13:09:11,601 INFO L273 TraceCheckUtils]: 36: Hoare triple {1261#true} assume true; {1261#true} is VALID [2018-11-23 13:09:11,601 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1261#true} {1262#false} #53#return; {1262#false} is VALID [2018-11-23 13:09:11,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {1262#false} havoc #t~mem4; {1262#false} is VALID [2018-11-23 13:09:11,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {1262#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1262#false} is VALID [2018-11-23 13:09:11,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:11,602 INFO L256 TraceCheckUtils]: 41: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1262#false} is VALID [2018-11-23 13:09:11,602 INFO L273 TraceCheckUtils]: 42: Hoare triple {1262#false} ~cond := #in~cond; {1262#false} is VALID [2018-11-23 13:09:11,602 INFO L273 TraceCheckUtils]: 43: Hoare triple {1262#false} assume 0 == ~cond; {1262#false} is VALID [2018-11-23 13:09:11,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {1262#false} assume !false; {1262#false} is VALID [2018-11-23 13:09:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:09:11,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:11,605 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 13:09:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:09:11,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 13:09:11,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:11,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:11,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-23 13:09:11,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 13:09:11,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:09:11,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:11,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:11,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:21 [2018-11-23 13:09:11,965 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:09:11,965 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|, main_~tmp~0, v_prenex_10]. (let ((.cse5 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse5 (mod main_~tmp~0 4294967296))) (.cse2 (< .cse5 10000)) (.cse4 (= 3 main_~index~0)) (.cse3 (<= .cse5 2147483647)) (.cse1 (* 4 .cse5))) (or (and .cse0 (= (store |v_#memory_int_9| |main_~#array~0.base| (store (select |v_#memory_int_9| |main_~#array~0.base|) (+ .cse1 |main_~#array~0.offset| (- 17179869184)) main_~tmp~0)) |#memory_int|) .cse2 (not .cse3) .cse4) (and .cse0 .cse2 .cse4 .cse3 (= |#memory_int| (store v_prenex_10 |main_~#array~0.base| (store (select v_prenex_10 |main_~#array~0.base|) (+ .cse1 |main_~#array~0.offset|) main_~tmp~0))))))) [2018-11-23 13:09:11,965 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (let ((.cse0 (mod main_~index~0 4294967296))) (< .cse0 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296))) (= 3 main_~index~0)) [2018-11-23 13:09:12,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {1261#true} call ULTIMATE.init(); {1261#true} is VALID [2018-11-23 13:09:12,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {1261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1261#true} is VALID [2018-11-23 13:09:12,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {1261#true} assume true; {1261#true} is VALID [2018-11-23 13:09:12,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1261#true} {1261#true} #49#return; {1261#true} is VALID [2018-11-23 13:09:12,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {1261#true} call #t~ret5 := main(); {1261#true} is VALID [2018-11-23 13:09:12,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {1261#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {1263#(= main_~index~0 0)} is VALID [2018-11-23 13:09:12,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1263#(= main_~index~0 0)} is VALID [2018-11-23 13:09:12,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1292#(= 1 main_~index~0)} is VALID [2018-11-23 13:09:12,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {1292#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1292#(= 1 main_~index~0)} is VALID [2018-11-23 13:09:12,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {1292#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1299#(= 2 main_~index~0)} is VALID [2018-11-23 13:09:12,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {1299#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1299#(= 2 main_~index~0)} is VALID [2018-11-23 13:09:12,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {1299#(= 2 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1306#(= 3 main_~index~0)} is VALID [2018-11-23 13:09:12,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {1306#(= 3 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1310#(and (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:09:12,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(and (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)) (= 3 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1314#(and (= 4 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:12,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(and (= 4 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} assume !(~index~0 % 4294967296 < 10000); {1262#false} is VALID [2018-11-23 13:09:12,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {1262#false} ~index~0 := 0; {1262#false} is VALID [2018-11-23 13:09:12,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:12,040 INFO L256 TraceCheckUtils]: 17: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1262#false} is VALID [2018-11-23 13:09:12,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {1262#false} ~cond := #in~cond; {1262#false} is VALID [2018-11-23 13:09:12,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {1262#false} assume !(0 == ~cond); {1262#false} is VALID [2018-11-23 13:09:12,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {1262#false} assume true; {1262#false} is VALID [2018-11-23 13:09:12,041 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1262#false} {1262#false} #53#return; {1262#false} is VALID [2018-11-23 13:09:12,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {1262#false} havoc #t~mem4; {1262#false} is VALID [2018-11-23 13:09:12,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {1262#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1262#false} is VALID [2018-11-23 13:09:12,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:12,042 INFO L256 TraceCheckUtils]: 25: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1262#false} is VALID [2018-11-23 13:09:12,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {1262#false} ~cond := #in~cond; {1262#false} is VALID [2018-11-23 13:09:12,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {1262#false} assume !(0 == ~cond); {1262#false} is VALID [2018-11-23 13:09:12,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {1262#false} assume true; {1262#false} is VALID [2018-11-23 13:09:12,043 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1262#false} {1262#false} #53#return; {1262#false} is VALID [2018-11-23 13:09:12,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {1262#false} havoc #t~mem4; {1262#false} is VALID [2018-11-23 13:09:12,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {1262#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1262#false} is VALID [2018-11-23 13:09:12,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:12,045 INFO L256 TraceCheckUtils]: 33: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1262#false} is VALID [2018-11-23 13:09:12,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {1262#false} ~cond := #in~cond; {1262#false} is VALID [2018-11-23 13:09:12,045 INFO L273 TraceCheckUtils]: 35: Hoare triple {1262#false} assume !(0 == ~cond); {1262#false} is VALID [2018-11-23 13:09:12,046 INFO L273 TraceCheckUtils]: 36: Hoare triple {1262#false} assume true; {1262#false} is VALID [2018-11-23 13:09:12,046 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1262#false} {1262#false} #53#return; {1262#false} is VALID [2018-11-23 13:09:12,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {1262#false} havoc #t~mem4; {1262#false} is VALID [2018-11-23 13:09:12,046 INFO L273 TraceCheckUtils]: 39: Hoare triple {1262#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1262#false} is VALID [2018-11-23 13:09:12,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {1262#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1262#false} is VALID [2018-11-23 13:09:12,047 INFO L256 TraceCheckUtils]: 41: Hoare triple {1262#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1262#false} is VALID [2018-11-23 13:09:12,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {1262#false} ~cond := #in~cond; {1262#false} is VALID [2018-11-23 13:09:12,048 INFO L273 TraceCheckUtils]: 43: Hoare triple {1262#false} assume 0 == ~cond; {1262#false} is VALID [2018-11-23 13:09:12,048 INFO L273 TraceCheckUtils]: 44: Hoare triple {1262#false} assume !false; {1262#false} is VALID [2018-11-23 13:09:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 13:09:12,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:12,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-23 13:09:12,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 13:09:12,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:12,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:09:12,129 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 13:09:12,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:09:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:09:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:12,130 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-11-23 13:09:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:12,909 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-11-23 13:09:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:09:12,909 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 13:09:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:09:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-23 13:09:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:09:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-23 13:09:12,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2018-11-23 13:09:13,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:13,030 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:09:13,030 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:09:13,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:09:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-11-23 13:09:13,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:13,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 50 states. [2018-11-23 13:09:13,125 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 50 states. [2018-11-23 13:09:13,125 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 50 states. [2018-11-23 13:09:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,129 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 13:09:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 13:09:13,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:13,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:13,130 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 61 states. [2018-11-23 13:09:13,131 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 61 states. [2018-11-23 13:09:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,134 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 13:09:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 13:09:13,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:13,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:13,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:13,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:09:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-23 13:09:13,138 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2018-11-23 13:09:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:13,139 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-23 13:09:13,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:09:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 13:09:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:09:13,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:13,140 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:13,141 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:13,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash 9921453, now seen corresponding path program 4 times [2018-11-23 13:09:13,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:13,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:13,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2018-11-23 13:09:13,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {1733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1733#true} is VALID [2018-11-23 13:09:13,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-23 13:09:13,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #49#return; {1733#true} is VALID [2018-11-23 13:09:13,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret5 := main(); {1733#true} is VALID [2018-11-23 13:09:13,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {1733#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {1735#(= main_~index~0 0)} is VALID [2018-11-23 13:09:13,613 INFO L273 TraceCheckUtils]: 6: Hoare triple {1735#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1735#(= main_~index~0 0)} is VALID [2018-11-23 13:09:13,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {1735#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1736#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:09:13,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {1736#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1736#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:09:13,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {1736#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1737#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:13,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {1737#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1737#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:13,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {1737#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1738#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:13,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1738#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1738#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:13,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {1738#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1739#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:13,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {1739#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1739#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:13,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {1739#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1740#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 5))} is VALID [2018-11-23 13:09:13,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {1740#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 5))} assume !(~index~0 % 4294967296 < 10000); {1734#false} is VALID [2018-11-23 13:09:13,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {1734#false} ~index~0 := 0; {1734#false} is VALID [2018-11-23 13:09:13,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {1734#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1734#false} is VALID [2018-11-23 13:09:13,623 INFO L256 TraceCheckUtils]: 19: Hoare triple {1734#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2018-11-23 13:09:13,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2018-11-23 13:09:13,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2018-11-23 13:09:13,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-23 13:09:13,624 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1733#true} {1734#false} #53#return; {1734#false} is VALID [2018-11-23 13:09:13,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {1734#false} havoc #t~mem4; {1734#false} is VALID [2018-11-23 13:09:13,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {1734#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1734#false} is VALID [2018-11-23 13:09:13,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {1734#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1734#false} is VALID [2018-11-23 13:09:13,626 INFO L256 TraceCheckUtils]: 27: Hoare triple {1734#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2018-11-23 13:09:13,626 INFO L273 TraceCheckUtils]: 28: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2018-11-23 13:09:13,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2018-11-23 13:09:13,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-23 13:09:13,627 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1733#true} {1734#false} #53#return; {1734#false} is VALID [2018-11-23 13:09:13,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {1734#false} havoc #t~mem4; {1734#false} is VALID [2018-11-23 13:09:13,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {1734#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1734#false} is VALID [2018-11-23 13:09:13,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {1734#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1734#false} is VALID [2018-11-23 13:09:13,627 INFO L256 TraceCheckUtils]: 35: Hoare triple {1734#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2018-11-23 13:09:13,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2018-11-23 13:09:13,628 INFO L273 TraceCheckUtils]: 37: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2018-11-23 13:09:13,628 INFO L273 TraceCheckUtils]: 38: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-23 13:09:13,628 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1733#true} {1734#false} #53#return; {1734#false} is VALID [2018-11-23 13:09:13,629 INFO L273 TraceCheckUtils]: 40: Hoare triple {1734#false} havoc #t~mem4; {1734#false} is VALID [2018-11-23 13:09:13,629 INFO L273 TraceCheckUtils]: 41: Hoare triple {1734#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1734#false} is VALID [2018-11-23 13:09:13,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {1734#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1734#false} is VALID [2018-11-23 13:09:13,629 INFO L256 TraceCheckUtils]: 43: Hoare triple {1734#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1734#false} is VALID [2018-11-23 13:09:13,629 INFO L273 TraceCheckUtils]: 44: Hoare triple {1734#false} ~cond := #in~cond; {1734#false} is VALID [2018-11-23 13:09:13,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {1734#false} assume 0 == ~cond; {1734#false} is VALID [2018-11-23 13:09:13,630 INFO L273 TraceCheckUtils]: 46: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2018-11-23 13:09:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:09:13,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:13,633 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 13:09:13,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:09:13,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:09:13,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:13,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:13,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:09:13,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:09:13,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:09:13,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:13,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:13,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:09:13,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:09:13,875 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~tmp~0]. (and (= (store |v_#memory_int_10| |main_~#array~0.base| (store (select |v_#memory_int_10| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12) main_~tmp~0)) |#memory_int|) (< 3 (mod main_~tmp~0 4294967296))) [2018-11-23 13:09:13,875 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)) [2018-11-23 13:09:13,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-23 13:09:13,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 13:09:13,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:09:13,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:14,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:09:14,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-11-23 13:09:14,013 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:09:14,013 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_11, main_~index~0, main_~tmp~0, |v_#memory_int_11|]. (let ((.cse7 (mod main_~index~0 4294967296))) (let ((.cse2 (< .cse7 (mod main_~tmp~0 4294967296))) (.cse3 (< .cse7 10000)) (.cse1 (* 4 .cse7)) (.cse5 (+ |main_~#array~0.offset| 12)) (.cse4 (<= .cse7 2147483647))) (or (let ((.cse0 (select v_prenex_11 |main_~#array~0.base|))) (and (= (store v_prenex_11 |main_~#array~0.base| (store .cse0 (+ .cse1 |main_~#array~0.offset| (- 17179869184)) main_~tmp~0)) |#memory_int|) .cse2 .cse3 (not .cse4) (< 3 (mod (select .cse0 .cse5) 4294967296)))) (let ((.cse6 (select |v_#memory_int_11| |main_~#array~0.base|))) (and .cse2 .cse3 (= (store |v_#memory_int_11| |main_~#array~0.base| (store .cse6 (+ .cse1 |main_~#array~0.offset|) main_~tmp~0)) |#memory_int|) (< 3 (mod (select .cse6 .cse5) 4294967296)) .cse4))))) [2018-11-23 13:09:14,013 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~index~0]. (let ((.cse0 (mod main_~index~0 4294967296)) (.cse1 (select |#memory_int| |main_~#array~0.base|))) (and (< .cse0 10000) (< .cse0 (mod (select .cse1 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296)) (< 3 (mod (select .cse1 (+ |main_~#array~0.offset| 12)) 4294967296)))) [2018-11-23 13:09:15,512 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 13:09:16,439 WARN L180 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 13:09:17,866 WARN L180 SmtUtils]: Spent 959.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 13:09:19,046 WARN L180 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 13:09:19,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-23 13:09:19,457 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:09:19,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:09:19,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:09:19,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:19,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:19,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:09:19,491 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:09:19,492 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_18, v_prenex_16, v_prenex_17, |#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse6 10000)) (.cse2 (* 4 .cse6)) (.cse4 (<= .cse6 2147483647)) (.cse3 (= 3 main_~index~0))) (or (let ((.cse1 (select v_prenex_18 v_prenex_16))) (and .cse0 (< 3 (mod (select .cse1 (+ v_prenex_17 12)) 4294967296)) (= |main_#t~mem4| (select .cse1 (+ .cse2 v_prenex_17))) .cse3 .cse4)) (let ((.cse5 (select |#memory_int| |main_~#array~0.base|))) (and .cse0 (= (select .cse5 (+ .cse2 |main_~#array~0.offset| (- 17179869184))) |main_#t~mem4|) (not .cse4) .cse3 (< 3 (mod (select .cse5 (+ |main_~#array~0.offset| 12)) 4294967296))))))) [2018-11-23 13:09:19,492 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< 3 (mod |main_#t~mem4| 4294967296)) (= 3 main_~index~0)) [2018-11-23 13:09:19,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2018-11-23 13:09:19,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1733#true} is VALID [2018-11-23 13:09:19,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-23 13:09:19,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #49#return; {1733#true} is VALID [2018-11-23 13:09:19,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret5 := main(); {1733#true} is VALID [2018-11-23 13:09:19,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {1733#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {1735#(= main_~index~0 0)} is VALID [2018-11-23 13:09:19,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {1735#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1735#(= main_~index~0 0)} is VALID [2018-11-23 13:09:19,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {1735#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1765#(= 1 main_~index~0)} is VALID [2018-11-23 13:09:19,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {1765#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1765#(= 1 main_~index~0)} is VALID [2018-11-23 13:09:19,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {1765#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1772#(= 2 main_~index~0)} is VALID [2018-11-23 13:09:19,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {1772#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1772#(= 2 main_~index~0)} is VALID [2018-11-23 13:09:19,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {1772#(= 2 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1779#(= 3 main_~index~0)} is VALID [2018-11-23 13:09:19,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {1779#(= 3 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1783#(< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296))} is VALID [2018-11-23 13:09:19,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {1783#(< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1783#(< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296))} is VALID [2018-11-23 13:09:19,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#(< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1790#(and (exists ((main_~index~0 Int)) (and (< (mod main_~index~0 4294967296) 10000) (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {1790#(and (exists ((main_~index~0 Int)) (and (< (mod main_~index~0 4294967296) 10000) (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1790#(and (exists ((main_~index~0 Int)) (and (< (mod main_~index~0 4294967296) 10000) (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#(and (exists ((main_~index~0 Int)) (and (< (mod main_~index~0 4294967296) 10000) (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} assume !(~index~0 % 4294967296 < 10000); {1790#(and (exists ((main_~index~0 Int)) (and (< (mod main_~index~0 4294967296) 10000) (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {1790#(and (exists ((main_~index~0 Int)) (and (< (mod main_~index~0 4294967296) 10000) (< (mod main_~index~0 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} ~index~0 := 0; {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,576 INFO L256 TraceCheckUtils]: 19: Hoare triple {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} ~cond := #in~cond; {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} assume !(0 == ~cond); {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} assume true; {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,580 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #53#return; {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} havoc #t~mem4; {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {1800#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 0 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,584 INFO L256 TraceCheckUtils]: 27: Hoare triple {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} ~cond := #in~cond; {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} assume !(0 == ~cond); {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} assume true; {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,587 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #53#return; {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} havoc #t~mem4; {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {1826#(and (= 1 main_~index~0) (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,594 INFO L256 TraceCheckUtils]: 35: Hoare triple {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} ~cond := #in~cond; {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} assume !(0 == ~cond); {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} assume true; {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} is VALID [2018-11-23 13:09:19,596 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1807#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod v_prenex_12 4294967296)))) 4294967296)) (< 3 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| 12)) 4294967296))))} {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #53#return; {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} havoc #t~mem4; {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,599 INFO L273 TraceCheckUtils]: 41: Hoare triple {1851#(and (exists ((v_prenex_12 Int)) (and (< (mod v_prenex_12 4294967296) 10000) (< (mod v_prenex_12 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_12 4294967296)) |main_~#array~0.offset|)) 4294967296)))) (= 2 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {1876#(and (= 3 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} is VALID [2018-11-23 13:09:19,601 INFO L273 TraceCheckUtils]: 42: Hoare triple {1876#(and (= 3 main_~index~0) (< 3 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1880#(and (< 3 (mod |main_#t~mem4| 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:09:19,602 INFO L256 TraceCheckUtils]: 43: Hoare triple {1880#(and (< 3 (mod |main_#t~mem4| 4294967296)) (= 3 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {1884#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:19,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {1884#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1888#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:19,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {1888#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1734#false} is VALID [2018-11-23 13:09:19,604 INFO L273 TraceCheckUtils]: 46: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2018-11-23 13:09:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:09:19,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:19,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 21 [2018-11-23 13:09:19,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-23 13:09:19,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:19,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:09:20,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:20,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:09:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:09:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2018-11-23 13:09:20,317 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2018-11-23 13:09:33,569 WARN L180 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 13:09:35,748 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 13:09:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:44,817 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 13:09:44,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:09:44,818 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-23 13:09:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:09:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2018-11-23 13:09:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:09:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2018-11-23 13:09:44,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 83 transitions. [2018-11-23 13:09:45,974 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 13:09:45,976 INFO L225 Difference]: With dead ends: 110 [2018-11-23 13:09:45,977 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:09:45,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=118, Invalid=531, Unknown=1, NotChecked=0, Total=650 [2018-11-23 13:09:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:09:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-11-23 13:09:46,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:46,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 60 states. [2018-11-23 13:09:46,210 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 60 states. [2018-11-23 13:09:46,211 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 60 states. [2018-11-23 13:09:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:46,215 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 13:09:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 13:09:46,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:46,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:46,216 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 77 states. [2018-11-23 13:09:46,216 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 77 states. [2018-11-23 13:09:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:46,219 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 13:09:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 13:09:46,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:46,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:46,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:46,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:09:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 13:09:46,222 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 47 [2018-11-23 13:09:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:46,222 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 13:09:46,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:09:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 13:09:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:09:46,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:46,224 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:46,224 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:46,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1484610690, now seen corresponding path program 5 times [2018-11-23 13:09:46,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:46,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:46,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:46,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:46,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:47,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {2297#true} call ULTIMATE.init(); {2297#true} is VALID [2018-11-23 13:09:47,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {2297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2297#true} is VALID [2018-11-23 13:09:47,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {2297#true} assume true; {2297#true} is VALID [2018-11-23 13:09:47,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2297#true} {2297#true} #49#return; {2297#true} is VALID [2018-11-23 13:09:47,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {2297#true} call #t~ret5 := main(); {2297#true} is VALID [2018-11-23 13:09:47,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {2297#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {2299#(= main_~index~0 0)} is VALID [2018-11-23 13:09:47,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {2299#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2299#(= main_~index~0 0)} is VALID [2018-11-23 13:09:47,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {2299#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2300#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:09:47,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {2300#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2300#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:09:47,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {2300#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2301#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:47,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {2301#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2301#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:47,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {2301#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2302#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:47,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {2302#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2302#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:47,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {2302#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2303#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:47,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {2303#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2303#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:47,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {2303#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2304#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:47,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {2304#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2304#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:47,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {2304#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2305#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 6))} is VALID [2018-11-23 13:09:47,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {2305#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 6))} assume !(~index~0 % 4294967296 < 10000); {2298#false} is VALID [2018-11-23 13:09:47,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {2298#false} ~index~0 := 0; {2298#false} is VALID [2018-11-23 13:09:47,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {2298#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2298#false} is VALID [2018-11-23 13:09:47,184 INFO L256 TraceCheckUtils]: 21: Hoare triple {2298#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2297#true} is VALID [2018-11-23 13:09:47,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {2297#true} ~cond := #in~cond; {2297#true} is VALID [2018-11-23 13:09:47,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {2297#true} assume !(0 == ~cond); {2297#true} is VALID [2018-11-23 13:09:47,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {2297#true} assume true; {2297#true} is VALID [2018-11-23 13:09:47,185 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2297#true} {2298#false} #53#return; {2298#false} is VALID [2018-11-23 13:09:47,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {2298#false} havoc #t~mem4; {2298#false} is VALID [2018-11-23 13:09:47,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {2298#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2298#false} is VALID [2018-11-23 13:09:47,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {2298#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2298#false} is VALID [2018-11-23 13:09:47,186 INFO L256 TraceCheckUtils]: 29: Hoare triple {2298#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2297#true} is VALID [2018-11-23 13:09:47,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {2297#true} ~cond := #in~cond; {2297#true} is VALID [2018-11-23 13:09:47,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {2297#true} assume !(0 == ~cond); {2297#true} is VALID [2018-11-23 13:09:47,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {2297#true} assume true; {2297#true} is VALID [2018-11-23 13:09:47,187 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2297#true} {2298#false} #53#return; {2298#false} is VALID [2018-11-23 13:09:47,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {2298#false} havoc #t~mem4; {2298#false} is VALID [2018-11-23 13:09:47,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {2298#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2298#false} is VALID [2018-11-23 13:09:47,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {2298#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2298#false} is VALID [2018-11-23 13:09:47,187 INFO L256 TraceCheckUtils]: 37: Hoare triple {2298#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2297#true} is VALID [2018-11-23 13:09:47,188 INFO L273 TraceCheckUtils]: 38: Hoare triple {2297#true} ~cond := #in~cond; {2297#true} is VALID [2018-11-23 13:09:47,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {2297#true} assume !(0 == ~cond); {2297#true} is VALID [2018-11-23 13:09:47,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {2297#true} assume true; {2297#true} is VALID [2018-11-23 13:09:47,188 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2297#true} {2298#false} #53#return; {2298#false} is VALID [2018-11-23 13:09:47,188 INFO L273 TraceCheckUtils]: 42: Hoare triple {2298#false} havoc #t~mem4; {2298#false} is VALID [2018-11-23 13:09:47,189 INFO L273 TraceCheckUtils]: 43: Hoare triple {2298#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2298#false} is VALID [2018-11-23 13:09:47,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {2298#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2298#false} is VALID [2018-11-23 13:09:47,189 INFO L256 TraceCheckUtils]: 45: Hoare triple {2298#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2297#true} is VALID [2018-11-23 13:09:47,189 INFO L273 TraceCheckUtils]: 46: Hoare triple {2297#true} ~cond := #in~cond; {2297#true} is VALID [2018-11-23 13:09:47,189 INFO L273 TraceCheckUtils]: 47: Hoare triple {2297#true} assume !(0 == ~cond); {2297#true} is VALID [2018-11-23 13:09:47,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {2297#true} assume true; {2297#true} is VALID [2018-11-23 13:09:47,190 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2297#true} {2298#false} #53#return; {2298#false} is VALID [2018-11-23 13:09:47,190 INFO L273 TraceCheckUtils]: 50: Hoare triple {2298#false} havoc #t~mem4; {2298#false} is VALID [2018-11-23 13:09:47,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {2298#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2298#false} is VALID [2018-11-23 13:09:47,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {2298#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2298#false} is VALID [2018-11-23 13:09:47,191 INFO L256 TraceCheckUtils]: 53: Hoare triple {2298#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2298#false} is VALID [2018-11-23 13:09:47,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {2298#false} ~cond := #in~cond; {2298#false} is VALID [2018-11-23 13:09:47,191 INFO L273 TraceCheckUtils]: 55: Hoare triple {2298#false} assume 0 == ~cond; {2298#false} is VALID [2018-11-23 13:09:47,191 INFO L273 TraceCheckUtils]: 56: Hoare triple {2298#false} assume !false; {2298#false} is VALID [2018-11-23 13:09:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 13:09:47,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:47,195 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:47,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:10:13,618 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:10:13,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:13,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:13,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:10:13,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:10:13,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:10:13,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:10:13,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:10:13,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:10:13,847 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:10:13,848 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~tmp~0]. (and (= (store |v_#memory_int_12| |main_~#array~0.base| (store (select |v_#memory_int_12| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16) main_~tmp~0)) |#memory_int|) (< 4 (mod main_~tmp~0 4294967296))) [2018-11-23 13:10:13,848 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) [2018-11-23 13:10:13,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-23 13:10:13,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 13:10:13,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:10:13,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:10:14,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:10:14,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-11-23 13:10:14,036 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:10:14,036 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_19, main_~index~0, main_~tmp~0, |v_#memory_int_13|]. (let ((.cse7 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse7 (mod main_~tmp~0 4294967296))) (.cse1 (< .cse7 10000)) (.cse4 (+ |main_~#array~0.offset| 16)) (.cse3 (* 4 .cse7)) (.cse5 (<= .cse7 2147483647))) (or (let ((.cse2 (select v_prenex_19 |main_~#array~0.base|))) (and .cse0 .cse1 (= (store v_prenex_19 |main_~#array~0.base| (store .cse2 (+ .cse3 |main_~#array~0.offset|) main_~tmp~0)) |#memory_int|) (< 4 (mod (select .cse2 .cse4) 4294967296)) .cse5)) (let ((.cse6 (select |v_#memory_int_13| |main_~#array~0.base|))) (and .cse0 .cse1 (< 4 (mod (select .cse6 .cse4) 4294967296)) (= (store |v_#memory_int_13| |main_~#array~0.base| (store .cse6 (+ .cse3 |main_~#array~0.offset| (- 17179869184)) main_~tmp~0)) |#memory_int|) (not .cse5)))))) [2018-11-23 13:10:14,036 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~index~0]. (let ((.cse0 (mod main_~index~0 4294967296)) (.cse1 (select |#memory_int| |main_~#array~0.base|))) (and (< .cse0 10000) (< .cse0 (mod (select .cse1 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296)) (< 4 (mod (select .cse1 (+ |main_~#array~0.offset| 16)) 4294967296)))) [2018-11-23 13:10:14,938 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:10:14,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:10:14,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 13:10:14,958 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:10:14,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:10:14,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:10:14,965 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:10:14,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:10:14,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:10:14,974 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:10:14,975 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_prenex_20, v_prenex_21, |#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse1 (* 4 .cse6)) (.cse2 (< .cse6 10000)) (.cse3 (= 4 main_~index~0)) (.cse4 (<= .cse6 2147483647))) (or (let ((.cse0 (select v_prenex_22 v_prenex_20))) (and (= (select .cse0 (+ .cse1 v_prenex_21 (- 17179869184))) |main_#t~mem4|) .cse2 .cse3 (not .cse4) (< 4 (mod (select .cse0 (+ v_prenex_21 16)) 4294967296)))) (let ((.cse5 (select |#memory_int| |main_~#array~0.base|))) (and (= |main_#t~mem4| (select .cse5 (+ .cse1 |main_~#array~0.offset|))) .cse2 .cse3 (< 4 (mod (select .cse5 (+ |main_~#array~0.offset| 16)) 4294967296)) .cse4))))) [2018-11-23 13:10:14,975 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< 4 (mod |main_#t~mem4| 4294967296)) (= 4 main_~index~0)) [2018-11-23 13:10:15,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {2297#true} call ULTIMATE.init(); {2297#true} is VALID [2018-11-23 13:10:15,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {2297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2297#true} is VALID [2018-11-23 13:10:15,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {2297#true} assume true; {2297#true} is VALID [2018-11-23 13:10:15,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2297#true} {2297#true} #49#return; {2297#true} is VALID [2018-11-23 13:10:15,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {2297#true} call #t~ret5 := main(); {2297#true} is VALID [2018-11-23 13:10:15,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {2297#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {2299#(= main_~index~0 0)} is VALID [2018-11-23 13:10:15,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {2299#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2299#(= main_~index~0 0)} is VALID [2018-11-23 13:10:15,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {2299#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2330#(= 1 main_~index~0)} is VALID [2018-11-23 13:10:15,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {2330#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2330#(= 1 main_~index~0)} is VALID [2018-11-23 13:10:15,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {2330#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2337#(= 2 main_~index~0)} is VALID [2018-11-23 13:10:15,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {2337#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2337#(= 2 main_~index~0)} is VALID [2018-11-23 13:10:15,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {2337#(= 2 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2344#(= 3 main_~index~0)} is VALID [2018-11-23 13:10:15,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {2344#(= 3 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2344#(= 3 main_~index~0)} is VALID [2018-11-23 13:10:15,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {2344#(= 3 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2351#(= 4 main_~index~0)} is VALID [2018-11-23 13:10:15,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {2351#(= 4 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} is VALID [2018-11-23 13:10:15,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} is VALID [2018-11-23 13:10:15,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} is VALID [2018-11-23 13:10:15,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} is VALID [2018-11-23 13:10:15,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} is VALID [2018-11-23 13:10:15,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {2355#(< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296))} ~index~0 := 0; {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,055 INFO L256 TraceCheckUtils]: 21: Hoare triple {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} ~cond := #in~cond; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume !(0 == ~cond); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume true; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,063 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} #53#return; {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} havoc #t~mem4; {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {2371#(and (= 0 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,066 INFO L256 TraceCheckUtils]: 29: Hoare triple {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,066 INFO L273 TraceCheckUtils]: 30: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} ~cond := #in~cond; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume !(0 == ~cond); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume true; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,068 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} #53#return; {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} havoc #t~mem4; {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,069 INFO L273 TraceCheckUtils]: 35: Hoare triple {2397#(and (= 1 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,072 INFO L256 TraceCheckUtils]: 37: Hoare triple {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} ~cond := #in~cond; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,073 INFO L273 TraceCheckUtils]: 39: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume !(0 == ~cond); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume true; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,075 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} #53#return; {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} havoc #t~mem4; {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {2422#(and (= 2 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:10:15,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:10:15,079 INFO L256 TraceCheckUtils]: 45: Hoare triple {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} ~cond := #in~cond; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume !(0 == ~cond); {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,081 INFO L273 TraceCheckUtils]: 48: Hoare triple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} assume true; {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,083 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2378#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int)) (< 4 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| 16)) 4294967296)))} {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} #53#return; {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:10:15,084 INFO L273 TraceCheckUtils]: 50: Hoare triple {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} havoc #t~mem4; {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:10:15,085 INFO L273 TraceCheckUtils]: 51: Hoare triple {2447#(and (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)) (= 3 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2472#(and (= 4 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} is VALID [2018-11-23 13:10:15,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {2472#(and (= 4 main_~index~0) (< 4 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2476#(and (< 4 (mod |main_#t~mem4| 4294967296)) (= 4 main_~index~0))} is VALID [2018-11-23 13:10:15,089 INFO L256 TraceCheckUtils]: 53: Hoare triple {2476#(and (< 4 (mod |main_#t~mem4| 4294967296)) (= 4 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2480#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:15,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {2480#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2484#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:10:15,090 INFO L273 TraceCheckUtils]: 55: Hoare triple {2484#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2298#false} is VALID [2018-11-23 13:10:15,090 INFO L273 TraceCheckUtils]: 56: Hoare triple {2298#false} assume !false; {2298#false} is VALID [2018-11-23 13:10:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 13:10:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:15,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 23 [2018-11-23 13:10:15,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-11-23 13:10:15,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:15,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:10:15,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:15,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:10:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:10:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:10:15,213 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 23 states. [2018-11-23 13:10:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:36,684 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-23 13:10:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:10:36,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-11-23 13:10:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:10:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 85 transitions. [2018-11-23 13:10:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:10:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 85 transitions. [2018-11-23 13:10:36,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 85 transitions. [2018-11-23 13:10:36,828 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 13:10:36,831 INFO L225 Difference]: With dead ends: 122 [2018-11-23 13:10:36,831 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 13:10:36,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:10:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 13:10:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2018-11-23 13:10:37,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:37,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 70 states. [2018-11-23 13:10:37,053 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 70 states. [2018-11-23 13:10:37,053 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 70 states. [2018-11-23 13:10:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:37,057 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-23 13:10:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-23 13:10:37,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:37,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:37,058 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 81 states. [2018-11-23 13:10:37,058 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 81 states. [2018-11-23 13:10:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:37,061 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-23 13:10:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-23 13:10:37,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:37,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:37,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:37,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:10:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-23 13:10:37,065 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 57 [2018-11-23 13:10:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:37,065 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-23 13:10:37,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:10:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 13:10:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 13:10:37,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:37,067 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:37,067 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:37,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1930935593, now seen corresponding path program 6 times [2018-11-23 13:10:37,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:37,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:37,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {2933#true} call ULTIMATE.init(); {2933#true} is VALID [2018-11-23 13:10:37,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {2933#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2933#true} is VALID [2018-11-23 13:10:37,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:10:37,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2933#true} {2933#true} #49#return; {2933#true} is VALID [2018-11-23 13:10:37,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {2933#true} call #t~ret5 := main(); {2933#true} is VALID [2018-11-23 13:10:37,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {2933#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {2935#(= main_~index~0 0)} is VALID [2018-11-23 13:10:37,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {2935#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2935#(= main_~index~0 0)} is VALID [2018-11-23 13:10:37,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {2935#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2936#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:10:37,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {2936#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2936#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:10:37,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {2936#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2937#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:10:37,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {2937#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2937#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:10:37,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {2937#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2938#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:10:37,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {2938#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2938#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:10:37,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {2938#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2939#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:10:37,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {2939#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2939#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:10:37,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {2939#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2940#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:10:37,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {2940#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2940#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:10:37,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {2940#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2941#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:10:37,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {2941#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2941#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:10:37,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {2941#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2942#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 7))} is VALID [2018-11-23 13:10:37,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {2942#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 7))} assume !(~index~0 % 4294967296 < 10000); {2934#false} is VALID [2018-11-23 13:10:37,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {2934#false} ~index~0 := 0; {2934#false} is VALID [2018-11-23 13:10:37,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {2934#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2934#false} is VALID [2018-11-23 13:10:37,622 INFO L256 TraceCheckUtils]: 23: Hoare triple {2934#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2933#true} is VALID [2018-11-23 13:10:37,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {2933#true} ~cond := #in~cond; {2933#true} is VALID [2018-11-23 13:10:37,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {2933#true} assume !(0 == ~cond); {2933#true} is VALID [2018-11-23 13:10:37,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:10:37,623 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2933#true} {2934#false} #53#return; {2934#false} is VALID [2018-11-23 13:10:37,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {2934#false} havoc #t~mem4; {2934#false} is VALID [2018-11-23 13:10:37,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {2934#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2934#false} is VALID [2018-11-23 13:10:37,623 INFO L273 TraceCheckUtils]: 30: Hoare triple {2934#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2934#false} is VALID [2018-11-23 13:10:37,624 INFO L256 TraceCheckUtils]: 31: Hoare triple {2934#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2933#true} is VALID [2018-11-23 13:10:37,624 INFO L273 TraceCheckUtils]: 32: Hoare triple {2933#true} ~cond := #in~cond; {2933#true} is VALID [2018-11-23 13:10:37,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {2933#true} assume !(0 == ~cond); {2933#true} is VALID [2018-11-23 13:10:37,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:10:37,624 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2933#true} {2934#false} #53#return; {2934#false} is VALID [2018-11-23 13:10:37,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {2934#false} havoc #t~mem4; {2934#false} is VALID [2018-11-23 13:10:37,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {2934#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2934#false} is VALID [2018-11-23 13:10:37,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {2934#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2934#false} is VALID [2018-11-23 13:10:37,625 INFO L256 TraceCheckUtils]: 39: Hoare triple {2934#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2933#true} is VALID [2018-11-23 13:10:37,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {2933#true} ~cond := #in~cond; {2933#true} is VALID [2018-11-23 13:10:37,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {2933#true} assume !(0 == ~cond); {2933#true} is VALID [2018-11-23 13:10:37,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:10:37,626 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2933#true} {2934#false} #53#return; {2934#false} is VALID [2018-11-23 13:10:37,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {2934#false} havoc #t~mem4; {2934#false} is VALID [2018-11-23 13:10:37,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {2934#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2934#false} is VALID [2018-11-23 13:10:37,626 INFO L273 TraceCheckUtils]: 46: Hoare triple {2934#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2934#false} is VALID [2018-11-23 13:10:37,627 INFO L256 TraceCheckUtils]: 47: Hoare triple {2934#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2933#true} is VALID [2018-11-23 13:10:37,627 INFO L273 TraceCheckUtils]: 48: Hoare triple {2933#true} ~cond := #in~cond; {2933#true} is VALID [2018-11-23 13:10:37,627 INFO L273 TraceCheckUtils]: 49: Hoare triple {2933#true} assume !(0 == ~cond); {2933#true} is VALID [2018-11-23 13:10:37,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:10:37,627 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2933#true} {2934#false} #53#return; {2934#false} is VALID [2018-11-23 13:10:37,627 INFO L273 TraceCheckUtils]: 52: Hoare triple {2934#false} havoc #t~mem4; {2934#false} is VALID [2018-11-23 13:10:37,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {2934#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2934#false} is VALID [2018-11-23 13:10:37,628 INFO L273 TraceCheckUtils]: 54: Hoare triple {2934#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2934#false} is VALID [2018-11-23 13:10:37,628 INFO L256 TraceCheckUtils]: 55: Hoare triple {2934#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2933#true} is VALID [2018-11-23 13:10:37,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {2933#true} ~cond := #in~cond; {2933#true} is VALID [2018-11-23 13:10:37,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {2933#true} assume !(0 == ~cond); {2933#true} is VALID [2018-11-23 13:10:37,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:10:37,629 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {2933#true} {2934#false} #53#return; {2934#false} is VALID [2018-11-23 13:10:37,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {2934#false} havoc #t~mem4; {2934#false} is VALID [2018-11-23 13:10:37,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {2934#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {2934#false} is VALID [2018-11-23 13:10:37,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {2934#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2934#false} is VALID [2018-11-23 13:10:37,630 INFO L256 TraceCheckUtils]: 63: Hoare triple {2934#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {2934#false} is VALID [2018-11-23 13:10:37,630 INFO L273 TraceCheckUtils]: 64: Hoare triple {2934#false} ~cond := #in~cond; {2934#false} is VALID [2018-11-23 13:10:37,630 INFO L273 TraceCheckUtils]: 65: Hoare triple {2934#false} assume 0 == ~cond; {2934#false} is VALID [2018-11-23 13:10:37,630 INFO L273 TraceCheckUtils]: 66: Hoare triple {2934#false} assume !false; {2934#false} is VALID [2018-11-23 13:10:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 10 proven. 49 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 13:10:37,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:37,635 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:37,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:11:02,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 13:11:02,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:02,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:11:02,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:11:02,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:02,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:02,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:02,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:11:02,272 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:02,272 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, main_~tmp~0]. (and (= (store |v_#memory_int_14| |main_~#array~0.base| (store (select |v_#memory_int_14| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20) main_~tmp~0)) |#memory_int|) (< 5 (mod main_~tmp~0 4294967296))) [2018-11-23 13:11:02,272 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) [2018-11-23 13:11:02,323 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:11:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:02,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 13:11:02,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 13:11:02,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 13:11:02,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:02,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:11:02,397 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-11-23 13:11:02,403 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:02,403 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_23, main_~index~0, main_~tmp~0, |v_#memory_int_15|]. (let ((.cse7 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse7 (mod main_~tmp~0 4294967296))) (.cse1 (< .cse7 10000)) (.cse5 (* 4 .cse7)) (.cse4 (<= .cse7 2147483647)) (.cse3 (+ |main_~#array~0.offset| 20))) (or (let ((.cse2 (select v_prenex_23 |main_~#array~0.base|))) (and .cse0 .cse1 (< 5 (mod (select .cse2 .cse3) 4294967296)) .cse4 (= (store v_prenex_23 |main_~#array~0.base| (store .cse2 (+ .cse5 |main_~#array~0.offset|) main_~tmp~0)) |#memory_int|))) (let ((.cse6 (select |v_#memory_int_15| |main_~#array~0.base|))) (and .cse0 .cse1 (= (store |v_#memory_int_15| |main_~#array~0.base| (store .cse6 (+ .cse5 |main_~#array~0.offset| (- 17179869184)) main_~tmp~0)) |#memory_int|) (not .cse4) (< 5 (mod (select .cse6 .cse3) 4294967296))))))) [2018-11-23 13:11:02,404 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~index~0]. (let ((.cse1 (select |#memory_int| |main_~#array~0.base|)) (.cse0 (mod main_~index~0 4294967296))) (and (< .cse0 10000) (< 5 (mod (select .cse1 (+ |main_~#array~0.offset| 20)) 4294967296)) (< .cse0 (mod (select .cse1 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296)))) [2018-11-23 13:11:03,110 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:11:03,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:03,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 13:11:03,130 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:11:03,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:11:03,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:03,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:03,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:03,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:11:03,183 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:03,184 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|, v_prenex_26, v_prenex_24, v_prenex_25]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse6 10000)) (.cse3 (= 5 main_~index~0)) (.cse2 (* 4 .cse6)) (.cse4 (<= .cse6 2147483647))) (or (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (and .cse0 (= (select .cse1 (+ .cse2 |main_~#array~0.offset| (- 17179869184))) |main_#t~mem4|) (< 5 (mod (select .cse1 (+ |main_~#array~0.offset| 20)) 4294967296)) .cse3 (not .cse4))) (let ((.cse5 (select v_prenex_26 v_prenex_24))) (and .cse0 (< 5 (mod (select .cse5 (+ v_prenex_25 20)) 4294967296)) .cse3 (= |main_#t~mem4| (select .cse5 (+ .cse2 v_prenex_25))) .cse4))))) [2018-11-23 13:11:03,184 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< 5 (mod |main_#t~mem4| 4294967296)) (= 5 main_~index~0)) [2018-11-23 13:11:03,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {2933#true} call ULTIMATE.init(); {2933#true} is VALID [2018-11-23 13:11:03,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {2933#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2933#true} is VALID [2018-11-23 13:11:03,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 13:11:03,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2933#true} {2933#true} #49#return; {2933#true} is VALID [2018-11-23 13:11:03,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {2933#true} call #t~ret5 := main(); {2933#true} is VALID [2018-11-23 13:11:03,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {2933#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {2935#(= main_~index~0 0)} is VALID [2018-11-23 13:11:03,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {2935#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2935#(= main_~index~0 0)} is VALID [2018-11-23 13:11:03,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {2935#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2967#(= 1 main_~index~0)} is VALID [2018-11-23 13:11:03,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {2967#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2967#(= 1 main_~index~0)} is VALID [2018-11-23 13:11:03,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {2967#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2974#(= 2 main_~index~0)} is VALID [2018-11-23 13:11:03,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {2974#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2974#(= 2 main_~index~0)} is VALID [2018-11-23 13:11:03,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {2974#(= 2 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2981#(= 3 main_~index~0)} is VALID [2018-11-23 13:11:03,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {2981#(= 3 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2981#(= 3 main_~index~0)} is VALID [2018-11-23 13:11:03,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {2981#(= 3 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2988#(= 4 main_~index~0)} is VALID [2018-11-23 13:11:03,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {2988#(= 4 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2988#(= 4 main_~index~0)} is VALID [2018-11-23 13:11:03,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {2988#(= 4 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2995#(= 5 main_~index~0)} is VALID [2018-11-23 13:11:03,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {2995#(= 5 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} is VALID [2018-11-23 13:11:03,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} is VALID [2018-11-23 13:11:03,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} is VALID [2018-11-23 13:11:03,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} is VALID [2018-11-23 13:11:03,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} is VALID [2018-11-23 13:11:03,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {2999#(< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296))} ~index~0 := 0; {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:11:03,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:11:03,327 INFO L256 TraceCheckUtils]: 23: Hoare triple {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} ~cond := #in~cond; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume !(0 == ~cond); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,330 INFO L273 TraceCheckUtils]: 26: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume true; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,331 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} #53#return; {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:11:03,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} havoc #t~mem4; {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:11:03,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {3015#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 0 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,337 INFO L256 TraceCheckUtils]: 31: Hoare triple {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} ~cond := #in~cond; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume !(0 == ~cond); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume true; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,339 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} #53#return; {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} havoc #t~mem4; {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {3041#(and (= 1 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:11:03,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:11:03,343 INFO L256 TraceCheckUtils]: 39: Hoare triple {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} ~cond := #in~cond; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,345 INFO L273 TraceCheckUtils]: 41: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume !(0 == ~cond); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,345 INFO L273 TraceCheckUtils]: 42: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume true; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,347 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} #53#return; {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:11:03,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} havoc #t~mem4; {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:11:03,349 INFO L273 TraceCheckUtils]: 45: Hoare triple {3066#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 2 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:11:03,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:11:03,353 INFO L256 TraceCheckUtils]: 47: Hoare triple {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,353 INFO L273 TraceCheckUtils]: 48: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} ~cond := #in~cond; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume !(0 == ~cond); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume true; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,356 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} #53#return; {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:11:03,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} havoc #t~mem4; {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:11:03,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {3091#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 3 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,358 INFO L273 TraceCheckUtils]: 54: Hoare triple {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,360 INFO L256 TraceCheckUtils]: 55: Hoare triple {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,361 INFO L273 TraceCheckUtils]: 56: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} ~cond := #in~cond; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,362 INFO L273 TraceCheckUtils]: 57: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume !(0 == ~cond); {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,363 INFO L273 TraceCheckUtils]: 58: Hoare triple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} assume true; {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,364 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3022#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (< 5 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ |v_main_~#array~0.offset_BEFORE_CALL_11| 20)) 4294967296)))} {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} #53#return; {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,365 INFO L273 TraceCheckUtils]: 60: Hoare triple {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} havoc #t~mem4; {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} is VALID [2018-11-23 13:11:03,366 INFO L273 TraceCheckUtils]: 61: Hoare triple {3116#(and (= 4 main_~index~0) (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3141#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 5 main_~index~0))} is VALID [2018-11-23 13:11:03,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {3141#(and (< 5 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 4294967296)) (= 5 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3145#(and (< 5 (mod |main_#t~mem4| 4294967296)) (= 5 main_~index~0))} is VALID [2018-11-23 13:11:03,371 INFO L256 TraceCheckUtils]: 63: Hoare triple {3145#(and (< 5 (mod |main_#t~mem4| 4294967296)) (= 5 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3149#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:11:03,371 INFO L273 TraceCheckUtils]: 64: Hoare triple {3149#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3153#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:11:03,372 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2934#false} is VALID [2018-11-23 13:11:03,372 INFO L273 TraceCheckUtils]: 66: Hoare triple {2934#false} assume !false; {2934#false} is VALID [2018-11-23 13:11:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 13:11:03,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:03,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 26 [2018-11-23 13:11:03,419 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2018-11-23 13:11:03,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:03,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:11:03,528 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 13:11:03,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:11:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:11:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:11:03,529 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2018-11-23 13:11:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:27,591 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-11-23 13:11:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:11:27,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2018-11-23 13:11:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2018-11-23 13:11:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 92 transitions. [2018-11-23 13:11:27,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 92 transitions. [2018-11-23 13:11:27,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:27,756 INFO L225 Difference]: With dead ends: 140 [2018-11-23 13:11:27,756 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 13:11:27,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:11:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 13:11:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-11-23 13:11:28,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:28,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 80 states. [2018-11-23 13:11:28,021 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 80 states. [2018-11-23 13:11:28,021 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 80 states. [2018-11-23 13:11:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:28,026 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 13:11:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 13:11:28,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:28,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:28,027 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 91 states. [2018-11-23 13:11:28,027 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 91 states. [2018-11-23 13:11:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:28,030 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 13:11:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 13:11:28,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:28,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:28,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:28,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:11:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-23 13:11:28,033 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 67 [2018-11-23 13:11:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:28,033 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-23 13:11:28,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:11:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-23 13:11:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 13:11:28,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:28,035 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:28,035 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:28,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1478325932, now seen corresponding path program 7 times [2018-11-23 13:11:28,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:28,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {3661#true} call ULTIMATE.init(); {3661#true} is VALID [2018-11-23 13:11:28,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {3661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3661#true} is VALID [2018-11-23 13:11:28,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3661#true} {3661#true} #49#return; {3661#true} is VALID [2018-11-23 13:11:28,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {3661#true} call #t~ret5 := main(); {3661#true} is VALID [2018-11-23 13:11:28,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {3661#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {3663#(= main_~index~0 0)} is VALID [2018-11-23 13:11:28,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {3663#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3663#(= main_~index~0 0)} is VALID [2018-11-23 13:11:28,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {3663#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3664#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:11:28,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {3664#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3664#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:11:28,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {3664#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3665#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:11:28,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {3665#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3665#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:11:28,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {3665#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3666#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:11:28,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {3666#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3666#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:11:28,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {3666#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3667#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:11:28,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {3667#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3667#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:11:28,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {3667#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3668#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:11:28,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {3668#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3668#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:11:28,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {3668#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3669#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:11:28,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {3669#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3669#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:11:28,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {3669#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3670#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:11:28,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {3670#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3670#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:11:28,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {3670#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3671#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 8))} is VALID [2018-11-23 13:11:28,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {3671#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 8))} assume !(~index~0 % 4294967296 < 10000); {3662#false} is VALID [2018-11-23 13:11:28,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {3662#false} ~index~0 := 0; {3662#false} is VALID [2018-11-23 13:11:28,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,891 INFO L256 TraceCheckUtils]: 25: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3661#true} is VALID [2018-11-23 13:11:28,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#true} ~cond := #in~cond; {3661#true} is VALID [2018-11-23 13:11:28,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {3661#true} assume !(0 == ~cond); {3661#true} is VALID [2018-11-23 13:11:28,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,892 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3661#true} {3662#false} #53#return; {3662#false} is VALID [2018-11-23 13:11:28,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {3662#false} havoc #t~mem4; {3662#false} is VALID [2018-11-23 13:11:28,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {3662#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3662#false} is VALID [2018-11-23 13:11:28,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,893 INFO L256 TraceCheckUtils]: 33: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3661#true} is VALID [2018-11-23 13:11:28,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {3661#true} ~cond := #in~cond; {3661#true} is VALID [2018-11-23 13:11:28,893 INFO L273 TraceCheckUtils]: 35: Hoare triple {3661#true} assume !(0 == ~cond); {3661#true} is VALID [2018-11-23 13:11:28,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,894 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3661#true} {3662#false} #53#return; {3662#false} is VALID [2018-11-23 13:11:28,894 INFO L273 TraceCheckUtils]: 38: Hoare triple {3662#false} havoc #t~mem4; {3662#false} is VALID [2018-11-23 13:11:28,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {3662#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3662#false} is VALID [2018-11-23 13:11:28,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,894 INFO L256 TraceCheckUtils]: 41: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3661#true} is VALID [2018-11-23 13:11:28,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {3661#true} ~cond := #in~cond; {3661#true} is VALID [2018-11-23 13:11:28,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {3661#true} assume !(0 == ~cond); {3661#true} is VALID [2018-11-23 13:11:28,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,895 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3661#true} {3662#false} #53#return; {3662#false} is VALID [2018-11-23 13:11:28,895 INFO L273 TraceCheckUtils]: 46: Hoare triple {3662#false} havoc #t~mem4; {3662#false} is VALID [2018-11-23 13:11:28,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {3662#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3662#false} is VALID [2018-11-23 13:11:28,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,896 INFO L256 TraceCheckUtils]: 49: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3661#true} is VALID [2018-11-23 13:11:28,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {3661#true} ~cond := #in~cond; {3661#true} is VALID [2018-11-23 13:11:28,896 INFO L273 TraceCheckUtils]: 51: Hoare triple {3661#true} assume !(0 == ~cond); {3661#true} is VALID [2018-11-23 13:11:28,896 INFO L273 TraceCheckUtils]: 52: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,896 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {3661#true} {3662#false} #53#return; {3662#false} is VALID [2018-11-23 13:11:28,897 INFO L273 TraceCheckUtils]: 54: Hoare triple {3662#false} havoc #t~mem4; {3662#false} is VALID [2018-11-23 13:11:28,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {3662#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3662#false} is VALID [2018-11-23 13:11:28,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,897 INFO L256 TraceCheckUtils]: 57: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3661#true} is VALID [2018-11-23 13:11:28,897 INFO L273 TraceCheckUtils]: 58: Hoare triple {3661#true} ~cond := #in~cond; {3661#true} is VALID [2018-11-23 13:11:28,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {3661#true} assume !(0 == ~cond); {3661#true} is VALID [2018-11-23 13:11:28,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,898 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3661#true} {3662#false} #53#return; {3662#false} is VALID [2018-11-23 13:11:28,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {3662#false} havoc #t~mem4; {3662#false} is VALID [2018-11-23 13:11:28,898 INFO L273 TraceCheckUtils]: 63: Hoare triple {3662#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3662#false} is VALID [2018-11-23 13:11:28,898 INFO L273 TraceCheckUtils]: 64: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,899 INFO L256 TraceCheckUtils]: 65: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3661#true} is VALID [2018-11-23 13:11:28,899 INFO L273 TraceCheckUtils]: 66: Hoare triple {3661#true} ~cond := #in~cond; {3661#true} is VALID [2018-11-23 13:11:28,899 INFO L273 TraceCheckUtils]: 67: Hoare triple {3661#true} assume !(0 == ~cond); {3661#true} is VALID [2018-11-23 13:11:28,899 INFO L273 TraceCheckUtils]: 68: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:28,899 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {3661#true} {3662#false} #53#return; {3662#false} is VALID [2018-11-23 13:11:28,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {3662#false} havoc #t~mem4; {3662#false} is VALID [2018-11-23 13:11:28,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {3662#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3662#false} is VALID [2018-11-23 13:11:28,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {3662#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3662#false} is VALID [2018-11-23 13:11:28,900 INFO L256 TraceCheckUtils]: 73: Hoare triple {3662#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3662#false} is VALID [2018-11-23 13:11:28,900 INFO L273 TraceCheckUtils]: 74: Hoare triple {3662#false} ~cond := #in~cond; {3662#false} is VALID [2018-11-23 13:11:28,900 INFO L273 TraceCheckUtils]: 75: Hoare triple {3662#false} assume 0 == ~cond; {3662#false} is VALID [2018-11-23 13:11:28,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {3662#false} assume !false; {3662#false} is VALID [2018-11-23 13:11:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-23 13:11:28,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:28,907 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:28,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:29,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:11:29,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:11:29,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:29,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:29,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:29,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:11:29,136 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:29,136 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~tmp~0]. (and (= |#memory_int| (store |v_#memory_int_16| |main_~#array~0.base| (store (select |v_#memory_int_16| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24) main_~tmp~0))) (< 6 (mod main_~tmp~0 4294967296))) [2018-11-23 13:11:29,137 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)) [2018-11-23 13:11:29,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-23 13:11:29,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 13:11:29,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:11:29,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:29,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:11:29,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-11-23 13:11:29,309 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:29,309 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_27, main_~index~0, main_~tmp~0, |v_#memory_int_17|]. (let ((.cse7 (mod main_~index~0 4294967296))) (let ((.cse4 (+ |main_~#array~0.offset| 24)) (.cse0 (< .cse7 (mod main_~tmp~0 4294967296))) (.cse1 (< .cse7 10000)) (.cse5 (<= .cse7 2147483647)) (.cse3 (* 4 .cse7))) (or (let ((.cse2 (select v_prenex_27 |main_~#array~0.base|))) (and .cse0 .cse1 (= (store v_prenex_27 |main_~#array~0.base| (store .cse2 (+ .cse3 |main_~#array~0.offset| (- 17179869184)) main_~tmp~0)) |#memory_int|) (< 6 (mod (select .cse2 .cse4) 4294967296)) (not .cse5))) (let ((.cse6 (select |v_#memory_int_17| |main_~#array~0.base|))) (and (< 6 (mod (select .cse6 .cse4) 4294967296)) .cse0 .cse1 .cse5 (= (store |v_#memory_int_17| |main_~#array~0.base| (store .cse6 (+ .cse3 |main_~#array~0.offset|) main_~tmp~0)) |#memory_int|)))))) [2018-11-23 13:11:29,310 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~index~0]. (let ((.cse0 (mod main_~index~0 4294967296)) (.cse1 (select |#memory_int| |main_~#array~0.base|))) (and (< .cse0 10000) (< .cse0 (mod (select .cse1 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296)) (< 6 (mod (select .cse1 (+ |main_~#array~0.offset| 24)) 4294967296)))) [2018-11-23 13:11:30,269 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:11:30,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:30,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 13:11:30,289 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:11:30,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:11:30,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:30,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:30,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:30,302 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:11:30,308 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:30,308 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_30, v_prenex_28, v_prenex_29, |#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse2 (* 4 .cse6)) (.cse0 (< .cse6 10000)) (.cse3 (<= .cse6 2147483647)) (.cse4 (= 6 main_~index~0))) (or (let ((.cse1 (select v_prenex_30 v_prenex_28))) (and .cse0 (= (select .cse1 (+ .cse2 v_prenex_29 (- 17179869184))) |main_#t~mem4|) (< 6 (mod (select .cse1 (+ v_prenex_29 24)) 4294967296)) (not .cse3) .cse4)) (let ((.cse5 (select |#memory_int| |main_~#array~0.base|))) (and (= |main_#t~mem4| (select .cse5 (+ .cse2 |main_~#array~0.offset|))) .cse0 (< 6 (mod (select .cse5 (+ |main_~#array~0.offset| 24)) 4294967296)) .cse3 .cse4))))) [2018-11-23 13:11:30,308 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< 6 (mod |main_#t~mem4| 4294967296)) (= 6 main_~index~0)) [2018-11-23 13:11:30,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {3661#true} call ULTIMATE.init(); {3661#true} is VALID [2018-11-23 13:11:30,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {3661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3661#true} is VALID [2018-11-23 13:11:30,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {3661#true} assume true; {3661#true} is VALID [2018-11-23 13:11:30,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3661#true} {3661#true} #49#return; {3661#true} is VALID [2018-11-23 13:11:30,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {3661#true} call #t~ret5 := main(); {3661#true} is VALID [2018-11-23 13:11:30,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {3661#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {3663#(= main_~index~0 0)} is VALID [2018-11-23 13:11:30,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {3663#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3663#(= main_~index~0 0)} is VALID [2018-11-23 13:11:30,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {3663#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3696#(= 1 main_~index~0)} is VALID [2018-11-23 13:11:30,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {3696#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3696#(= 1 main_~index~0)} is VALID [2018-11-23 13:11:30,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {3696#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3703#(= 2 main_~index~0)} is VALID [2018-11-23 13:11:30,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {3703#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3703#(= 2 main_~index~0)} is VALID [2018-11-23 13:11:30,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {3703#(= 2 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3710#(= 3 main_~index~0)} is VALID [2018-11-23 13:11:30,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {3710#(= 3 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3710#(= 3 main_~index~0)} is VALID [2018-11-23 13:11:30,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {3710#(= 3 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3717#(= 4 main_~index~0)} is VALID [2018-11-23 13:11:30,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {3717#(= 4 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3717#(= 4 main_~index~0)} is VALID [2018-11-23 13:11:30,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {3717#(= 4 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3724#(= 5 main_~index~0)} is VALID [2018-11-23 13:11:30,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {3724#(= 5 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3724#(= 5 main_~index~0)} is VALID [2018-11-23 13:11:30,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {3724#(= 5 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3731#(= 6 main_~index~0)} is VALID [2018-11-23 13:11:30,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {3731#(= 6 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} is VALID [2018-11-23 13:11:30,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} is VALID [2018-11-23 13:11:30,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} is VALID [2018-11-23 13:11:30,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} is VALID [2018-11-23 13:11:30,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} is VALID [2018-11-23 13:11:30,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {3735#(< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296))} ~index~0 := 0; {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,404 INFO L256 TraceCheckUtils]: 25: Hoare triple {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} ~cond := #in~cond; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume !(0 == ~cond); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume true; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,406 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #53#return; {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} havoc #t~mem4; {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {3751#(and (= 0 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,411 INFO L256 TraceCheckUtils]: 33: Hoare triple {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} ~cond := #in~cond; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,412 INFO L273 TraceCheckUtils]: 35: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume !(0 == ~cond); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume true; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,414 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #53#return; {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} havoc #t~mem4; {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {3777#(and (= 1 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,418 INFO L256 TraceCheckUtils]: 41: Hoare triple {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} ~cond := #in~cond; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume !(0 == ~cond); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume true; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,421 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #53#return; {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} havoc #t~mem4; {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {3802#(and (= 2 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,424 INFO L273 TraceCheckUtils]: 48: Hoare triple {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,426 INFO L256 TraceCheckUtils]: 49: Hoare triple {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} ~cond := #in~cond; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume !(0 == ~cond); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume true; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,429 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #53#return; {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,430 INFO L273 TraceCheckUtils]: 54: Hoare triple {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} havoc #t~mem4; {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,431 INFO L273 TraceCheckUtils]: 55: Hoare triple {3827#(and (= 3 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,432 INFO L273 TraceCheckUtils]: 56: Hoare triple {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,434 INFO L256 TraceCheckUtils]: 57: Hoare triple {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,434 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} ~cond := #in~cond; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,435 INFO L273 TraceCheckUtils]: 59: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume !(0 == ~cond); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,435 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume true; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,437 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #53#return; {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,437 INFO L273 TraceCheckUtils]: 62: Hoare triple {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} havoc #t~mem4; {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,438 INFO L273 TraceCheckUtils]: 63: Hoare triple {3852#(and (= 4 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,439 INFO L273 TraceCheckUtils]: 64: Hoare triple {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,441 INFO L256 TraceCheckUtils]: 65: Hoare triple {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,442 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} ~cond := #in~cond; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,442 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume !(0 == ~cond); {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,443 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} assume true; {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,444 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {3758#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_16| Int) (|v_main_~#array~0.base_BEFORE_CALL_16| Int)) (< 6 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_16|) (+ |v_main_~#array~0.offset_BEFORE_CALL_16| 24)) 4294967296)))} {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #53#return; {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,445 INFO L273 TraceCheckUtils]: 70: Hoare triple {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} havoc #t~mem4; {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} is VALID [2018-11-23 13:11:30,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {3877#(and (= 5 main_~index~0) (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {3902#(and (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)) (= 6 main_~index~0))} is VALID [2018-11-23 13:11:30,448 INFO L273 TraceCheckUtils]: 72: Hoare triple {3902#(and (< 6 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24)) 4294967296)) (= 6 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {3906#(and (< 6 (mod |main_#t~mem4| 4294967296)) (= 6 main_~index~0))} is VALID [2018-11-23 13:11:30,449 INFO L256 TraceCheckUtils]: 73: Hoare triple {3906#(and (< 6 (mod |main_#t~mem4| 4294967296)) (= 6 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {3910#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:11:30,450 INFO L273 TraceCheckUtils]: 74: Hoare triple {3910#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3914#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:11:30,451 INFO L273 TraceCheckUtils]: 75: Hoare triple {3914#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3662#false} is VALID [2018-11-23 13:11:30,451 INFO L273 TraceCheckUtils]: 76: Hoare triple {3662#false} assume !false; {3662#false} is VALID [2018-11-23 13:11:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-23 13:11:30,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 29 [2018-11-23 13:11:30,487 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2018-11-23 13:11:30,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:30,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:11:30,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:30,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:11:30,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:11:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:11:30,609 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 29 states. [2018-11-23 13:11:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:59,812 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2018-11-23 13:11:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:11:59,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2018-11-23 13:11:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:11:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 99 transitions. [2018-11-23 13:11:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:11:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 99 transitions. [2018-11-23 13:11:59,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 99 transitions. [2018-11-23 13:12:00,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:00,035 INFO L225 Difference]: With dead ends: 158 [2018-11-23 13:12:00,036 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 13:12:00,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:12:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 13:12:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2018-11-23 13:12:00,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:00,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 90 states. [2018-11-23 13:12:00,399 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 90 states. [2018-11-23 13:12:00,399 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 90 states. [2018-11-23 13:12:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:00,402 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-11-23 13:12:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-23 13:12:00,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:00,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:00,403 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 101 states. [2018-11-23 13:12:00,403 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 101 states. [2018-11-23 13:12:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:00,406 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-11-23 13:12:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-23 13:12:00,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:00,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:00,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:00,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:12:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-11-23 13:12:00,410 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 77 [2018-11-23 13:12:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:00,410 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-11-23 13:12:00,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:12:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-23 13:12:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 13:12:00,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:00,411 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:00,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:00,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1863690239, now seen corresponding path program 8 times [2018-11-23 13:12:00,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:01,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {4481#true} call ULTIMATE.init(); {4481#true} is VALID [2018-11-23 13:12:01,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {4481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4481#true} is VALID [2018-11-23 13:12:01,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4481#true} {4481#true} #49#return; {4481#true} is VALID [2018-11-23 13:12:01,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {4481#true} call #t~ret5 := main(); {4481#true} is VALID [2018-11-23 13:12:01,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {4481#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {4483#(= main_~index~0 0)} is VALID [2018-11-23 13:12:01,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {4483#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4483#(= main_~index~0 0)} is VALID [2018-11-23 13:12:01,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {4483#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4484#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:12:01,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {4484#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4484#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} is VALID [2018-11-23 13:12:01,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {4484#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967294) 4294967296)) 1) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4485#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:12:01,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {4485#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4485#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:12:01,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {4485#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4486#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:12:01,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4486#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:12:01,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {4486#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4487#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:12:01,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {4487#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4487#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:12:01,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4488#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:12:01,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4488#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:12:01,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {4488#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4489#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:12:01,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {4489#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4489#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:12:01,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {4489#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4490#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:12:01,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {4490#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4490#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:12:01,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {4490#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4491#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:12:01,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {4491#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4491#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:12:01,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {4491#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4492#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 9))} is VALID [2018-11-23 13:12:01,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {4492#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 9))} assume !(~index~0 % 4294967296 < 10000); {4482#false} is VALID [2018-11-23 13:12:01,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {4482#false} ~index~0 := 0; {4482#false} is VALID [2018-11-23 13:12:01,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,198 INFO L256 TraceCheckUtils]: 27: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,199 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,200 INFO L256 TraceCheckUtils]: 35: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,200 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,201 INFO L256 TraceCheckUtils]: 43: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,201 INFO L273 TraceCheckUtils]: 44: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,201 INFO L273 TraceCheckUtils]: 46: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,201 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,202 INFO L256 TraceCheckUtils]: 51: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 52: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 53: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 54: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,202 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,202 INFO L273 TraceCheckUtils]: 58: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,203 INFO L256 TraceCheckUtils]: 59: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,203 INFO L273 TraceCheckUtils]: 60: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,203 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,203 INFO L273 TraceCheckUtils]: 64: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,203 INFO L273 TraceCheckUtils]: 65: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,203 INFO L273 TraceCheckUtils]: 66: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,203 INFO L256 TraceCheckUtils]: 67: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,204 INFO L273 TraceCheckUtils]: 68: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,204 INFO L273 TraceCheckUtils]: 69: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,204 INFO L273 TraceCheckUtils]: 70: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,204 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,204 INFO L273 TraceCheckUtils]: 72: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,204 INFO L273 TraceCheckUtils]: 73: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,204 INFO L273 TraceCheckUtils]: 74: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,204 INFO L256 TraceCheckUtils]: 75: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4481#true} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 76: Hoare triple {4481#true} ~cond := #in~cond; {4481#true} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 77: Hoare triple {4481#true} assume !(0 == ~cond); {4481#true} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 78: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:01,205 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {4481#true} {4482#false} #53#return; {4482#false} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 80: Hoare triple {4482#false} havoc #t~mem4; {4482#false} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 81: Hoare triple {4482#false} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4482#false} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 82: Hoare triple {4482#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4482#false} is VALID [2018-11-23 13:12:01,205 INFO L256 TraceCheckUtils]: 83: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4482#false} is VALID [2018-11-23 13:12:01,205 INFO L273 TraceCheckUtils]: 84: Hoare triple {4482#false} ~cond := #in~cond; {4482#false} is VALID [2018-11-23 13:12:01,206 INFO L273 TraceCheckUtils]: 85: Hoare triple {4482#false} assume 0 == ~cond; {4482#false} is VALID [2018-11-23 13:12:01,206 INFO L273 TraceCheckUtils]: 86: Hoare triple {4482#false} assume !false; {4482#false} is VALID [2018-11-23 13:12:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 13:12:01,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:01,214 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:01,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:01,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:01,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:01,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:01,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:12:01,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:12:01,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:01,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:01,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:01,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 13:12:01,534 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:12:01,534 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, main_~tmp~0]. (and (< 7 (mod main_~tmp~0 4294967296)) (= (store |v_#memory_int_18| |main_~#array~0.base| (store (select |v_#memory_int_18| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28) main_~tmp~0)) |#memory_int|)) [2018-11-23 13:12:01,534 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) [2018-11-23 13:12:01,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-23 13:12:01,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 13:12:01,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:12:01,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:01,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:12:01,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:34 [2018-11-23 13:12:01,681 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:12:01,682 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_31, main_~index~0, main_~tmp~0, |v_#memory_int_19|]. (let ((.cse7 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse7 (mod main_~tmp~0 4294967296))) (.cse1 (< .cse7 10000)) (.cse3 (* 4 .cse7)) (.cse4 (+ |main_~#array~0.offset| 28)) (.cse5 (<= .cse7 2147483647))) (or (let ((.cse2 (select v_prenex_31 |main_~#array~0.base|))) (and .cse0 .cse1 (= (store v_prenex_31 |main_~#array~0.base| (store .cse2 (+ .cse3 |main_~#array~0.offset| (- 17179869184)) main_~tmp~0)) |#memory_int|) (< 7 (mod (select .cse2 .cse4) 4294967296)) (not .cse5))) (let ((.cse6 (select |v_#memory_int_19| |main_~#array~0.base|))) (and .cse0 .cse1 (= |#memory_int| (store |v_#memory_int_19| |main_~#array~0.base| (store .cse6 (+ .cse3 |main_~#array~0.offset|) main_~tmp~0))) (< 7 (mod (select .cse6 .cse4) 4294967296)) .cse5))))) [2018-11-23 13:12:01,682 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~index~0]. (let ((.cse1 (select |#memory_int| |main_~#array~0.base|)) (.cse0 (mod main_~index~0 4294967296))) (and (< .cse0 10000) (< 7 (mod (select .cse1 (+ |main_~#array~0.offset| 28)) 4294967296)) (< .cse0 (mod (select .cse1 (+ (* 4 .cse0) |main_~#array~0.offset|)) 4294967296)))) [2018-11-23 13:12:04,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-23 13:12:04,681 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:12:04,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:12:04,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:04,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:04,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:04,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:9 [2018-11-23 13:12:04,719 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:12:04,719 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|, v_prenex_34, v_prenex_32, v_prenex_33]. (let ((.cse6 (mod main_~index~0 4294967296))) (let ((.cse0 (< .cse6 10000)) (.cse1 (= 7 main_~index~0)) (.cse3 (* 4 .cse6)) (.cse4 (<= .cse6 2147483647))) (or (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (and .cse0 .cse1 (= (select .cse2 (+ .cse3 |main_~#array~0.offset| (- 17179869184))) |main_#t~mem4|) (< 7 (mod (select .cse2 (+ |main_~#array~0.offset| 28)) 4294967296)) (not .cse4))) (let ((.cse5 (select v_prenex_34 v_prenex_32))) (and .cse0 .cse1 (< 7 (mod (select .cse5 (+ v_prenex_33 28)) 4294967296)) (= |main_#t~mem4| (select .cse5 (+ .cse3 v_prenex_33))) .cse4))))) [2018-11-23 13:12:04,719 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 7 main_~index~0) (< 7 (mod |main_#t~mem4| 4294967296))) [2018-11-23 13:12:04,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {4481#true} call ULTIMATE.init(); {4481#true} is VALID [2018-11-23 13:12:04,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {4481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4481#true} is VALID [2018-11-23 13:12:04,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 13:12:04,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4481#true} {4481#true} #49#return; {4481#true} is VALID [2018-11-23 13:12:04,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {4481#true} call #t~ret5 := main(); {4481#true} is VALID [2018-11-23 13:12:04,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {4481#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);havoc ~index~0;~index~0 := 0; {4483#(= main_~index~0 0)} is VALID [2018-11-23 13:12:04,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {4483#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4483#(= main_~index~0 0)} is VALID [2018-11-23 13:12:04,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {4483#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4517#(= 1 main_~index~0)} is VALID [2018-11-23 13:12:04,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {4517#(= 1 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4517#(= 1 main_~index~0)} is VALID [2018-11-23 13:12:04,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {4517#(= 1 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4524#(= 2 main_~index~0)} is VALID [2018-11-23 13:12:04,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {4524#(= 2 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4524#(= 2 main_~index~0)} is VALID [2018-11-23 13:12:04,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {4524#(= 2 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4531#(= 3 main_~index~0)} is VALID [2018-11-23 13:12:04,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {4531#(= 3 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4531#(= 3 main_~index~0)} is VALID [2018-11-23 13:12:04,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {4531#(= 3 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4538#(= 4 main_~index~0)} is VALID [2018-11-23 13:12:04,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {4538#(= 4 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4538#(= 4 main_~index~0)} is VALID [2018-11-23 13:12:04,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {4538#(= 4 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4545#(= 5 main_~index~0)} is VALID [2018-11-23 13:12:04,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {4545#(= 5 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4545#(= 5 main_~index~0)} is VALID [2018-11-23 13:12:04,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {4545#(= 5 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4552#(= 6 main_~index~0)} is VALID [2018-11-23 13:12:04,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {4552#(= 6 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4552#(= 6 main_~index~0)} is VALID [2018-11-23 13:12:04,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {4552#(= 6 main_~index~0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4559#(= 7 main_~index~0)} is VALID [2018-11-23 13:12:04,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {4559#(= 7 main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4563#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} is VALID [2018-11-23 13:12:04,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {4563#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4563#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} is VALID [2018-11-23 13:12:04,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {4563#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4570#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} is VALID [2018-11-23 13:12:04,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {4570#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {4570#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} is VALID [2018-11-23 13:12:04,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {4570#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} assume !(~index~0 % 4294967296 < 10000); {4570#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} is VALID [2018-11-23 13:12:04,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {4570#(< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296))} ~index~0 := 0; {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:12:04,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:12:04,822 INFO L256 TraceCheckUtils]: 27: Hoare triple {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,824 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} #53#return; {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:12:04,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} havoc #t~mem4; {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} is VALID [2018-11-23 13:12:04,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {4580#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 0 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,829 INFO L256 TraceCheckUtils]: 35: Hoare triple {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,832 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} #53#return; {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,833 INFO L273 TraceCheckUtils]: 40: Hoare triple {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} havoc #t~mem4; {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {4606#(and (= 1 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:12:04,834 INFO L273 TraceCheckUtils]: 42: Hoare triple {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:12:04,836 INFO L256 TraceCheckUtils]: 43: Hoare triple {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,838 INFO L273 TraceCheckUtils]: 46: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,839 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} #53#return; {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:12:04,840 INFO L273 TraceCheckUtils]: 48: Hoare triple {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} havoc #t~mem4; {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} is VALID [2018-11-23 13:12:04,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {4631#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 2 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:12:04,842 INFO L273 TraceCheckUtils]: 50: Hoare triple {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:12:04,844 INFO L256 TraceCheckUtils]: 51: Hoare triple {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,844 INFO L273 TraceCheckUtils]: 52: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,845 INFO L273 TraceCheckUtils]: 53: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,845 INFO L273 TraceCheckUtils]: 54: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,846 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} #53#return; {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:12:04,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} havoc #t~mem4; {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} is VALID [2018-11-23 13:12:04,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {4656#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 3 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,850 INFO L256 TraceCheckUtils]: 59: Hoare triple {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,850 INFO L273 TraceCheckUtils]: 60: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,851 INFO L273 TraceCheckUtils]: 61: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,851 INFO L273 TraceCheckUtils]: 62: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,852 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} #53#return; {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,853 INFO L273 TraceCheckUtils]: 64: Hoare triple {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} havoc #t~mem4; {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,854 INFO L273 TraceCheckUtils]: 65: Hoare triple {4681#(and (= 4 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} is VALID [2018-11-23 13:12:04,855 INFO L273 TraceCheckUtils]: 66: Hoare triple {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} is VALID [2018-11-23 13:12:04,857 INFO L256 TraceCheckUtils]: 67: Hoare triple {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,858 INFO L273 TraceCheckUtils]: 68: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,858 INFO L273 TraceCheckUtils]: 69: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,859 INFO L273 TraceCheckUtils]: 70: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,860 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} #53#return; {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} is VALID [2018-11-23 13:12:04,861 INFO L273 TraceCheckUtils]: 72: Hoare triple {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} havoc #t~mem4; {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} is VALID [2018-11-23 13:12:04,861 INFO L273 TraceCheckUtils]: 73: Hoare triple {4706#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 5 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} is VALID [2018-11-23 13:12:04,862 INFO L273 TraceCheckUtils]: 74: Hoare triple {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} is VALID [2018-11-23 13:12:04,864 INFO L256 TraceCheckUtils]: 75: Hoare triple {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,865 INFO L273 TraceCheckUtils]: 76: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} ~cond := #in~cond; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,865 INFO L273 TraceCheckUtils]: 77: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume !(0 == ~cond); {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,866 INFO L273 TraceCheckUtils]: 78: Hoare triple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} assume true; {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,867 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {4587#(exists ((|v_main_~#array~0.base_BEFORE_CALL_22| Int) (|v_main_~#array~0.offset_BEFORE_CALL_22| Int)) (< 7 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_22|) (+ |v_main_~#array~0.offset_BEFORE_CALL_22| 28)) 4294967296)))} {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} #53#return; {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} is VALID [2018-11-23 13:12:04,868 INFO L273 TraceCheckUtils]: 80: Hoare triple {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} havoc #t~mem4; {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} is VALID [2018-11-23 13:12:04,869 INFO L273 TraceCheckUtils]: 81: Hoare triple {4731#(and (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)) (= 6 main_~index~0))} #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; {4756#(and (= 7 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} is VALID [2018-11-23 13:12:04,871 INFO L273 TraceCheckUtils]: 82: Hoare triple {4756#(and (= 7 main_~index~0) (< 7 (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 4294967296)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {4760#(and (= 7 main_~index~0) (< 7 (mod |main_#t~mem4| 4294967296)))} is VALID [2018-11-23 13:12:04,873 INFO L256 TraceCheckUtils]: 83: Hoare triple {4760#(and (= 7 main_~index~0) (< 7 (mod |main_#t~mem4| 4294967296)))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {4764#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:04,873 INFO L273 TraceCheckUtils]: 84: Hoare triple {4764#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4768#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:04,874 INFO L273 TraceCheckUtils]: 85: Hoare triple {4768#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4482#false} is VALID [2018-11-23 13:12:04,874 INFO L273 TraceCheckUtils]: 86: Hoare triple {4482#false} assume !false; {4482#false} is VALID [2018-11-23 13:12:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 2 proven. 191 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:04,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:04,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24] total 33 [2018-11-23 13:12:04,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-11-23 13:12:04,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:04,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:12:05,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:05,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:12:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:12:05,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=916, Unknown=1, NotChecked=0, Total=1056 [2018-11-23 13:12:05,082 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 33 states.