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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:58:24,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:58:24,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:58:24,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:58:24,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:58:24,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:58:24,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:58:24,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:58:24,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:58:24,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:58:24,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:58:24,103 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:58:24,104 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:58:24,105 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:58:24,106 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:58:24,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:58:24,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:58:24,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:58:24,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:58:24,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:58:24,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:58:24,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:58:24,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:58:24,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:58:24,118 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:58:24,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:58:24,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:58:24,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:58:24,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:58:24,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:58:24,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:58:24,124 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:58:24,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:58:24,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:58:24,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:58:24,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:58:24,128 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-14 16:58:24,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:58:24,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:58:24,155 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:58:24,156 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:58:24,156 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:58:24,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:58:24,161 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:58:24,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:58:24,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:58:24,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:58:24,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:58:24,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:58:24,163 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:58:24,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:58:24,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:58:24,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:58:24,164 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:58:24,164 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:58:24,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:58:24,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:58:24,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:58:24,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:58:24,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:58:24,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:58:24,165 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:58:24,165 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:58:24,165 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:58:24,166 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:58:24,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:58:24,166 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:58:24,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:58:24,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:58:24,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:58:24,234 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:58:24,235 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:58:24,235 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i [2018-11-14 16:58:24,290 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf47918e7/d596f24dc44b4db989dba35b0942d6ea/FLAG0c606dc0d [2018-11-14 16:58:24,771 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:58:24,771 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i [2018-11-14 16:58:24,777 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf47918e7/d596f24dc44b4db989dba35b0942d6ea/FLAG0c606dc0d [2018-11-14 16:58:24,791 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf47918e7/d596f24dc44b4db989dba35b0942d6ea [2018-11-14 16:58:24,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:58:24,801 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:58:24,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:58:24,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:58:24,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:58:24,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:58:24" (1/1) ... [2018-11-14 16:58:24,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695698a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:24, skipping insertion in model container [2018-11-14 16:58:24,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:58:24" (1/1) ... [2018-11-14 16:58:24,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:58:24,842 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:58:25,069 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:58:25,074 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:58:25,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:58:25,124 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:58:25,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25 WrapperNode [2018-11-14 16:58:25,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:58:25,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:58:25,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:58:25,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:58:25,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (1/1) ... [2018-11-14 16:58:25,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:58:25,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:58:25,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:58:25,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:58:25,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (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-14 16:58:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:58:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:58:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:58:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:58:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:58:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:58:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:58:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:58:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:58:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:58:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:58:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:58:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:58:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:58:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:58:25,882 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:58:25,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:58:25 BoogieIcfgContainer [2018-11-14 16:58:25,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:58:25,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:58:25,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:58:25,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:58:25,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:58:24" (1/3) ... [2018-11-14 16:58:25,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc1c204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:58:25, skipping insertion in model container [2018-11-14 16:58:25,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:25" (2/3) ... [2018-11-14 16:58:25,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc1c204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:58:25, skipping insertion in model container [2018-11-14 16:58:25,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:58:25" (3/3) ... [2018-11-14 16:58:25,891 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_true-unreach-call_ground.i [2018-11-14 16:58:25,901 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:58:25,908 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:58:25,922 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:58:25,953 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:58:25,954 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:58:25,954 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:58:25,954 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:58:25,954 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:58:25,954 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:58:25,954 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:58:25,954 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:58:25,955 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:58:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 16:58:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:58:25,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:25,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:25,982 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:25,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash -704859221, now seen corresponding path program 1 times [2018-11-14 16:58:25,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:25,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:26,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:26,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:26,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 16:58:26,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-14 16:58:26,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 16:58:26,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #69#return; {32#true} is VALID [2018-11-14 16:58:26,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-14 16:58:26,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {32#true} is VALID [2018-11-14 16:58:26,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 16:58:26,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-14 16:58:26,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-14 16:58:26,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 16:58:26,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {33#false} is VALID [2018-11-14 16:58:26,140 INFO L256 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {33#false} is VALID [2018-11-14 16:58:26,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-14 16:58:26,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume ~cond == 0; {33#false} is VALID [2018-11-14 16:58:26,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 16:58:26,144 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-14 16:58:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:58:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:58:26,153 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:58:26,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:26,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:58:26,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:26,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:58:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:58:26,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:58:26,288 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 16:58:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:26,555 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2018-11-14 16:58:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:58:26,555 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:58:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:58:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2018-11-14 16:58:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:58:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2018-11-14 16:58:26,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2018-11-14 16:58:26,758 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-14 16:58:26,770 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:58:26,770 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:58:26,774 INFO L604 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-14 16:58:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:58:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:58:26,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:26,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:26,822 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:26,822 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:26,827 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 16:58:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:58:26,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:26,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:26,828 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:26,829 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:26,833 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 16:58:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:58:26,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:26,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:26,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:26,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:58:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-14 16:58:26,840 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-14 16:58:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:26,840 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-14 16:58:26,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:58:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:58:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:58:26,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:26,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:26,842 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:26,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1059583182, now seen corresponding path program 1 times [2018-11-14 16:58:26,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:26,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:26,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:27,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2018-11-14 16:58:27,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {177#true} is VALID [2018-11-14 16:58:27,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2018-11-14 16:58:27,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #69#return; {177#true} is VALID [2018-11-14 16:58:27,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret7 := main(); {177#true} is VALID [2018-11-14 16:58:27,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {177#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {179#(= main_~j~0 0)} is VALID [2018-11-14 16:58:27,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {179#(= main_~j~0 0)} assume true; {179#(= main_~j~0 0)} is VALID [2018-11-14 16:58:27,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#(= main_~j~0 0)} assume !(~j~0 < 100000); {178#false} is VALID [2018-11-14 16:58:27,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {178#false} assume true; {178#false} is VALID [2018-11-14 16:58:27,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {178#false} #t~short2 := ~i~0 < 100000; {178#false} is VALID [2018-11-14 16:58:27,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {178#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {178#false} is VALID [2018-11-14 16:58:27,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {178#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {178#false} is VALID [2018-11-14 16:58:27,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {178#false} havoc ~x~0;~x~0 := 0; {178#false} is VALID [2018-11-14 16:58:27,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {178#false} assume true; {178#false} is VALID [2018-11-14 16:58:27,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {178#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {178#false} is VALID [2018-11-14 16:58:27,193 INFO L256 TraceCheckUtils]: 15: Hoare triple {178#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {178#false} is VALID [2018-11-14 16:58:27,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {178#false} ~cond := #in~cond; {178#false} is VALID [2018-11-14 16:58:27,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {178#false} assume ~cond == 0; {178#false} is VALID [2018-11-14 16:58:27,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {178#false} assume !false; {178#false} is VALID [2018-11-14 16:58:27,196 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-14 16:58:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:58:27,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:58:27,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:58:27,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:27,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:58:27,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:27,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:58:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:58:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:58:27,342 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-14 16:58:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:27,480 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 16:58:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:58:27,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:58:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:58:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-14 16:58:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:58:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-14 16:58:27,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-14 16:58:27,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:27,838 INFO L225 Difference]: With dead ends: 42 [2018-11-14 16:58:27,840 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 16:58:27,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:58:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 16:58:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 16:58:27,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:27,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 16:58:27,864 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:58:27,865 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:58:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:27,867 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 16:58:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:58:27,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:27,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:27,869 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:58:27,869 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:58:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:27,871 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 16:58:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:58:27,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:27,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:27,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:27,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:58:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 16:58:27,875 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2018-11-14 16:58:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:27,876 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 16:58:27,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:58:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:58:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:58:27,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:27,877 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:27,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:27,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1563791412, now seen corresponding path program 1 times [2018-11-14 16:58:27,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:27,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:28,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2018-11-14 16:58:28,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {323#true} is VALID [2018-11-14 16:58:28,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2018-11-14 16:58:28,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #69#return; {323#true} is VALID [2018-11-14 16:58:28,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret7 := main(); {323#true} is VALID [2018-11-14 16:58:28,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {323#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {325#(= main_~j~0 0)} is VALID [2018-11-14 16:58:28,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(= main_~j~0 0)} assume true; {325#(= main_~j~0 0)} is VALID [2018-11-14 16:58:28,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {326#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:28,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(<= main_~j~0 1)} assume true; {326#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:28,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {326#(<= main_~j~0 1)} assume !(~j~0 < 100000); {324#false} is VALID [2018-11-14 16:58:28,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#false} assume true; {324#false} is VALID [2018-11-14 16:58:28,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#false} #t~short2 := ~i~0 < 100000; {324#false} is VALID [2018-11-14 16:58:28,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {324#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {324#false} is VALID [2018-11-14 16:58:28,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {324#false} is VALID [2018-11-14 16:58:28,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#false} havoc ~x~0;~x~0 := 0; {324#false} is VALID [2018-11-14 16:58:28,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#false} assume true; {324#false} is VALID [2018-11-14 16:58:28,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {324#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {324#false} is VALID [2018-11-14 16:58:28,058 INFO L256 TraceCheckUtils]: 17: Hoare triple {324#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {324#false} is VALID [2018-11-14 16:58:28,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2018-11-14 16:58:28,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {324#false} assume ~cond == 0; {324#false} is VALID [2018-11-14 16:58:28,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {324#false} assume !false; {324#false} is VALID [2018-11-14 16:58:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:28,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:28,061 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-14 16:58:28,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:28,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:28,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2018-11-14 16:58:28,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {323#true} is VALID [2018-11-14 16:58:28,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2018-11-14 16:58:28,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #69#return; {323#true} is VALID [2018-11-14 16:58:28,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret7 := main(); {323#true} is VALID [2018-11-14 16:58:28,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {323#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {345#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:28,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#(<= main_~j~0 0)} assume true; {345#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:28,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {345#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {326#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:28,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(<= main_~j~0 1)} assume true; {326#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:28,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {326#(<= main_~j~0 1)} assume !(~j~0 < 100000); {324#false} is VALID [2018-11-14 16:58:28,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#false} assume true; {324#false} is VALID [2018-11-14 16:58:28,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#false} #t~short2 := ~i~0 < 100000; {324#false} is VALID [2018-11-14 16:58:28,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {324#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {324#false} is VALID [2018-11-14 16:58:28,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {324#false} is VALID [2018-11-14 16:58:28,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#false} havoc ~x~0;~x~0 := 0; {324#false} is VALID [2018-11-14 16:58:28,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#false} assume true; {324#false} is VALID [2018-11-14 16:58:28,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {324#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {324#false} is VALID [2018-11-14 16:58:28,373 INFO L256 TraceCheckUtils]: 17: Hoare triple {324#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {324#false} is VALID [2018-11-14 16:58:28,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2018-11-14 16:58:28,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {324#false} assume ~cond == 0; {324#false} is VALID [2018-11-14 16:58:28,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {324#false} assume !false; {324#false} is VALID [2018-11-14 16:58:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:28,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:28,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:58:28,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:58:28,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:28,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:58:28,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:28,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:58:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:58:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:58:28,538 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-11-14 16:58:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:28,745 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 16:58:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:58:28,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:58:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:58:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 16:58:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:58:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 16:58:28,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-14 16:58:28,891 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-14 16:58:28,892 INFO L225 Difference]: With dead ends: 44 [2018-11-14 16:58:28,892 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:58:28,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:58:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:58:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:58:28,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:28,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:58:28,923 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:58:28,923 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:58:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:28,925 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 16:58:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:58:28,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:28,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:28,926 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:58:28,926 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:58:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:28,929 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 16:58:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:58:28,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:28,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:28,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:28,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:58:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 16:58:28,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2018-11-14 16:58:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:28,933 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 16:58:28,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:58:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:58:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:58:28,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:28,935 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:28,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:28,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -776595994, now seen corresponding path program 2 times [2018-11-14 16:58:28,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:28,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:28,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:29,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-14 16:58:29,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-14 16:58:29,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-14 16:58:29,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #69#return; {541#true} is VALID [2018-11-14 16:58:29,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret7 := main(); {541#true} is VALID [2018-11-14 16:58:29,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {541#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {543#(= main_~j~0 0)} is VALID [2018-11-14 16:58:29,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {543#(= main_~j~0 0)} assume true; {543#(= main_~j~0 0)} is VALID [2018-11-14 16:58:29,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {543#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {544#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:29,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {544#(<= main_~j~0 1)} assume true; {544#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:29,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {544#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {545#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:29,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {545#(<= main_~j~0 2)} assume true; {545#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:29,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#(<= main_~j~0 2)} assume !(~j~0 < 100000); {542#false} is VALID [2018-11-14 16:58:29,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:58:29,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#false} #t~short2 := ~i~0 < 100000; {542#false} is VALID [2018-11-14 16:58:29,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {542#false} is VALID [2018-11-14 16:58:29,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {542#false} is VALID [2018-11-14 16:58:29,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} havoc ~x~0;~x~0 := 0; {542#false} is VALID [2018-11-14 16:58:29,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:58:29,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {542#false} is VALID [2018-11-14 16:58:29,096 INFO L256 TraceCheckUtils]: 19: Hoare triple {542#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {542#false} is VALID [2018-11-14 16:58:29,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-14 16:58:29,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {542#false} assume ~cond == 0; {542#false} is VALID [2018-11-14 16:58:29,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-14 16:58:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:29,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:29,098 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-14 16:58:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:58:29,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:58:29,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:29,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:29,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-14 16:58:29,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-14 16:58:29,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-14 16:58:29,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #69#return; {541#true} is VALID [2018-11-14 16:58:29,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret7 := main(); {541#true} is VALID [2018-11-14 16:58:29,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {541#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(<= main_~i~0 0)} assume true; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {564#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {564#(<= main_~i~0 0)} assume true; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {564#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {564#(<= main_~i~0 0)} assume true; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {564#(<= main_~i~0 0)} assume !(~j~0 < 100000); {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {564#(<= main_~i~0 0)} assume true; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {564#(<= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {564#(<= main_~i~0 0)} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {564#(<= main_~i~0 0)} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {564#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:29,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#(<= main_~i~0 0)} havoc ~x~0;~x~0 := 0; {598#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:29,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {598#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume true; {598#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:29,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {598#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {542#false} is VALID [2018-11-14 16:58:29,317 INFO L256 TraceCheckUtils]: 19: Hoare triple {542#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {542#false} is VALID [2018-11-14 16:58:29,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-14 16:58:29,318 INFO L273 TraceCheckUtils]: 21: Hoare triple {542#false} assume ~cond == 0; {542#false} is VALID [2018-11-14 16:58:29,318 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-14 16:58:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:58:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:58:29,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-14 16:58:29,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 16:58:29,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:29,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:58:29,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:29,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:58:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:58:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:58:29,434 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2018-11-14 16:58:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:29,678 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-14 16:58:29,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:58:29,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 16:58:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:58:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 16:58:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:58:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 16:58:29,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-14 16:58:29,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:29,807 INFO L225 Difference]: With dead ends: 53 [2018-11-14 16:58:29,807 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:58:29,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:58:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:58:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 16:58:29,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:29,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 16:58:29,833 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 16:58:29,834 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 16:58:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:29,836 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 16:58:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 16:58:29,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:29,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:29,838 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 16:58:29,838 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 16:58:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:29,840 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 16:58:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 16:58:29,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:29,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:29,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:29,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:58:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-14 16:58:29,843 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-11-14 16:58:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:29,844 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-14 16:58:29,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:58:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 16:58:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:58:29,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:29,845 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:29,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:29,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1858446122, now seen corresponding path program 1 times [2018-11-14 16:58:29,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:29,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:29,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:29,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:30,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {803#true} is VALID [2018-11-14 16:58:30,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {803#true} is VALID [2018-11-14 16:58:30,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {803#true} assume true; {803#true} is VALID [2018-11-14 16:58:30,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {803#true} {803#true} #69#return; {803#true} is VALID [2018-11-14 16:58:30,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {803#true} call #t~ret7 := main(); {803#true} is VALID [2018-11-14 16:58:30,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {803#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {805#(= main_~j~0 0)} is VALID [2018-11-14 16:58:30,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#(= main_~j~0 0)} assume true; {805#(= main_~j~0 0)} is VALID [2018-11-14 16:58:30,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {806#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:30,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {806#(<= main_~j~0 1)} assume true; {806#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:30,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {806#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {807#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:30,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= main_~j~0 2)} assume true; {807#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:30,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {808#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:30,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= main_~j~0 3)} assume true; {808#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:30,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#(<= main_~j~0 3)} assume !(~j~0 < 100000); {804#false} is VALID [2018-11-14 16:58:30,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {804#false} assume true; {804#false} is VALID [2018-11-14 16:58:30,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {804#false} #t~short2 := ~i~0 < 100000; {804#false} is VALID [2018-11-14 16:58:30,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {804#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {804#false} is VALID [2018-11-14 16:58:30,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {804#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {804#false} is VALID [2018-11-14 16:58:30,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {804#false} assume true; {804#false} is VALID [2018-11-14 16:58:30,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {804#false} #t~short2 := ~i~0 < 100000; {804#false} is VALID [2018-11-14 16:58:30,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {804#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {804#false} is VALID [2018-11-14 16:58:30,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {804#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {804#false} is VALID [2018-11-14 16:58:30,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {804#false} havoc ~x~0;~x~0 := 0; {804#false} is VALID [2018-11-14 16:58:30,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {804#false} assume true; {804#false} is VALID [2018-11-14 16:58:30,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {804#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {804#false} is VALID [2018-11-14 16:58:30,063 INFO L256 TraceCheckUtils]: 25: Hoare triple {804#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {804#false} is VALID [2018-11-14 16:58:30,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {804#false} ~cond := #in~cond; {804#false} is VALID [2018-11-14 16:58:30,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {804#false} assume ~cond == 0; {804#false} is VALID [2018-11-14 16:58:30,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {804#false} assume !false; {804#false} is VALID [2018-11-14 16:58:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:58:30,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:30,066 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-14 16:58:30,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:30,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:30,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {803#true} is VALID [2018-11-14 16:58:30,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {803#true} is VALID [2018-11-14 16:58:30,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {803#true} assume true; {803#true} is VALID [2018-11-14 16:58:30,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {803#true} {803#true} #69#return; {803#true} is VALID [2018-11-14 16:58:30,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {803#true} call #t~ret7 := main(); {803#true} is VALID [2018-11-14 16:58:30,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {803#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {827#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:30,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {827#(<= main_~j~0 0)} assume true; {827#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:30,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {827#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {806#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:30,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {806#(<= main_~j~0 1)} assume true; {806#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:30,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {806#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {807#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:30,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= main_~j~0 2)} assume true; {807#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:30,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {808#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:30,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= main_~j~0 3)} assume true; {808#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:30,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {808#(<= main_~j~0 3)} assume !(~j~0 < 100000); {804#false} is VALID [2018-11-14 16:58:30,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {804#false} assume true; {804#false} is VALID [2018-11-14 16:58:30,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {804#false} #t~short2 := ~i~0 < 100000; {804#false} is VALID [2018-11-14 16:58:30,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {804#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {804#false} is VALID [2018-11-14 16:58:30,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {804#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {804#false} is VALID [2018-11-14 16:58:30,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {804#false} assume true; {804#false} is VALID [2018-11-14 16:58:30,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {804#false} #t~short2 := ~i~0 < 100000; {804#false} is VALID [2018-11-14 16:58:30,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {804#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {804#false} is VALID [2018-11-14 16:58:30,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {804#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {804#false} is VALID [2018-11-14 16:58:30,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {804#false} havoc ~x~0;~x~0 := 0; {804#false} is VALID [2018-11-14 16:58:30,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {804#false} assume true; {804#false} is VALID [2018-11-14 16:58:30,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {804#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {804#false} is VALID [2018-11-14 16:58:30,207 INFO L256 TraceCheckUtils]: 25: Hoare triple {804#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {804#false} is VALID [2018-11-14 16:58:30,208 INFO L273 TraceCheckUtils]: 26: Hoare triple {804#false} ~cond := #in~cond; {804#false} is VALID [2018-11-14 16:58:30,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {804#false} assume ~cond == 0; {804#false} is VALID [2018-11-14 16:58:30,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {804#false} assume !false; {804#false} is VALID [2018-11-14 16:58:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:58:30,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:30,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:58:30,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-14 16:58:30,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:30,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:58:30,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:30,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:58:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:58:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:58:30,282 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-14 16:58:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:30,452 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-14 16:58:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:58:30,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-14 16:58:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:58:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 16:58:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:58:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 16:58:30,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-14 16:58:30,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:30,616 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:58:30,617 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:58:30,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:58:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:58:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 16:58:30,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:30,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 16:58:30,649 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 16:58:30,649 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 16:58:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:30,652 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 16:58:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:58:30,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:30,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:30,653 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 16:58:30,654 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 16:58:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:30,656 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 16:58:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:58:30,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:30,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:30,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:30,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:58:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-14 16:58:30,659 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2018-11-14 16:58:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:30,659 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-14 16:58:30,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:58:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 16:58:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:58:30,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:30,661 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:30,661 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:30,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:30,662 INFO L82 PathProgramCache]: Analyzing trace with hash 336808176, now seen corresponding path program 2 times [2018-11-14 16:58:30,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:30,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:30,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:30,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2018-11-14 16:58:30,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {1087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1087#true} is VALID [2018-11-14 16:58:30,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2018-11-14 16:58:30,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1087#true} #69#return; {1087#true} is VALID [2018-11-14 16:58:30,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {1087#true} call #t~ret7 := main(); {1087#true} is VALID [2018-11-14 16:58:30,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {1087#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1089#(= main_~j~0 0)} is VALID [2018-11-14 16:58:30,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {1089#(= main_~j~0 0)} assume true; {1089#(= main_~j~0 0)} is VALID [2018-11-14 16:58:30,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {1089#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1090#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:30,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {1090#(<= main_~j~0 1)} assume true; {1090#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:30,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {1090#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1091#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:30,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {1091#(<= main_~j~0 2)} assume true; {1091#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:30,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {1091#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1092#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:30,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {1092#(<= main_~j~0 3)} assume true; {1092#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:30,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {1092#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1093#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:30,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {1093#(<= main_~j~0 4)} assume true; {1093#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:30,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#(<= main_~j~0 4)} assume !(~j~0 < 100000); {1088#false} is VALID [2018-11-14 16:58:30,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {1088#false} assume true; {1088#false} is VALID [2018-11-14 16:58:30,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {1088#false} #t~short2 := ~i~0 < 100000; {1088#false} is VALID [2018-11-14 16:58:30,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {1088#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1088#false} is VALID [2018-11-14 16:58:30,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {1088#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {1088#false} is VALID [2018-11-14 16:58:30,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {1088#false} assume true; {1088#false} is VALID [2018-11-14 16:58:30,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {1088#false} #t~short2 := ~i~0 < 100000; {1088#false} is VALID [2018-11-14 16:58:30,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {1088#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1088#false} is VALID [2018-11-14 16:58:30,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {1088#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1088#false} is VALID [2018-11-14 16:58:30,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {1088#false} havoc ~x~0;~x~0 := 0; {1088#false} is VALID [2018-11-14 16:58:30,814 INFO L273 TraceCheckUtils]: 25: Hoare triple {1088#false} assume true; {1088#false} is VALID [2018-11-14 16:58:30,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {1088#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1088#false} is VALID [2018-11-14 16:58:30,814 INFO L256 TraceCheckUtils]: 27: Hoare triple {1088#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1088#false} is VALID [2018-11-14 16:58:30,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2018-11-14 16:58:30,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {1088#false} assume ~cond == 0; {1088#false} is VALID [2018-11-14 16:58:30,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2018-11-14 16:58:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:58:30,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:30,818 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-14 16:58:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:58:30,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:58:30,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:30,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:30,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2018-11-14 16:58:30,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {1087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1087#true} is VALID [2018-11-14 16:58:30,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2018-11-14 16:58:30,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1087#true} #69#return; {1087#true} is VALID [2018-11-14 16:58:31,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {1087#true} call #t~ret7 := main(); {1087#true} is VALID [2018-11-14 16:58:31,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {1087#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1112#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:31,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {1112#(<= main_~j~0 0)} assume true; {1112#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:31,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {1112#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1090#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:31,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {1090#(<= main_~j~0 1)} assume true; {1090#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:31,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {1090#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1091#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:31,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {1091#(<= main_~j~0 2)} assume true; {1091#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:31,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {1091#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1092#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:31,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {1092#(<= main_~j~0 3)} assume true; {1092#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:31,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {1092#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1093#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:31,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {1093#(<= main_~j~0 4)} assume true; {1093#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:31,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#(<= main_~j~0 4)} assume !(~j~0 < 100000); {1088#false} is VALID [2018-11-14 16:58:31,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {1088#false} assume true; {1088#false} is VALID [2018-11-14 16:58:31,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {1088#false} #t~short2 := ~i~0 < 100000; {1088#false} is VALID [2018-11-14 16:58:31,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {1088#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1088#false} is VALID [2018-11-14 16:58:31,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {1088#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {1088#false} is VALID [2018-11-14 16:58:31,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {1088#false} assume true; {1088#false} is VALID [2018-11-14 16:58:31,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {1088#false} #t~short2 := ~i~0 < 100000; {1088#false} is VALID [2018-11-14 16:58:31,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {1088#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1088#false} is VALID [2018-11-14 16:58:31,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {1088#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1088#false} is VALID [2018-11-14 16:58:31,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {1088#false} havoc ~x~0;~x~0 := 0; {1088#false} is VALID [2018-11-14 16:58:31,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {1088#false} assume true; {1088#false} is VALID [2018-11-14 16:58:31,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {1088#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1088#false} is VALID [2018-11-14 16:58:31,025 INFO L256 TraceCheckUtils]: 27: Hoare triple {1088#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1088#false} is VALID [2018-11-14 16:58:31,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2018-11-14 16:58:31,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {1088#false} assume ~cond == 0; {1088#false} is VALID [2018-11-14 16:58:31,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2018-11-14 16:58:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:58:31,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:31,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:58:31,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-14 16:58:31,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:31,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:58:31,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:31,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:58:31,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:58:31,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:58:31,097 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 8 states. [2018-11-14 16:58:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:31,425 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 16:58:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:58:31,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-14 16:58:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:58:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 16:58:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:58:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 16:58:31,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 16:58:31,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:31,573 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:58:31,573 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 16:58:31,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:58:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 16:58:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 16:58:31,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:31,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 16:58:31,681 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:58:31,681 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:58:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:31,683 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 16:58:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 16:58:31,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:31,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:31,684 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:58:31,684 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:58:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:31,686 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 16:58:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 16:58:31,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:31,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:31,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:31,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:58:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 16:58:31,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2018-11-14 16:58:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:31,690 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 16:58:31,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:58:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 16:58:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:58:31,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:31,691 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:31,691 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:31,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1147246218, now seen corresponding path program 3 times [2018-11-14 16:58:31,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:31,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:31,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:31,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:31,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:32,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-14 16:58:32,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1388#true} is VALID [2018-11-14 16:58:32,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:58:32,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #69#return; {1388#true} is VALID [2018-11-14 16:58:32,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret7 := main(); {1388#true} is VALID [2018-11-14 16:58:32,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1390#(= main_~j~0 0)} is VALID [2018-11-14 16:58:32,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {1390#(= main_~j~0 0)} assume true; {1390#(= main_~j~0 0)} is VALID [2018-11-14 16:58:32,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1391#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:32,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {1391#(<= main_~j~0 1)} assume true; {1391#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:32,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {1391#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1392#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:32,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {1392#(<= main_~j~0 2)} assume true; {1392#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:32,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {1392#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1393#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:32,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {1393#(<= main_~j~0 3)} assume true; {1393#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:32,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {1393#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1394#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:32,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {1394#(<= main_~j~0 4)} assume true; {1394#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:32,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {1394#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1395#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:32,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {1395#(<= main_~j~0 5)} assume true; {1395#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:32,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {1395#(<= main_~j~0 5)} assume !(~j~0 < 100000); {1389#false} is VALID [2018-11-14 16:58:32,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:58:32,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {1389#false} #t~short2 := ~i~0 < 100000; {1389#false} is VALID [2018-11-14 16:58:32,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {1389#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1389#false} is VALID [2018-11-14 16:58:32,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {1389#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:58:32,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:58:32,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} #t~short2 := ~i~0 < 100000; {1389#false} is VALID [2018-11-14 16:58:32,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {1389#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1389#false} is VALID [2018-11-14 16:58:32,070 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1389#false} is VALID [2018-11-14 16:58:32,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} havoc ~x~0;~x~0 := 0; {1389#false} is VALID [2018-11-14 16:58:32,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:58:32,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {1389#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1389#false} is VALID [2018-11-14 16:58:32,071 INFO L256 TraceCheckUtils]: 29: Hoare triple {1389#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1389#false} is VALID [2018-11-14 16:58:32,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-14 16:58:32,071 INFO L273 TraceCheckUtils]: 31: Hoare triple {1389#false} assume ~cond == 0; {1389#false} is VALID [2018-11-14 16:58:32,071 INFO L273 TraceCheckUtils]: 32: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-14 16:58:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:58:32,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:32,073 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-14 16:58:32,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:58:32,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:58:32,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:32,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:32,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 16:58:32,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-14 16:58:32,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-14 16:58:32,408 INFO L477 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 12 treesize of output 11 [2018-11-14 16:58:32,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-14 16:58:32,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-14 16:58:32,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-11-14 16:58:32,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:58:32,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:32,625 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-14 16:58:32,628 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:58:32,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-14 16:58:32,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1388#true} is VALID [2018-11-14 16:58:32,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:58:32,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #69#return; {1388#true} is VALID [2018-11-14 16:58:32,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret7 := main(); {1388#true} is VALID [2018-11-14 16:58:32,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !(~j~0 < 100000); {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:32,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {1414#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume true; {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {1463#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} havoc ~x~0;~x~0 := 0; {1479#(and (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {1479#(and (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume true; {1479#(and (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:32,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {1479#(and (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1486#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2018-11-14 16:58:32,725 INFO L256 TraceCheckUtils]: 29: Hoare triple {1486#(= |main_#t~mem6| |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1490#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:58:32,726 INFO L273 TraceCheckUtils]: 30: Hoare triple {1490#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1494#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:58:32,726 INFO L273 TraceCheckUtils]: 31: Hoare triple {1494#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1389#false} is VALID [2018-11-14 16:58:32,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-14 16:58:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:58:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:32,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 16:58:32,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-14 16:58:32,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:32,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:58:32,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:32,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:58:32,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:58:32,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:58:32,914 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 14 states. [2018-11-14 16:58:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:34,156 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-14 16:58:34,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:58:34,156 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-14 16:58:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:58:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2018-11-14 16:58:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:58:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2018-11-14 16:58:34,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2018-11-14 16:58:34,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:34,341 INFO L225 Difference]: With dead ends: 69 [2018-11-14 16:58:34,341 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 16:58:34,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:58:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 16:58:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 16:58:34,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:34,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 16:58:34,420 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 16:58:34,420 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 16:58:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:34,422 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 16:58:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 16:58:34,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:34,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:34,422 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 16:58:34,423 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 16:58:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:34,424 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 16:58:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 16:58:34,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:34,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:34,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:34,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:58:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 16:58:34,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2018-11-14 16:58:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:34,427 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 16:58:34,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:58:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 16:58:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 16:58:34,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:34,429 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:34,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:34,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:34,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1091541729, now seen corresponding path program 1 times [2018-11-14 16:58:34,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:34,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:34,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:34,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:34,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-14 16:58:34,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-14 16:58:34,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-14 16:58:34,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #69#return; {1767#true} is VALID [2018-11-14 16:58:34,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret7 := main(); {1767#true} is VALID [2018-11-14 16:58:34,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1769#(= main_~j~0 0)} is VALID [2018-11-14 16:58:34,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(= main_~j~0 0)} assume true; {1769#(= main_~j~0 0)} is VALID [2018-11-14 16:58:34,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1770#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:34,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {1770#(<= main_~j~0 1)} assume true; {1770#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:34,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1771#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:34,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {1771#(<= main_~j~0 2)} assume true; {1771#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:34,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1772#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:34,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {1772#(<= main_~j~0 3)} assume true; {1772#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:34,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {1772#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1773#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:34,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {1773#(<= main_~j~0 4)} assume true; {1773#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:34,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {1773#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1774#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:34,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {1774#(<= main_~j~0 5)} assume true; {1774#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:34,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {1774#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1775#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:34,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {1775#(<= main_~j~0 6)} assume true; {1775#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:34,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {1775#(<= main_~j~0 6)} assume !(~j~0 < 100000); {1768#false} is VALID [2018-11-14 16:58:34,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {1768#false} #t~short2 := ~i~0 < 100000; {1768#false} is VALID [2018-11-14 16:58:34,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {1768#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1768#false} is VALID [2018-11-14 16:58:34,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {1768#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {1768#false} is VALID [2018-11-14 16:58:34,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {1768#false} #t~short2 := ~i~0 < 100000; {1768#false} is VALID [2018-11-14 16:58:34,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {1768#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1768#false} is VALID [2018-11-14 16:58:34,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {1768#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1768#false} is VALID [2018-11-14 16:58:34,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-14 16:58:34,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {1768#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1768#false} is VALID [2018-11-14 16:58:34,799 INFO L256 TraceCheckUtils]: 31: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1767#true} is VALID [2018-11-14 16:58:34,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {1767#true} ~cond := #in~cond; {1767#true} is VALID [2018-11-14 16:58:34,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {1767#true} assume !(~cond == 0); {1767#true} is VALID [2018-11-14 16:58:34,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-14 16:58:34,799 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1767#true} {1768#false} #73#return; {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {1768#false} havoc #t~mem6;havoc #t~mem5; {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {1768#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {1768#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L256 TraceCheckUtils]: 40: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-14 16:58:34,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {1768#false} assume ~cond == 0; {1768#false} is VALID [2018-11-14 16:58:34,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-14 16:58:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 16:58:34,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:34,802 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-14 16:58:34,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:34,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:34,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-14 16:58:34,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-14 16:58:34,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-14 16:58:34,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #69#return; {1767#true} is VALID [2018-11-14 16:58:34,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret7 := main(); {1767#true} is VALID [2018-11-14 16:58:34,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1794#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:34,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {1794#(<= main_~j~0 0)} assume true; {1794#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:34,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {1794#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1770#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:34,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {1770#(<= main_~j~0 1)} assume true; {1770#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:34,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1771#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:34,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {1771#(<= main_~j~0 2)} assume true; {1771#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:34,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1772#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:34,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {1772#(<= main_~j~0 3)} assume true; {1772#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:34,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {1772#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1773#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:34,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {1773#(<= main_~j~0 4)} assume true; {1773#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:34,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {1773#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1774#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:34,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {1774#(<= main_~j~0 5)} assume true; {1774#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:34,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {1774#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1775#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:34,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {1775#(<= main_~j~0 6)} assume true; {1775#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:34,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {1775#(<= main_~j~0 6)} assume !(~j~0 < 100000); {1768#false} is VALID [2018-11-14 16:58:34,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {1768#false} #t~short2 := ~i~0 < 100000; {1768#false} is VALID [2018-11-14 16:58:34,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {1768#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1768#false} is VALID [2018-11-14 16:58:34,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {1768#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {1768#false} is VALID [2018-11-14 16:58:34,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {1768#false} #t~short2 := ~i~0 < 100000; {1768#false} is VALID [2018-11-14 16:58:34,978 INFO L273 TraceCheckUtils]: 26: Hoare triple {1768#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {1768#false} is VALID [2018-11-14 16:58:34,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {1768#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1768#false} is VALID [2018-11-14 16:58:34,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-14 16:58:34,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {1768#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1768#false} is VALID [2018-11-14 16:58:34,980 INFO L256 TraceCheckUtils]: 31: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1768#false} is VALID [2018-11-14 16:58:34,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-14 16:58:34,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !(~cond == 0); {1768#false} is VALID [2018-11-14 16:58:34,981 INFO L273 TraceCheckUtils]: 34: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,981 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1768#false} {1768#false} #73#return; {1768#false} is VALID [2018-11-14 16:58:34,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {1768#false} havoc #t~mem6;havoc #t~mem5; {1768#false} is VALID [2018-11-14 16:58:34,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {1768#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {1768#false} is VALID [2018-11-14 16:58:34,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {1768#false} assume true; {1768#false} is VALID [2018-11-14 16:58:34,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {1768#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {1768#false} is VALID [2018-11-14 16:58:34,982 INFO L256 TraceCheckUtils]: 40: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1768#false} is VALID [2018-11-14 16:58:34,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-14 16:58:34,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {1768#false} assume ~cond == 0; {1768#false} is VALID [2018-11-14 16:58:34,982 INFO L273 TraceCheckUtils]: 43: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-14 16:58:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 16:58:35,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:35,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:58:35,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 16:58:35,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:35,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:58:35,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:35,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:58:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:58:35,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:58:35,048 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2018-11-14 16:58:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:35,414 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-14 16:58:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:58:35,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 16:58:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:58:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-14 16:58:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:58:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-14 16:58:35,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2018-11-14 16:58:35,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:35,508 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:58:35,509 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 16:58:35,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:58:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 16:58:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-14 16:58:35,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:35,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-14 16:58:35,562 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 16:58:35,562 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 16:58:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:35,566 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 16:58:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 16:58:35,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:35,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:35,567 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 16:58:35,567 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 16:58:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:35,570 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 16:58:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 16:58:35,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:35,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:35,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:35,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:58:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-14 16:58:35,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 44 [2018-11-14 16:58:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:35,573 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-14 16:58:35,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:58:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 16:58:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 16:58:35,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:35,574 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:35,574 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:35,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:35,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1837989435, now seen corresponding path program 2 times [2018-11-14 16:58:35,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:35,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:35,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:35,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:35,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-14 16:58:35,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2173#true} is VALID [2018-11-14 16:58:35,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-14 16:58:35,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #69#return; {2173#true} is VALID [2018-11-14 16:58:35,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret7 := main(); {2173#true} is VALID [2018-11-14 16:58:35,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2175#(= main_~j~0 0)} is VALID [2018-11-14 16:58:35,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {2175#(= main_~j~0 0)} assume true; {2175#(= main_~j~0 0)} is VALID [2018-11-14 16:58:35,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {2175#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2176#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:35,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {2176#(<= main_~j~0 1)} assume true; {2176#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:35,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {2176#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2177#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:35,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {2177#(<= main_~j~0 2)} assume true; {2177#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:35,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {2177#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2178#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:35,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {2178#(<= main_~j~0 3)} assume true; {2178#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:35,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {2178#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2179#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:35,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {2179#(<= main_~j~0 4)} assume true; {2179#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:35,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {2179#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2180#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:35,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {2180#(<= main_~j~0 5)} assume true; {2180#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:35,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {2180#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2181#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:35,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {2181#(<= main_~j~0 6)} assume true; {2181#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:35,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {2181#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2182#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:35,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {2182#(<= main_~j~0 7)} assume true; {2182#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:35,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {2182#(<= main_~j~0 7)} assume !(~j~0 < 100000); {2174#false} is VALID [2018-11-14 16:58:35,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:35,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} #t~short2 := ~i~0 < 100000; {2174#false} is VALID [2018-11-14 16:58:35,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {2174#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2174#false} is VALID [2018-11-14 16:58:35,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {2174#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {2174#false} is VALID [2018-11-14 16:58:35,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:35,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {2174#false} #t~short2 := ~i~0 < 100000; {2174#false} is VALID [2018-11-14 16:58:35,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {2174#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2174#false} is VALID [2018-11-14 16:58:35,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {2174#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2174#false} is VALID [2018-11-14 16:58:35,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {2174#false} havoc ~x~0;~x~0 := 0; {2174#false} is VALID [2018-11-14 16:58:35,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:35,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {2174#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2174#false} is VALID [2018-11-14 16:58:35,751 INFO L256 TraceCheckUtils]: 33: Hoare triple {2174#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2173#true} is VALID [2018-11-14 16:58:35,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2018-11-14 16:58:35,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {2173#true} assume !(~cond == 0); {2173#true} is VALID [2018-11-14 16:58:35,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-14 16:58:35,751 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2173#true} {2174#false} #73#return; {2174#false} is VALID [2018-11-14 16:58:35,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {2174#false} havoc #t~mem6;havoc #t~mem5; {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {2174#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L273 TraceCheckUtils]: 41: Hoare triple {2174#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L256 TraceCheckUtils]: 42: Hoare triple {2174#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L273 TraceCheckUtils]: 43: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {2174#false} assume ~cond == 0; {2174#false} is VALID [2018-11-14 16:58:35,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-14 16:58:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 16:58:35,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:35,754 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-14 16:58:35,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:58:35,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:58:35,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:35,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:36,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-14 16:58:36,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2173#true} is VALID [2018-11-14 16:58:36,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-14 16:58:36,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #69#return; {2173#true} is VALID [2018-11-14 16:58:36,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret7 := main(); {2173#true} is VALID [2018-11-14 16:58:36,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2201#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:36,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {2201#(<= main_~j~0 0)} assume true; {2201#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:36,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {2201#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2176#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:36,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {2176#(<= main_~j~0 1)} assume true; {2176#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:36,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {2176#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2177#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:36,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {2177#(<= main_~j~0 2)} assume true; {2177#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:36,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {2177#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2178#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:36,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {2178#(<= main_~j~0 3)} assume true; {2178#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:36,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {2178#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2179#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:36,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {2179#(<= main_~j~0 4)} assume true; {2179#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:36,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {2179#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2180#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:36,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {2180#(<= main_~j~0 5)} assume true; {2180#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:36,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {2180#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2181#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:36,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {2181#(<= main_~j~0 6)} assume true; {2181#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:36,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {2181#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2182#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:36,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {2182#(<= main_~j~0 7)} assume true; {2182#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:36,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {2182#(<= main_~j~0 7)} assume !(~j~0 < 100000); {2174#false} is VALID [2018-11-14 16:58:36,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:36,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} #t~short2 := ~i~0 < 100000; {2174#false} is VALID [2018-11-14 16:58:36,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {2174#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2174#false} is VALID [2018-11-14 16:58:36,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {2174#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {2174#false} #t~short2 := ~i~0 < 100000; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {2174#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {2174#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {2174#false} havoc ~x~0;~x~0 := 0; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:36,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {2174#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2174#false} is VALID [2018-11-14 16:58:36,435 INFO L256 TraceCheckUtils]: 33: Hoare triple {2174#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2174#false} is VALID [2018-11-14 16:58:36,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2018-11-14 16:58:36,435 INFO L273 TraceCheckUtils]: 35: Hoare triple {2174#false} assume !(~cond == 0); {2174#false} is VALID [2018-11-14 16:58:36,435 INFO L273 TraceCheckUtils]: 36: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:36,435 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2174#false} {2174#false} #73#return; {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L273 TraceCheckUtils]: 38: Hoare triple {2174#false} havoc #t~mem6;havoc #t~mem5; {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L273 TraceCheckUtils]: 39: Hoare triple {2174#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {2174#false} assume true; {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L273 TraceCheckUtils]: 41: Hoare triple {2174#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L256 TraceCheckUtils]: 42: Hoare triple {2174#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2018-11-14 16:58:36,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {2174#false} assume ~cond == 0; {2174#false} is VALID [2018-11-14 16:58:36,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-14 16:58:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 16:58:36,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:36,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:58:36,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-14 16:58:36,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:36,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:58:36,507 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-14 16:58:36,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:58:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:58:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:58:36,508 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-11-14 16:58:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:36,884 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 16:58:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:58:36,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-14 16:58:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:58:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2018-11-14 16:58:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:58:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2018-11-14 16:58:36,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2018-11-14 16:58:36,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:36,953 INFO L225 Difference]: With dead ends: 78 [2018-11-14 16:58:36,953 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 16:58:36,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:58:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 16:58:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-14 16:58:37,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:37,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-14 16:58:37,010 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 16:58:37,011 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 16:58:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:37,013 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 16:58:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 16:58:37,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:37,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:37,014 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 16:58:37,014 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 16:58:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:37,016 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 16:58:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 16:58:37,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:37,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:37,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:37,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 16:58:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-14 16:58:37,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 46 [2018-11-14 16:58:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:37,019 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-14 16:58:37,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:58:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 16:58:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 16:58:37,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:37,020 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:37,020 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:37,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:37,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1914696469, now seen corresponding path program 3 times [2018-11-14 16:58:37,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:37,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:37,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:37,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {2596#true} call ULTIMATE.init(); {2596#true} is VALID [2018-11-14 16:58:37,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {2596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2596#true} is VALID [2018-11-14 16:58:37,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-14 16:58:37,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2596#true} {2596#true} #69#return; {2596#true} is VALID [2018-11-14 16:58:37,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {2596#true} call #t~ret7 := main(); {2596#true} is VALID [2018-11-14 16:58:37,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {2596#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2598#(= main_~j~0 0)} is VALID [2018-11-14 16:58:37,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {2598#(= main_~j~0 0)} assume true; {2598#(= main_~j~0 0)} is VALID [2018-11-14 16:58:37,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {2598#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2599#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:37,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {2599#(<= main_~j~0 1)} assume true; {2599#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:37,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {2599#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2600#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:37,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {2600#(<= main_~j~0 2)} assume true; {2600#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:37,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {2600#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2601#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:37,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {2601#(<= main_~j~0 3)} assume true; {2601#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:37,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {2601#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2602#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:37,366 INFO L273 TraceCheckUtils]: 14: Hoare triple {2602#(<= main_~j~0 4)} assume true; {2602#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:37,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {2602#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2603#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:37,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {2603#(<= main_~j~0 5)} assume true; {2603#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:37,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {2603#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2604#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:37,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {2604#(<= main_~j~0 6)} assume true; {2604#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:37,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {2604#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2605#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:37,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {2605#(<= main_~j~0 7)} assume true; {2605#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:37,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {2605#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2606#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:37,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {2606#(<= main_~j~0 8)} assume true; {2606#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:37,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {2606#(<= main_~j~0 8)} assume !(~j~0 < 100000); {2597#false} is VALID [2018-11-14 16:58:37,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {2597#false} assume true; {2597#false} is VALID [2018-11-14 16:58:37,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {2597#false} #t~short2 := ~i~0 < 100000; {2597#false} is VALID [2018-11-14 16:58:37,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {2597#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2597#false} is VALID [2018-11-14 16:58:37,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {2597#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {2597#false} is VALID [2018-11-14 16:58:37,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {2597#false} assume true; {2597#false} is VALID [2018-11-14 16:58:37,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {2597#false} #t~short2 := ~i~0 < 100000; {2597#false} is VALID [2018-11-14 16:58:37,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {2597#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2597#false} is VALID [2018-11-14 16:58:37,379 INFO L273 TraceCheckUtils]: 31: Hoare triple {2597#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2597#false} is VALID [2018-11-14 16:58:37,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {2597#false} havoc ~x~0;~x~0 := 0; {2597#false} is VALID [2018-11-14 16:58:37,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {2597#false} assume true; {2597#false} is VALID [2018-11-14 16:58:37,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {2597#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2597#false} is VALID [2018-11-14 16:58:37,380 INFO L256 TraceCheckUtils]: 35: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2596#true} is VALID [2018-11-14 16:58:37,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {2596#true} ~cond := #in~cond; {2596#true} is VALID [2018-11-14 16:58:37,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {2596#true} assume !(~cond == 0); {2596#true} is VALID [2018-11-14 16:58:37,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-14 16:58:37,380 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2596#true} {2597#false} #73#return; {2597#false} is VALID [2018-11-14 16:58:37,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {2597#false} havoc #t~mem6;havoc #t~mem5; {2597#false} is VALID [2018-11-14 16:58:37,381 INFO L273 TraceCheckUtils]: 41: Hoare triple {2597#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {2597#false} is VALID [2018-11-14 16:58:37,381 INFO L273 TraceCheckUtils]: 42: Hoare triple {2597#false} assume true; {2597#false} is VALID [2018-11-14 16:58:37,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {2597#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2597#false} is VALID [2018-11-14 16:58:37,381 INFO L256 TraceCheckUtils]: 44: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2597#false} is VALID [2018-11-14 16:58:37,382 INFO L273 TraceCheckUtils]: 45: Hoare triple {2597#false} ~cond := #in~cond; {2597#false} is VALID [2018-11-14 16:58:37,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {2597#false} assume ~cond == 0; {2597#false} is VALID [2018-11-14 16:58:37,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {2597#false} assume !false; {2597#false} is VALID [2018-11-14 16:58:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 16:58:37,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:37,384 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-14 16:58:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:58:37,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:58:37,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:37,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:37,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {2596#true} call ULTIMATE.init(); {2596#true} is VALID [2018-11-14 16:58:37,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {2596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2596#true} is VALID [2018-11-14 16:58:37,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-14 16:58:37,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2596#true} {2596#true} #69#return; {2596#true} is VALID [2018-11-14 16:58:37,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {2596#true} call #t~ret7 := main(); {2596#true} is VALID [2018-11-14 16:58:37,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {2596#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {2625#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {2625#(<= main_~i~0 0)} assume !(~j~0 < 100000); {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {2625#(<= main_~i~0 0)} assume true; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {2625#(<= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {2625#(<= main_~i~0 0)} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2625#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:37,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {2625#(<= main_~i~0 0)} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {2692#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:37,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {2692#(<= main_~i~0 1)} assume true; {2692#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:37,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {2692#(<= main_~i~0 1)} #t~short2 := ~i~0 < 100000; {2692#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:37,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {2692#(<= main_~i~0 1)} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {2692#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:37,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {2692#(<= main_~i~0 1)} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2692#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:37,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {2692#(<= main_~i~0 1)} havoc ~x~0;~x~0 := 0; {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:37,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} assume true; {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:37,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:37,702 INFO L256 TraceCheckUtils]: 35: Hoare triple {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2596#true} is VALID [2018-11-14 16:58:37,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {2596#true} ~cond := #in~cond; {2596#true} is VALID [2018-11-14 16:58:37,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {2596#true} assume !(~cond == 0); {2596#true} is VALID [2018-11-14 16:58:37,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-14 16:58:37,703 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2596#true} {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} #73#return; {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:37,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} havoc #t~mem6;havoc #t~mem5; {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:58:37,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {2708#(and (<= main_~i~0 1) (<= 0 main_~x~0))} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {2736#(and (<= main_~i~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 16:58:37,704 INFO L273 TraceCheckUtils]: 42: Hoare triple {2736#(and (<= main_~i~0 1) (<= 1 main_~x~0))} assume true; {2736#(and (<= main_~i~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 16:58:37,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {2736#(and (<= main_~i~0 1) (<= 1 main_~x~0))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {2597#false} is VALID [2018-11-14 16:58:37,705 INFO L256 TraceCheckUtils]: 44: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2597#false} is VALID [2018-11-14 16:58:37,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {2597#false} ~cond := #in~cond; {2597#false} is VALID [2018-11-14 16:58:37,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {2597#false} assume ~cond == 0; {2597#false} is VALID [2018-11-14 16:58:37,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {2597#false} assume !false; {2597#false} is VALID [2018-11-14 16:58:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 16:58:37,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:37,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-14 16:58:37,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-14 16:58:37,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:37,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:58:37,787 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-14 16:58:37,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:58:37,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:58:37,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:58:37,789 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-14 16:58:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:38,485 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-11-14 16:58:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:58:38,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-14 16:58:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:58:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2018-11-14 16:58:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:58:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2018-11-14 16:58:38,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2018-11-14 16:58:38,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:38,627 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:58:38,627 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 16:58:38,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:58:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 16:58:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-14 16:58:38,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:38,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-14 16:58:38,741 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 16:58:38,741 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 16:58:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:38,744 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-14 16:58:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-14 16:58:38,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:38,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:38,744 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 16:58:38,744 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 16:58:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:38,746 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-14 16:58:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-14 16:58:38,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:38,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:38,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:38,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 16:58:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-14 16:58:38,748 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 48 [2018-11-14 16:58:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:38,749 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-14 16:58:38,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:58:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-14 16:58:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:58:38,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:38,750 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:38,750 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:38,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash 352252155, now seen corresponding path program 4 times [2018-11-14 16:58:38,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:38,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:38,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:38,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {3084#true} call ULTIMATE.init(); {3084#true} is VALID [2018-11-14 16:58:38,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {3084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3084#true} is VALID [2018-11-14 16:58:38,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {3084#true} assume true; {3084#true} is VALID [2018-11-14 16:58:38,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3084#true} {3084#true} #69#return; {3084#true} is VALID [2018-11-14 16:58:38,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {3084#true} call #t~ret7 := main(); {3084#true} is VALID [2018-11-14 16:58:38,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {3084#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3086#(= main_~j~0 0)} is VALID [2018-11-14 16:58:38,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {3086#(= main_~j~0 0)} assume true; {3086#(= main_~j~0 0)} is VALID [2018-11-14 16:58:38,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {3086#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3087#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:38,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~j~0 1)} assume true; {3087#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:38,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {3087#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3088#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:38,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~j~0 2)} assume true; {3088#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:38,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {3088#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3089#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:38,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {3089#(<= main_~j~0 3)} assume true; {3089#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:38,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {3089#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3090#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:38,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {3090#(<= main_~j~0 4)} assume true; {3090#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:38,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {3090#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3091#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:38,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {3091#(<= main_~j~0 5)} assume true; {3091#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:38,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {3091#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3092#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:38,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {3092#(<= main_~j~0 6)} assume true; {3092#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:38,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {3092#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3093#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:38,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {3093#(<= main_~j~0 7)} assume true; {3093#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:38,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {3093#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3094#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:38,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {3094#(<= main_~j~0 8)} assume true; {3094#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:38,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {3094#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3095#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:38,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {3095#(<= main_~j~0 9)} assume true; {3095#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:38,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {3095#(<= main_~j~0 9)} assume !(~j~0 < 100000); {3085#false} is VALID [2018-11-14 16:58:38,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:38,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {3085#false} #t~short2 := ~i~0 < 100000; {3085#false} is VALID [2018-11-14 16:58:38,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {3085#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3085#false} is VALID [2018-11-14 16:58:38,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {3085#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3085#false} is VALID [2018-11-14 16:58:38,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:38,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {3085#false} #t~short2 := ~i~0 < 100000; {3085#false} is VALID [2018-11-14 16:58:38,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {3085#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3085#false} is VALID [2018-11-14 16:58:38,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {3085#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3085#false} is VALID [2018-11-14 16:58:38,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {3085#false} #t~short2 := ~i~0 < 100000; {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {3085#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {3085#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {3085#false} havoc ~x~0;~x~0 := 0; {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {3085#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3085#false} is VALID [2018-11-14 16:58:38,955 INFO L256 TraceCheckUtils]: 41: Hoare triple {3085#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3084#true} is VALID [2018-11-14 16:58:38,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2018-11-14 16:58:38,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {3084#true} assume !(~cond == 0); {3084#true} is VALID [2018-11-14 16:58:38,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {3084#true} assume true; {3084#true} is VALID [2018-11-14 16:58:38,956 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3084#true} {3085#false} #73#return; {3085#false} is VALID [2018-11-14 16:58:38,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {3085#false} havoc #t~mem6;havoc #t~mem5; {3085#false} is VALID [2018-11-14 16:58:38,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {3085#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {3085#false} is VALID [2018-11-14 16:58:38,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:38,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {3085#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3085#false} is VALID [2018-11-14 16:58:38,956 INFO L256 TraceCheckUtils]: 50: Hoare triple {3085#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3085#false} is VALID [2018-11-14 16:58:38,958 INFO L273 TraceCheckUtils]: 51: Hoare triple {3085#false} ~cond := #in~cond; {3085#false} is VALID [2018-11-14 16:58:38,958 INFO L273 TraceCheckUtils]: 52: Hoare triple {3085#false} assume ~cond == 0; {3085#false} is VALID [2018-11-14 16:58:38,958 INFO L273 TraceCheckUtils]: 53: Hoare triple {3085#false} assume !false; {3085#false} is VALID [2018-11-14 16:58:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:58:38,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:38,960 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-14 16:58:38,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:58:39,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:58:39,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:39,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:39,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {3084#true} call ULTIMATE.init(); {3084#true} is VALID [2018-11-14 16:58:39,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {3084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3084#true} is VALID [2018-11-14 16:58:39,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {3084#true} assume true; {3084#true} is VALID [2018-11-14 16:58:39,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3084#true} {3084#true} #69#return; {3084#true} is VALID [2018-11-14 16:58:39,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {3084#true} call #t~ret7 := main(); {3084#true} is VALID [2018-11-14 16:58:39,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {3084#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3114#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:39,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {3114#(<= main_~j~0 0)} assume true; {3114#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:39,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {3114#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3087#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:39,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~j~0 1)} assume true; {3087#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:39,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {3087#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3088#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:39,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~j~0 2)} assume true; {3088#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:39,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {3088#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3089#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:39,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {3089#(<= main_~j~0 3)} assume true; {3089#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:39,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {3089#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3090#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:39,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {3090#(<= main_~j~0 4)} assume true; {3090#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:39,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {3090#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3091#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:39,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {3091#(<= main_~j~0 5)} assume true; {3091#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:39,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {3091#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3092#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:39,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {3092#(<= main_~j~0 6)} assume true; {3092#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:39,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {3092#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3093#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:39,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {3093#(<= main_~j~0 7)} assume true; {3093#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:39,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {3093#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3094#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:39,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {3094#(<= main_~j~0 8)} assume true; {3094#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:39,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {3094#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3095#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:39,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {3095#(<= main_~j~0 9)} assume true; {3095#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:39,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {3095#(<= main_~j~0 9)} assume !(~j~0 < 100000); {3085#false} is VALID [2018-11-14 16:58:39,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:39,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {3085#false} #t~short2 := ~i~0 < 100000; {3085#false} is VALID [2018-11-14 16:58:39,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {3085#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3085#false} is VALID [2018-11-14 16:58:39,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {3085#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3085#false} is VALID [2018-11-14 16:58:39,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:39,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {3085#false} #t~short2 := ~i~0 < 100000; {3085#false} is VALID [2018-11-14 16:58:39,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {3085#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3085#false} is VALID [2018-11-14 16:58:39,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {3085#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3085#false} is VALID [2018-11-14 16:58:39,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:39,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {3085#false} #t~short2 := ~i~0 < 100000; {3085#false} is VALID [2018-11-14 16:58:39,233 INFO L273 TraceCheckUtils]: 36: Hoare triple {3085#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3085#false} is VALID [2018-11-14 16:58:39,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {3085#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3085#false} is VALID [2018-11-14 16:58:39,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {3085#false} havoc ~x~0;~x~0 := 0; {3085#false} is VALID [2018-11-14 16:58:39,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:39,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {3085#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3085#false} is VALID [2018-11-14 16:58:39,234 INFO L256 TraceCheckUtils]: 41: Hoare triple {3085#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3085#false} is VALID [2018-11-14 16:58:39,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {3085#false} ~cond := #in~cond; {3085#false} is VALID [2018-11-14 16:58:39,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {3085#false} assume !(~cond == 0); {3085#false} is VALID [2018-11-14 16:58:39,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:39,235 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3085#false} {3085#false} #73#return; {3085#false} is VALID [2018-11-14 16:58:39,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {3085#false} havoc #t~mem6;havoc #t~mem5; {3085#false} is VALID [2018-11-14 16:58:39,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {3085#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {3085#false} is VALID [2018-11-14 16:58:39,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {3085#false} assume true; {3085#false} is VALID [2018-11-14 16:58:39,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {3085#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3085#false} is VALID [2018-11-14 16:58:39,235 INFO L256 TraceCheckUtils]: 50: Hoare triple {3085#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3085#false} is VALID [2018-11-14 16:58:39,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {3085#false} ~cond := #in~cond; {3085#false} is VALID [2018-11-14 16:58:39,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {3085#false} assume ~cond == 0; {3085#false} is VALID [2018-11-14 16:58:39,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {3085#false} assume !false; {3085#false} is VALID [2018-11-14 16:58:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-14 16:58:39,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:39,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 16:58:39,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-14 16:58:39,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:39,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:58:39,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:39,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:58:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:58:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:58:39,320 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2018-11-14 16:58:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:39,580 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-11-14 16:58:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:58:39,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-14 16:58:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:58:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2018-11-14 16:58:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:58:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2018-11-14 16:58:39,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 66 transitions. [2018-11-14 16:58:39,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:39,690 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:58:39,690 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 16:58:39,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:58:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 16:58:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-14 16:58:39,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:39,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-14 16:58:39,764 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 16:58:39,764 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 16:58:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:39,766 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-14 16:58:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 16:58:39,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:39,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:39,767 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-14 16:58:39,767 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-14 16:58:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:39,769 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-14 16:58:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 16:58:39,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:39,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:39,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:39,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:58:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-11-14 16:58:39,771 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 54 [2018-11-14 16:58:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:39,771 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-14 16:58:39,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:58:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 16:58:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 16:58:39,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:39,773 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:39,773 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:39,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2111436321, now seen corresponding path program 5 times [2018-11-14 16:58:39,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:39,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:39,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:40,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2018-11-14 16:58:40,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {3573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3573#true} is VALID [2018-11-14 16:58:40,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 16:58:40,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #69#return; {3573#true} is VALID [2018-11-14 16:58:40,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret7 := main(); {3573#true} is VALID [2018-11-14 16:58:40,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {3573#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3575#(= main_~j~0 0)} is VALID [2018-11-14 16:58:40,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {3575#(= main_~j~0 0)} assume true; {3575#(= main_~j~0 0)} is VALID [2018-11-14 16:58:40,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {3575#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3576#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:40,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {3576#(<= main_~j~0 1)} assume true; {3576#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:40,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {3576#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:40,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {3577#(<= main_~j~0 2)} assume true; {3577#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:40,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {3577#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3578#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:40,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {3578#(<= main_~j~0 3)} assume true; {3578#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:40,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {3578#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3579#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:40,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {3579#(<= main_~j~0 4)} assume true; {3579#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:40,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {3579#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3580#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:40,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {3580#(<= main_~j~0 5)} assume true; {3580#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:40,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {3580#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3581#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:40,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {3581#(<= main_~j~0 6)} assume true; {3581#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:40,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {3581#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3582#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:40,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {3582#(<= main_~j~0 7)} assume true; {3582#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:40,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {3582#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3583#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:40,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {3583#(<= main_~j~0 8)} assume true; {3583#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:40,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {3583#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3584#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:40,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {3584#(<= main_~j~0 9)} assume true; {3584#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:40,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {3584#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3585#(<= main_~j~0 10)} is VALID [2018-11-14 16:58:40,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {3585#(<= main_~j~0 10)} assume true; {3585#(<= main_~j~0 10)} is VALID [2018-11-14 16:58:40,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {3585#(<= main_~j~0 10)} assume !(~j~0 < 100000); {3574#false} is VALID [2018-11-14 16:58:40,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {3574#false} #t~short2 := ~i~0 < 100000; {3574#false} is VALID [2018-11-14 16:58:40,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {3574#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3574#false} is VALID [2018-11-14 16:58:40,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {3574#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3574#false} is VALID [2018-11-14 16:58:40,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,140 INFO L273 TraceCheckUtils]: 33: Hoare triple {3574#false} #t~short2 := ~i~0 < 100000; {3574#false} is VALID [2018-11-14 16:58:40,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {3574#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3574#false} is VALID [2018-11-14 16:58:40,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {3574#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3574#false} is VALID [2018-11-14 16:58:40,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {3574#false} #t~short2 := ~i~0 < 100000; {3574#false} is VALID [2018-11-14 16:58:40,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {3574#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3574#false} is VALID [2018-11-14 16:58:40,141 INFO L273 TraceCheckUtils]: 39: Hoare triple {3574#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3574#false} is VALID [2018-11-14 16:58:40,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {3574#false} havoc ~x~0;~x~0 := 0; {3574#false} is VALID [2018-11-14 16:58:40,141 INFO L273 TraceCheckUtils]: 41: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {3574#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3574#false} is VALID [2018-11-14 16:58:40,142 INFO L256 TraceCheckUtils]: 43: Hoare triple {3574#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3573#true} is VALID [2018-11-14 16:58:40,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2018-11-14 16:58:40,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {3573#true} assume !(~cond == 0); {3573#true} is VALID [2018-11-14 16:58:40,142 INFO L273 TraceCheckUtils]: 46: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 16:58:40,142 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3573#true} {3574#false} #73#return; {3574#false} is VALID [2018-11-14 16:58:40,142 INFO L273 TraceCheckUtils]: 48: Hoare triple {3574#false} havoc #t~mem6;havoc #t~mem5; {3574#false} is VALID [2018-11-14 16:58:40,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {3574#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {3574#false} is VALID [2018-11-14 16:58:40,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {3574#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3574#false} is VALID [2018-11-14 16:58:40,143 INFO L256 TraceCheckUtils]: 52: Hoare triple {3574#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3574#false} is VALID [2018-11-14 16:58:40,143 INFO L273 TraceCheckUtils]: 53: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2018-11-14 16:58:40,143 INFO L273 TraceCheckUtils]: 54: Hoare triple {3574#false} assume ~cond == 0; {3574#false} is VALID [2018-11-14 16:58:40,144 INFO L273 TraceCheckUtils]: 55: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2018-11-14 16:58:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:58:40,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:40,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:40,157 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:58:40,241 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 16:58:40,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:40,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:40,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2018-11-14 16:58:40,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {3573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3573#true} is VALID [2018-11-14 16:58:40,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 16:58:40,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #69#return; {3573#true} is VALID [2018-11-14 16:58:40,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret7 := main(); {3573#true} is VALID [2018-11-14 16:58:40,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {3573#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3604#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:40,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {3604#(<= main_~j~0 0)} assume true; {3604#(<= main_~j~0 0)} is VALID [2018-11-14 16:58:40,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {3604#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3576#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:40,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {3576#(<= main_~j~0 1)} assume true; {3576#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:40,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {3576#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:40,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {3577#(<= main_~j~0 2)} assume true; {3577#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:40,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {3577#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3578#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:40,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {3578#(<= main_~j~0 3)} assume true; {3578#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:40,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {3578#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3579#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:40,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {3579#(<= main_~j~0 4)} assume true; {3579#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:40,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {3579#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3580#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:40,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {3580#(<= main_~j~0 5)} assume true; {3580#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:40,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {3580#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3581#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:40,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {3581#(<= main_~j~0 6)} assume true; {3581#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:40,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {3581#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3582#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:40,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {3582#(<= main_~j~0 7)} assume true; {3582#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:40,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {3582#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3583#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:40,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {3583#(<= main_~j~0 8)} assume true; {3583#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:40,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {3583#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3584#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:40,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {3584#(<= main_~j~0 9)} assume true; {3584#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:40,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {3584#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3585#(<= main_~j~0 10)} is VALID [2018-11-14 16:58:40,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {3585#(<= main_~j~0 10)} assume true; {3585#(<= main_~j~0 10)} is VALID [2018-11-14 16:58:40,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {3585#(<= main_~j~0 10)} assume !(~j~0 < 100000); {3574#false} is VALID [2018-11-14 16:58:40,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {3574#false} #t~short2 := ~i~0 < 100000; {3574#false} is VALID [2018-11-14 16:58:40,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {3574#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3574#false} is VALID [2018-11-14 16:58:40,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {3574#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3574#false} is VALID [2018-11-14 16:58:40,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {3574#false} #t~short2 := ~i~0 < 100000; {3574#false} is VALID [2018-11-14 16:58:40,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {3574#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3574#false} is VALID [2018-11-14 16:58:40,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {3574#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {3574#false} is VALID [2018-11-14 16:58:40,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {3574#false} #t~short2 := ~i~0 < 100000; {3574#false} is VALID [2018-11-14 16:58:40,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {3574#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {3574#false} is VALID [2018-11-14 16:58:40,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {3574#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3574#false} is VALID [2018-11-14 16:58:40,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {3574#false} havoc ~x~0;~x~0 := 0; {3574#false} is VALID [2018-11-14 16:58:40,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {3574#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3574#false} is VALID [2018-11-14 16:58:40,409 INFO L256 TraceCheckUtils]: 43: Hoare triple {3574#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3574#false} is VALID [2018-11-14 16:58:40,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2018-11-14 16:58:40,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {3574#false} assume !(~cond == 0); {3574#false} is VALID [2018-11-14 16:58:40,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,410 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3574#false} {3574#false} #73#return; {3574#false} is VALID [2018-11-14 16:58:40,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {3574#false} havoc #t~mem6;havoc #t~mem5; {3574#false} is VALID [2018-11-14 16:58:40,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {3574#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {3574#false} is VALID [2018-11-14 16:58:40,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 16:58:40,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {3574#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {3574#false} is VALID [2018-11-14 16:58:40,411 INFO L256 TraceCheckUtils]: 52: Hoare triple {3574#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3574#false} is VALID [2018-11-14 16:58:40,411 INFO L273 TraceCheckUtils]: 53: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2018-11-14 16:58:40,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {3574#false} assume ~cond == 0; {3574#false} is VALID [2018-11-14 16:58:40,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2018-11-14 16:58:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-14 16:58:40,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:40,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:58:40,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-14 16:58:40,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:40,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:58:40,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:40,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:58:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:58:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:58:40,584 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 14 states. [2018-11-14 16:58:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:40,828 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-14 16:58:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:58:40,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-14 16:58:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:58:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2018-11-14 16:58:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:58:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2018-11-14 16:58:40,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2018-11-14 16:58:40,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:40,942 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:58:40,942 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:58:40,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:58:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:58:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-14 16:58:41,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:41,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-14 16:58:41,007 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 16:58:41,008 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 16:58:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:41,010 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-14 16:58:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-14 16:58:41,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:41,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:41,010 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 16:58:41,010 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 16:58:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:41,011 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-14 16:58:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-14 16:58:41,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:41,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:41,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:41,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 16:58:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-14 16:58:41,014 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 56 [2018-11-14 16:58:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:41,014 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-14 16:58:41,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:58:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-14 16:58:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 16:58:41,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:41,015 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:41,015 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:41,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash 470305223, now seen corresponding path program 6 times [2018-11-14 16:58:41,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:41,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:41,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:41,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:41,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {4079#true} call ULTIMATE.init(); {4079#true} is VALID [2018-11-14 16:58:41,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {4079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4079#true} is VALID [2018-11-14 16:58:41,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {4079#true} assume true; {4079#true} is VALID [2018-11-14 16:58:41,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4079#true} {4079#true} #69#return; {4079#true} is VALID [2018-11-14 16:58:41,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {4079#true} call #t~ret7 := main(); {4079#true} is VALID [2018-11-14 16:58:41,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {4079#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4081#(= main_~j~0 0)} is VALID [2018-11-14 16:58:41,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {4081#(= main_~j~0 0)} assume true; {4081#(= main_~j~0 0)} is VALID [2018-11-14 16:58:41,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {4081#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4082#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:41,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {4082#(<= main_~j~0 1)} assume true; {4082#(<= main_~j~0 1)} is VALID [2018-11-14 16:58:41,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {4082#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4083#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:41,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {4083#(<= main_~j~0 2)} assume true; {4083#(<= main_~j~0 2)} is VALID [2018-11-14 16:58:41,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {4083#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4084#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:41,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {4084#(<= main_~j~0 3)} assume true; {4084#(<= main_~j~0 3)} is VALID [2018-11-14 16:58:41,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {4084#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4085#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:41,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {4085#(<= main_~j~0 4)} assume true; {4085#(<= main_~j~0 4)} is VALID [2018-11-14 16:58:41,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {4085#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4086#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:41,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {4086#(<= main_~j~0 5)} assume true; {4086#(<= main_~j~0 5)} is VALID [2018-11-14 16:58:41,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {4086#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4087#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:41,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {4087#(<= main_~j~0 6)} assume true; {4087#(<= main_~j~0 6)} is VALID [2018-11-14 16:58:41,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {4087#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4088#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:41,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {4088#(<= main_~j~0 7)} assume true; {4088#(<= main_~j~0 7)} is VALID [2018-11-14 16:58:41,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {4088#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4089#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:41,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {4089#(<= main_~j~0 8)} assume true; {4089#(<= main_~j~0 8)} is VALID [2018-11-14 16:58:41,332 INFO L273 TraceCheckUtils]: 23: Hoare triple {4089#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4090#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:41,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {4090#(<= main_~j~0 9)} assume true; {4090#(<= main_~j~0 9)} is VALID [2018-11-14 16:58:41,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {4090#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4091#(<= main_~j~0 10)} is VALID [2018-11-14 16:58:41,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {4091#(<= main_~j~0 10)} assume true; {4091#(<= main_~j~0 10)} is VALID [2018-11-14 16:58:41,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {4091#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4092#(<= main_~j~0 11)} is VALID [2018-11-14 16:58:41,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {4092#(<= main_~j~0 11)} assume true; {4092#(<= main_~j~0 11)} is VALID [2018-11-14 16:58:41,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {4092#(<= main_~j~0 11)} assume !(~j~0 < 100000); {4080#false} is VALID [2018-11-14 16:58:41,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {4080#false} assume true; {4080#false} is VALID [2018-11-14 16:58:41,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {4080#false} #t~short2 := ~i~0 < 100000; {4080#false} is VALID [2018-11-14 16:58:41,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {4080#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {4080#false} is VALID [2018-11-14 16:58:41,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {4080#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {4080#false} is VALID [2018-11-14 16:58:41,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {4080#false} assume true; {4080#false} is VALID [2018-11-14 16:58:41,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {4080#false} #t~short2 := ~i~0 < 100000; {4080#false} is VALID [2018-11-14 16:58:41,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {4080#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {4080#false} is VALID [2018-11-14 16:58:41,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {4080#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {4080#false} is VALID [2018-11-14 16:58:41,338 INFO L273 TraceCheckUtils]: 38: Hoare triple {4080#false} assume true; {4080#false} is VALID [2018-11-14 16:58:41,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {4080#false} #t~short2 := ~i~0 < 100000; {4080#false} is VALID [2018-11-14 16:58:41,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {4080#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {4080#false} is VALID [2018-11-14 16:58:41,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {4080#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {4080#false} is VALID [2018-11-14 16:58:41,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {4080#false} havoc ~x~0;~x~0 := 0; {4080#false} is VALID [2018-11-14 16:58:41,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {4080#false} assume true; {4080#false} is VALID [2018-11-14 16:58:41,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {4080#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {4080#false} is VALID [2018-11-14 16:58:41,340 INFO L256 TraceCheckUtils]: 45: Hoare triple {4080#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4079#true} is VALID [2018-11-14 16:58:41,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {4079#true} ~cond := #in~cond; {4079#true} is VALID [2018-11-14 16:58:41,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {4079#true} assume !(~cond == 0); {4079#true} is VALID [2018-11-14 16:58:41,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {4079#true} assume true; {4079#true} is VALID [2018-11-14 16:58:41,340 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4079#true} {4080#false} #73#return; {4080#false} is VALID [2018-11-14 16:58:41,340 INFO L273 TraceCheckUtils]: 50: Hoare triple {4080#false} havoc #t~mem6;havoc #t~mem5; {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {4080#false} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {4080#false} assume true; {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L273 TraceCheckUtils]: 53: Hoare triple {4080#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L256 TraceCheckUtils]: 54: Hoare triple {4080#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L273 TraceCheckUtils]: 55: Hoare triple {4080#false} ~cond := #in~cond; {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {4080#false} assume ~cond == 0; {4080#false} is VALID [2018-11-14 16:58:41,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {4080#false} assume !false; {4080#false} is VALID [2018-11-14 16:58:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 132 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:58:41,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:41,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:58:41,387 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 16:58:41,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:41,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:41,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 16:58:41,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:41,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:41,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-14 16:58:41,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-14 16:58:41,657 INFO L477 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 16 treesize of output 15 [2018-11-14 16:58:41,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:41,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:41,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:41,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-14 16:58:43,769 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))) is different from true [2018-11-14 16:58:45,809 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:58:47,853 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-14 16:58:48,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-14 16:58:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-11-14 16:58:48,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:48,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:58:48,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:58:48,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:48,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:58:48,055 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-14 16:58:48,058 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:58:50,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {4079#true} call ULTIMATE.init(); {4079#true} is VALID [2018-11-14 16:58:50,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {4079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4079#true} is VALID [2018-11-14 16:58:50,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {4079#true} assume true; {4079#true} is VALID [2018-11-14 16:58:50,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4079#true} {4079#true} #69#return; {4079#true} is VALID [2018-11-14 16:58:50,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {4079#true} call #t~ret7 := main(); {4079#true} is VALID [2018-11-14 16:58:50,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {4079#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,120 INFO L273 TraceCheckUtils]: 21: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !(~j~0 < 100000); {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-14 16:58:50,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {4111#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,131 INFO L273 TraceCheckUtils]: 34: Hoare triple {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} assume true; {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {4196#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + ~i~0 * 4, 4);havoc #t~mem3;~i~0 := ~i~0 + 1; {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume true; {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,135 INFO L273 TraceCheckUtils]: 39: Hoare triple {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + ~i~0 * 4, 4);#t~short2 := #t~mem1 != 0; {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {4209#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} havoc ~x~0;~x~0 := 0; {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume true; {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,143 INFO L256 TraceCheckUtils]: 45: Hoare triple {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4235#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4))))} is VALID [2018-11-14 16:58:50,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {4235#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4))))} ~cond := #in~cond; {4239#(and (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:58:50,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {4239#(and (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(~cond == 0); {4243#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} is VALID [2018-11-14 16:58:50,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {4243#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} assume true; {4243#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} is VALID [2018-11-14 16:58:50,146 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4243#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #73#return; {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,146 INFO L273 TraceCheckUtils]: 50: Hoare triple {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} havoc #t~mem6;havoc #t~mem5; {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {4225#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~post4 := ~x~0;~x~0 := #t~post4 + 1;havoc #t~post4; {4256#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 1) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,148 INFO L273 TraceCheckUtils]: 52: Hoare triple {4256#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 1) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume true; {4256#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 1) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-14 16:58:50,149 INFO L273 TraceCheckUtils]: 53: Hoare triple {4256#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= main_~x~0 1) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + ~x~0 * 4, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + ~x~0 * 4, 4); {4263#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2018-11-14 16:58:50,150 INFO L256 TraceCheckUtils]: 54: Hoare triple {4263#(= |main_#t~mem6| |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4267#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:58:50,151 INFO L273 TraceCheckUtils]: 55: Hoare triple {4267#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4271#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:58:50,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {4271#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {4080#false} is VALID [2018-11-14 16:58:50,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {4080#false} assume !false; {4080#false} is VALID [2018-11-14 16:58:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 1 not checked. [2018-11-14 16:58:50,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:50,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-14 16:58:50,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-11-14 16:58:50,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:50,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 16:58:50,345 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-14 16:58:50,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 16:58:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 16:58:50,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=439, Unknown=2, NotChecked=44, Total=600 [2018-11-14 16:58:50,347 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 25 states.