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_two_index_06_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:58:34,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:58:34,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:58:34,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:58:34,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:58:34,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:58:34,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:58:34,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:58:34,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:58:34,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:58:34,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:58:34,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:58:34,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:58:34,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:58:34,954 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:58:34,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:58:34,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:58:34,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:58:34,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:58:34,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:58:34,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:58:34,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:58:34,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:58:34,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:58:34,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:58:34,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:58:34,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:58:34,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:58:34,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:58:34,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:58:34,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:58:34,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:58:34,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:58:34,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:58:34,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:58:34,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:58:34,996 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:35,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:58:35,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:58:35,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:58:35,024 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:58:35,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:58:35,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:58:35,025 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:58:35,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:58:35,025 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:58:35,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:58:35,026 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:58:35,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:58:35,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:58:35,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:58:35,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:58:35,027 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:58:35,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:58:35,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:58:35,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:58:35,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:58:35,028 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:58:35,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:58:35,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:58:35,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:58:35,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:58:35,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:58:35,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:58:35,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:58:35,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:58:35,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:58:35,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:58:35,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:58:35,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:58:35,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:58:35,097 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:58:35,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i [2018-11-14 16:58:35,167 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed08f0975/5305a6f2e7ca4116bffb8a7b0399b14f/FLAGc4281cb45 [2018-11-14 16:58:35,595 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:58:35,596 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i [2018-11-14 16:58:35,601 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed08f0975/5305a6f2e7ca4116bffb8a7b0399b14f/FLAGc4281cb45 [2018-11-14 16:58:35,615 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed08f0975/5305a6f2e7ca4116bffb8a7b0399b14f [2018-11-14 16:58:35,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:58:35,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:58:35,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:58:35,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:58:35,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:58:35,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:58:35" (1/1) ... [2018-11-14 16:58:35,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35da2c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:35, skipping insertion in model container [2018-11-14 16:58:35,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:58:35" (1/1) ... [2018-11-14 16:58:35,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:58:35,672 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:58:35,907 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:58:35,913 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:58:35,944 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:58:35,972 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:58:35,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:35 WrapperNode [2018-11-14 16:58:35,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:58:35,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:58:35,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:58:35,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:58:35,988 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:35" (1/1) ... [2018-11-14 16:58:35,988 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:35" (1/1) ... [2018-11-14 16:58:35,997 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:35" (1/1) ... [2018-11-14 16:58:35,997 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:35" (1/1) ... [2018-11-14 16:58:36,007 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:35" (1/1) ... [2018-11-14 16:58:36,014 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:35" (1/1) ... [2018-11-14 16:58:36,015 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:35" (1/1) ... [2018-11-14 16:58:36,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:58:36,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:58:36,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:58:36,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:58:36,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:35" (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:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:58:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:58:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:58:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:58:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:58:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:58:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:58:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:58:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:58:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:58:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:58:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:58:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:58:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:58:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:58:36,714 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:58:36,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:58:36 BoogieIcfgContainer [2018-11-14 16:58:36,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:58:36,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:58:36,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:58:36,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:58:36,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:58:35" (1/3) ... [2018-11-14 16:58:36,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f28b750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:58:36, skipping insertion in model container [2018-11-14 16:58:36,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:58:35" (2/3) ... [2018-11-14 16:58:36,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f28b750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:58:36, skipping insertion in model container [2018-11-14 16:58:36,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:58:36" (3/3) ... [2018-11-14 16:58:36,723 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_06_true-unreach-call.i [2018-11-14 16:58:36,733 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:58:36,741 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:58:36,755 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:58:36,787 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:58:36,788 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:58:36,788 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:58:36,788 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:58:36,788 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:58:36,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:58:36,789 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:58:36,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:58:36,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:58:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 16:58:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:58:36,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:36,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:36,819 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:36,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-14 16:58:36,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:36,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 16:58:36,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-14 16:58:36,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 16:58:36,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-14 16:58:36,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 16:58:36,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {30#true} is VALID [2018-11-14 16:58:36,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 16:58:36,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 1; {31#false} is VALID [2018-11-14 16:58:36,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-14 16:58:36,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 1;~j~0 := 0; {31#false} is VALID [2018-11-14 16:58:36,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 16:58:36,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {31#false} is VALID [2018-11-14 16:58:36,983 INFO L256 TraceCheckUtils]: 12: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {31#false} is VALID [2018-11-14 16:58:36,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 16:58:36,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume ~cond == 0; {31#false} is VALID [2018-11-14 16:58:36,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 16:58:36,987 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:36,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:58:36,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:58:36,995 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:58:36,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:37,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:58:37,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:37,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:58:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:58:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:58:37,118 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 16:58:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:37,421 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 16:58:37,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:58:37,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:58:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:58:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 16:58:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:58:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 16:58:37,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 16:58:37,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:37,603 INFO L225 Difference]: With dead ends: 46 [2018-11-14 16:58:37,604 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:58:37,607 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:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:58:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:58:37,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:37,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:58:37,644 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:58:37,644 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:58:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:37,649 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 16:58:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 16:58:37,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:37,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:37,650 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:58:37,650 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:58:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:37,654 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 16:58:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 16:58:37,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:37,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:37,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:37,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:58:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 16:58:37,659 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-14 16:58:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:37,660 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 16:58:37,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:58:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 16:58:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:58:37,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:37,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:37,662 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:37,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-14 16:58:37,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:37,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:37,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:37,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-14 16:58:37,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-14 16:58:37,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-14 16:58:37,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-14 16:58:37,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret4 := main(); {168#true} is VALID [2018-11-14 16:58:37,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {170#(= main_~i~0 0)} is VALID [2018-11-14 16:58:37,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(= main_~i~0 0)} assume true; {170#(= main_~i~0 0)} is VALID [2018-11-14 16:58:37,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {170#(= main_~i~0 0)} assume !(~i~0 < 10000); {169#false} is VALID [2018-11-14 16:58:37,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#false} ~i~0 := 1; {169#false} is VALID [2018-11-14 16:58:37,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 16:58:37,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !(~i~0 < 10000); {169#false} is VALID [2018-11-14 16:58:37,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {169#false} ~i~0 := 1;~j~0 := 0; {169#false} is VALID [2018-11-14 16:58:37,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} assume true; {169#false} is VALID [2018-11-14 16:58:37,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {169#false} is VALID [2018-11-14 16:58:37,848 INFO L256 TraceCheckUtils]: 14: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {169#false} is VALID [2018-11-14 16:58:37,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-14 16:58:37,848 INFO L273 TraceCheckUtils]: 16: Hoare triple {169#false} assume ~cond == 0; {169#false} is VALID [2018-11-14 16:58:37,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-14 16:58:37,854 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:37,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:58:37,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:58:37,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 16:58:37,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:37,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:58:37,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:37,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:58:37,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:58:37,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:58:37,906 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 16:58:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:38,051 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 16:58:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:58:38,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 16:58:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:58:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 16:58:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:58:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 16:58:38,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 16:58:38,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:38,299 INFO L225 Difference]: With dead ends: 38 [2018-11-14 16:58:38,302 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:58:38,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:58:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:58:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:58:38,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:38,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:38,442 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:38,442 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:38,445 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 16:58:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 16:58:38,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:38,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:38,451 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:38,452 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:58:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:38,456 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 16:58:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 16:58:38,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:38,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:38,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:38,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:58:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 16:58:38,461 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2018-11-14 16:58:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:38,461 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 16:58:38,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:58:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 16:58:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:58:38,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:38,463 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:38,463 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:38,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash 619123155, now seen corresponding path program 1 times [2018-11-14 16:58:38,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:38,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:38,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:38,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2018-11-14 16:58:38,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {307#true} is VALID [2018-11-14 16:58:38,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 16:58:38,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #63#return; {307#true} is VALID [2018-11-14 16:58:38,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret4 := main(); {307#true} is VALID [2018-11-14 16:58:38,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {307#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {307#true} is VALID [2018-11-14 16:58:38,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 16:58:38,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {307#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {307#true} is VALID [2018-11-14 16:58:38,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#true} assume true; {307#true} is VALID [2018-11-14 16:58:38,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#true} assume !(~i~0 < 10000); {307#true} is VALID [2018-11-14 16:58:38,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {307#true} ~i~0 := 1; {309#(= main_~i~0 1)} is VALID [2018-11-14 16:58:38,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#(= main_~i~0 1)} assume true; {309#(= main_~i~0 1)} is VALID [2018-11-14 16:58:38,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#(= main_~i~0 1)} assume !(~i~0 < 10000); {308#false} is VALID [2018-11-14 16:58:38,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#false} ~i~0 := 1;~j~0 := 0; {308#false} is VALID [2018-11-14 16:58:38,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {308#false} assume true; {308#false} is VALID [2018-11-14 16:58:38,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {308#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {308#false} is VALID [2018-11-14 16:58:38,787 INFO L256 TraceCheckUtils]: 16: Hoare triple {308#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {308#false} is VALID [2018-11-14 16:58:38,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2018-11-14 16:58:38,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {308#false} assume ~cond == 0; {308#false} is VALID [2018-11-14 16:58:38,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {308#false} assume !false; {308#false} is VALID [2018-11-14 16:58:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:58:38,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:58:38,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:58:38,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:58:38,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:38,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:58:38,840 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:38,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:58:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:58:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:58:38,842 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-14 16:58:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:39,092 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 16:58:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:58:39,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:58:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:58:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 16:58:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:58:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 16:58:39,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 16:58:39,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:39,215 INFO L225 Difference]: With dead ends: 41 [2018-11-14 16:58:39,216 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 16:58:39,216 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:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 16:58:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-14 16:58:39,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:39,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-14 16:58:39,229 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-14 16:58:39,229 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-14 16:58:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:39,233 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:58:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:58:39,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:39,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:39,235 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-14 16:58:39,235 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-14 16:58:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:39,238 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:58:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:58:39,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:39,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:39,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:39,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:58:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-14 16:58:39,242 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-14 16:58:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:39,242 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-14 16:58:39,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:58:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 16:58:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:58:39,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:39,243 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:39,244 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:39,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1402898029, now seen corresponding path program 1 times [2018-11-14 16:58:39,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:39,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:39,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:39,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:39,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 16:58:39,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-14 16:58:39,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 16:58:39,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 16:58:39,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 16:58:39,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {468#(= main_~i~0 0)} is VALID [2018-11-14 16:58:39,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(= main_~i~0 0)} assume true; {468#(= main_~i~0 0)} is VALID [2018-11-14 16:58:39,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {469#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:39,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:39,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 10000); {467#false} is VALID [2018-11-14 16:58:39,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 16:58:39,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:58:39,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {467#false} is VALID [2018-11-14 16:58:39,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:58:39,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 10000); {467#false} is VALID [2018-11-14 16:58:39,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 16:58:39,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:58:39,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {467#false} is VALID [2018-11-14 16:58:39,362 INFO L256 TraceCheckUtils]: 18: Hoare triple {467#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {467#false} is VALID [2018-11-14 16:58:39,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 16:58:39,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 16:58:39,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 16:58:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:58:39,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:39,364 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:39,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:39,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:39,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 16:58:39,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {466#true} is VALID [2018-11-14 16:58:39,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 16:58:39,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #63#return; {466#true} is VALID [2018-11-14 16:58:39,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret4 := main(); {466#true} is VALID [2018-11-14 16:58:39,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {488#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:39,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(<= main_~i~0 0)} assume true; {488#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:39,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {469#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:39,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(<= main_~i~0 1)} assume true; {469#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:39,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {469#(<= main_~i~0 1)} assume !(~i~0 < 10000); {467#false} is VALID [2018-11-14 16:58:39,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#false} ~i~0 := 1; {467#false} is VALID [2018-11-14 16:58:39,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:58:39,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {467#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {467#false} is VALID [2018-11-14 16:58:39,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:58:39,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {467#false} assume !(~i~0 < 10000); {467#false} is VALID [2018-11-14 16:58:39,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {467#false} ~i~0 := 1;~j~0 := 0; {467#false} is VALID [2018-11-14 16:58:39,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-14 16:58:39,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {467#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {467#false} is VALID [2018-11-14 16:58:39,708 INFO L256 TraceCheckUtils]: 18: Hoare triple {467#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {467#false} is VALID [2018-11-14 16:58:39,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2018-11-14 16:58:39,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#false} assume ~cond == 0; {467#false} is VALID [2018-11-14 16:58:39,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 16:58:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:58:39,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:39,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:58:39,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 16:58:39,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:39,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:58:39,789 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:39,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:58:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:58:39,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:58:39,791 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-14 16:58:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:40,187 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 16:58:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:58:40,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 16:58:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:58:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 16:58:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:58:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-14 16:58:40,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-14 16:58:40,286 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:40,288 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:58:40,288 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:58:40,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:58:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-14 16:58:40,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:40,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-14 16:58:40,305 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-14 16:58:40,305 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-14 16:58:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:40,308 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:58:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:58:40,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:40,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:40,310 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-14 16:58:40,310 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-14 16:58:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:40,312 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 16:58:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:58:40,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:40,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:40,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:40,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:58:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 16:58:40,316 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-14 16:58:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:40,316 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 16:58:40,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:58:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:58:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:58:40,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:40,318 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:40,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:40,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash -179733997, now seen corresponding path program 2 times [2018-11-14 16:58:40,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:40,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:40,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:40,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 16:58:40,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-14 16:58:40,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 16:58:40,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 16:58:40,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 16:58:40,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {709#(= main_~i~0 0)} is VALID [2018-11-14 16:58:40,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {709#(= main_~i~0 0)} assume true; {709#(= main_~i~0 0)} is VALID [2018-11-14 16:58:40,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {709#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {710#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:40,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:40,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {711#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:40,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:40,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 10000); {708#false} is VALID [2018-11-14 16:58:40,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 16:58:40,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:58:40,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {708#false} is VALID [2018-11-14 16:58:40,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:58:40,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 10000); {708#false} is VALID [2018-11-14 16:58:40,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 16:58:40,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:58:40,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {708#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {708#false} is VALID [2018-11-14 16:58:40,480 INFO L256 TraceCheckUtils]: 20: Hoare triple {708#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {708#false} is VALID [2018-11-14 16:58:40,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 16:58:40,480 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 16:58:40,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 16:58:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:58:40,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:40,482 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:40,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:58:40,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:58:40,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:40,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:40,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-14 16:58:40,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-14 16:58:40,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-14 16:58:40,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #63#return; {707#true} is VALID [2018-11-14 16:58:40,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret4 := main(); {707#true} is VALID [2018-11-14 16:58:40,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {730#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:40,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#(<= main_~i~0 0)} assume true; {730#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:40,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {730#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {710#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:40,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= main_~i~0 1)} assume true; {710#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:40,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {711#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:40,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#(<= main_~i~0 2)} assume true; {711#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:40,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#(<= main_~i~0 2)} assume !(~i~0 < 10000); {708#false} is VALID [2018-11-14 16:58:40,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#false} ~i~0 := 1; {708#false} is VALID [2018-11-14 16:58:40,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:58:40,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {708#false} is VALID [2018-11-14 16:58:40,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:58:40,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {708#false} assume !(~i~0 < 10000); {708#false} is VALID [2018-11-14 16:58:40,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {708#false} ~i~0 := 1;~j~0 := 0; {708#false} is VALID [2018-11-14 16:58:40,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {708#false} assume true; {708#false} is VALID [2018-11-14 16:58:40,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {708#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {708#false} is VALID [2018-11-14 16:58:40,648 INFO L256 TraceCheckUtils]: 20: Hoare triple {708#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {708#false} is VALID [2018-11-14 16:58:40,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-14 16:58:40,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {708#false} assume ~cond == 0; {708#false} is VALID [2018-11-14 16:58:40,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-14 16:58:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:58:40,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:40,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:58:40,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 16:58:40,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:40,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:58:40,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:40,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:58:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:58:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:58:40,747 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2018-11-14 16:58:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:40,984 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-14 16:58:40,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:58:40,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 16:58:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:58:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:58:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:58:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:58:40,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 16:58:41,072 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:41,075 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:58:41,075 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:58:41,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:58:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:58:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-14 16:58:41,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:41,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2018-11-14 16:58:41,091 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2018-11-14 16:58:41,091 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2018-11-14 16:58:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:41,095 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:58:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:58:41,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:41,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:41,096 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2018-11-14 16:58:41,096 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2018-11-14 16:58:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:41,099 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:58:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:58:41,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:41,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:41,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:41,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:58:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 16:58:41,104 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2018-11-14 16:58:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:41,105 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 16:58:41,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:58:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 16:58:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:58:41,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:41,106 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:41,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:41,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:41,107 INFO L82 PathProgramCache]: Analyzing trace with hash -670688199, now seen corresponding path program 3 times [2018-11-14 16:58:41,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:41,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:41,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:41,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:41,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:41,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 16:58:41,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {965#true} is VALID [2018-11-14 16:58:41,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:58:41,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 16:58:41,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 16:58:41,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {967#(= main_~i~0 0)} is VALID [2018-11-14 16:58:41,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(= main_~i~0 0)} assume true; {967#(= main_~i~0 0)} is VALID [2018-11-14 16:58:41,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {967#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:41,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:41,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {968#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {969#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:41,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {969#(<= main_~i~0 2)} assume true; {969#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:41,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {969#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {970#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:41,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#(<= main_~i~0 3)} assume true; {970#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:41,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#(<= main_~i~0 3)} assume !(~i~0 < 10000); {966#false} is VALID [2018-11-14 16:58:41,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {966#false} ~i~0 := 1; {966#false} is VALID [2018-11-14 16:58:41,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:58:41,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {966#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {966#false} is VALID [2018-11-14 16:58:41,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:58:41,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {966#false} assume !(~i~0 < 10000); {966#false} is VALID [2018-11-14 16:58:41,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 16:58:41,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:58:41,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {966#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {966#false} is VALID [2018-11-14 16:58:41,270 INFO L256 TraceCheckUtils]: 22: Hoare triple {966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {966#false} is VALID [2018-11-14 16:58:41,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 16:58:41,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 16:58:41,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 16:58:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:58:41,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:41,273 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:41,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:58:41,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:58:41,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:41,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:41,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {965#true} is VALID [2018-11-14 16:58:41,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {965#true} is VALID [2018-11-14 16:58:41,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:58:41,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #63#return; {965#true} is VALID [2018-11-14 16:58:41,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret4 := main(); {965#true} is VALID [2018-11-14 16:58:41,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {965#true} is VALID [2018-11-14 16:58:41,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:58:41,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 16:58:41,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:58:41,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {965#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 16:58:41,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:58:41,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {965#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {965#true} is VALID [2018-11-14 16:58:41,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {965#true} assume true; {965#true} is VALID [2018-11-14 16:58:41,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {965#true} assume !(~i~0 < 10000); {965#true} is VALID [2018-11-14 16:58:41,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#true} ~i~0 := 1; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:41,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {968#(<= main_~i~0 1)} assume true; {968#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:41,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {968#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1022#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:41,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {1022#(<= main_~i~0 7)} assume true; {1022#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:41,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {1022#(<= main_~i~0 7)} assume !(~i~0 < 10000); {966#false} is VALID [2018-11-14 16:58:41,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {966#false} ~i~0 := 1;~j~0 := 0; {966#false} is VALID [2018-11-14 16:58:41,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#false} assume true; {966#false} is VALID [2018-11-14 16:58:41,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {966#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {966#false} is VALID [2018-11-14 16:58:41,391 INFO L256 TraceCheckUtils]: 22: Hoare triple {966#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {966#false} is VALID [2018-11-14 16:58:41,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2018-11-14 16:58:41,392 INFO L273 TraceCheckUtils]: 24: Hoare triple {966#false} assume ~cond == 0; {966#false} is VALID [2018-11-14 16:58:41,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {966#false} assume !false; {966#false} is VALID [2018-11-14 16:58:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:58:41,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:41,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-14 16:58:41,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-14 16:58:41,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:41,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:58:41,563 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:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:58:41,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:58:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:58:41,564 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-14 16:58:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:41,832 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 16:58:41,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:58:41,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-14 16:58:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:58:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 16:58:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:58:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 16:58:41,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-14 16:58:41,980 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:41,982 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:58:41,982 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:58:41,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:58:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:58:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-11-14 16:58:42,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:42,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2018-11-14 16:58:42,002 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2018-11-14 16:58:42,002 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2018-11-14 16:58:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:42,005 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 16:58:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 16:58:42,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:42,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:42,006 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2018-11-14 16:58:42,006 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2018-11-14 16:58:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:42,009 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 16:58:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 16:58:42,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:42,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:42,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:42,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:58:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-14 16:58:42,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2018-11-14 16:58:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:42,012 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-14 16:58:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:58:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 16:58:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:58:42,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:42,014 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:42,014 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:42,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1044356127, now seen corresponding path program 4 times [2018-11-14 16:58:42,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:42,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:42,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:42,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:42,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:42,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-14 16:58:42,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1274#true} is VALID [2018-11-14 16:58:42,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #63#return; {1274#true} is VALID [2018-11-14 16:58:42,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret4 := main(); {1274#true} is VALID [2018-11-14 16:58:42,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {1274#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1276#(= main_~i~0 0)} is VALID [2018-11-14 16:58:42,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {1276#(= main_~i~0 0)} assume true; {1276#(= main_~i~0 0)} is VALID [2018-11-14 16:58:42,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {1276#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:42,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {1277#(<= main_~i~0 1)} assume true; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:42,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {1277#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1278#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:42,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(<= main_~i~0 2)} assume true; {1278#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:42,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {1278#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1279#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:42,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#(<= main_~i~0 3)} assume true; {1279#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:42,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {1279#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1280#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:42,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#(<= main_~i~0 4)} assume true; {1280#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:42,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {1280#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1281#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:42,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {1281#(<= main_~i~0 5)} assume true; {1281#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:42,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {1281#(<= main_~i~0 5)} assume !(~i~0 < 10000); {1275#false} is VALID [2018-11-14 16:58:42,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {1275#false} ~i~0 := 1; {1275#false} is VALID [2018-11-14 16:58:42,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:58:42,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {1275#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1275#false} is VALID [2018-11-14 16:58:42,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:58:42,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {1275#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1275#false} is VALID [2018-11-14 16:58:42,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:58:42,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {1275#false} assume !(~i~0 < 10000); {1275#false} is VALID [2018-11-14 16:58:42,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {1275#false} ~i~0 := 1;~j~0 := 0; {1275#false} is VALID [2018-11-14 16:58:42,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:58:42,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {1275#false} is VALID [2018-11-14 16:58:42,332 INFO L256 TraceCheckUtils]: 28: Hoare triple {1275#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1275#false} is VALID [2018-11-14 16:58:42,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2018-11-14 16:58:42,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {1275#false} assume ~cond == 0; {1275#false} is VALID [2018-11-14 16:58:42,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-14 16:58:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:58:42,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:42,334 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:42,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:58:42,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:58:42,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:42,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:42,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-14 16:58:42,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1274#true} is VALID [2018-11-14 16:58:42,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1274#true} {1274#true} #63#return; {1274#true} is VALID [2018-11-14 16:58:42,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {1274#true} call #t~ret4 := main(); {1274#true} is VALID [2018-11-14 16:58:42,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {1274#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1274#true} is VALID [2018-11-14 16:58:42,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {1274#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 16:58:42,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {1274#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 16:58:42,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {1274#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 16:58:42,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {1274#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 16:58:42,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {1274#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1274#true} is VALID [2018-11-14 16:58:42,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-14 16:58:42,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {1274#true} assume !(~i~0 < 10000); {1274#true} is VALID [2018-11-14 16:58:42,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {1274#true} ~i~0 := 1; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:42,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#(<= main_~i~0 1)} assume true; {1277#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:42,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1345#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:42,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {1345#(<= main_~i~0 7)} assume true; {1345#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:42,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {1345#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1352#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:42,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#(<= main_~i~0 13)} assume true; {1352#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:42,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#(<= main_~i~0 13)} assume !(~i~0 < 10000); {1275#false} is VALID [2018-11-14 16:58:42,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {1275#false} ~i~0 := 1;~j~0 := 0; {1275#false} is VALID [2018-11-14 16:58:42,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {1275#false} assume true; {1275#false} is VALID [2018-11-14 16:58:42,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {1275#false} is VALID [2018-11-14 16:58:42,592 INFO L256 TraceCheckUtils]: 28: Hoare triple {1275#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1275#false} is VALID [2018-11-14 16:58:42,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {1275#false} ~cond := #in~cond; {1275#false} is VALID [2018-11-14 16:58:42,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {1275#false} assume ~cond == 0; {1275#false} is VALID [2018-11-14 16:58:42,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-14 16:58:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:58:42,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-11-14 16:58:42,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 16:58:42,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:42,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:58:42,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:42,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:58:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:58:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:58:42,689 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-14 16:58:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:43,001 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-14 16:58:43,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:58:43,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 16:58:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:58:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 16:58:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:58:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-14 16:58:43,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-14 16:58:43,209 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:43,212 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:58:43,212 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:58:43,213 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:58:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:58:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-11-14 16:58:43,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:43,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 44 states. [2018-11-14 16:58:43,234 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 44 states. [2018-11-14 16:58:43,234 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 44 states. [2018-11-14 16:58:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:43,238 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 16:58:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 16:58:43,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:43,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:43,239 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 56 states. [2018-11-14 16:58:43,239 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 56 states. [2018-11-14 16:58:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:43,242 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 16:58:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 16:58:43,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:43,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:43,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:43,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:58:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 16:58:43,245 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 32 [2018-11-14 16:58:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:43,245 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 16:58:43,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:58:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 16:58:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 16:58:43,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:43,246 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:43,246 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:43,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:43,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2019436245, now seen corresponding path program 5 times [2018-11-14 16:58:43,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:43,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:43,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:43,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:43,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:43,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2018-11-14 16:58:43,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {1661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1661#true} is VALID [2018-11-14 16:58:43,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2018-11-14 16:58:43,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #63#return; {1661#true} is VALID [2018-11-14 16:58:43,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret4 := main(); {1661#true} is VALID [2018-11-14 16:58:43,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {1661#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1663#(= main_~i~0 0)} is VALID [2018-11-14 16:58:43,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {1663#(= main_~i~0 0)} assume true; {1663#(= main_~i~0 0)} is VALID [2018-11-14 16:58:43,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {1663#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:43,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~i~0 1)} assume true; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:43,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {1664#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:43,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#(<= main_~i~0 2)} assume true; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:43,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:43,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {1666#(<= main_~i~0 3)} assume true; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:43,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {1666#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:43,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {1667#(<= main_~i~0 4)} assume true; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:43,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {1667#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:43,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~i~0 5)} assume true; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:43,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:43,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~i~0 6)} assume true; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:43,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:43,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {1670#(<= main_~i~0 7)} assume true; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:43,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {1670#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:43,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {1671#(<= main_~i~0 8)} assume true; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:43,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {1671#(<= main_~i~0 8)} assume !(~i~0 < 10000); {1662#false} is VALID [2018-11-14 16:58:43,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#false} ~i~0 := 1; {1662#false} is VALID [2018-11-14 16:58:43,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 16:58:43,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 16:58:43,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 16:58:43,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {1662#false} assume !(~i~0 < 10000); {1662#false} is VALID [2018-11-14 16:58:43,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {1662#false} ~i~0 := 1;~j~0 := 0; {1662#false} is VALID [2018-11-14 16:58:43,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {1662#false} is VALID [2018-11-14 16:58:43,488 INFO L256 TraceCheckUtils]: 36: Hoare triple {1662#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1662#false} is VALID [2018-11-14 16:58:43,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {1662#false} ~cond := #in~cond; {1662#false} is VALID [2018-11-14 16:58:43,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#false} assume ~cond == 0; {1662#false} is VALID [2018-11-14 16:58:43,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2018-11-14 16:58:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:58:43,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:43,492 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:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:58:43,595 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-14 16:58:43,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:43,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:43,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {1661#true} call ULTIMATE.init(); {1661#true} is VALID [2018-11-14 16:58:43,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {1661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1661#true} is VALID [2018-11-14 16:58:43,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {1661#true} assume true; {1661#true} is VALID [2018-11-14 16:58:43,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1661#true} {1661#true} #63#return; {1661#true} is VALID [2018-11-14 16:58:43,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {1661#true} call #t~ret4 := main(); {1661#true} is VALID [2018-11-14 16:58:43,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {1661#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {1690#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:43,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {1690#(<= main_~i~0 0)} assume true; {1690#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:43,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:43,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~i~0 1)} assume true; {1664#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:43,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {1664#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:43,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#(<= main_~i~0 2)} assume true; {1665#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:43,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:43,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {1666#(<= main_~i~0 3)} assume true; {1666#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:43,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {1666#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:43,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {1667#(<= main_~i~0 4)} assume true; {1667#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:43,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {1667#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:43,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~i~0 5)} assume true; {1668#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:43,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:43,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~i~0 6)} assume true; {1669#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:43,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:43,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {1670#(<= main_~i~0 7)} assume true; {1670#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:43,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {1670#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:43,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {1671#(<= main_~i~0 8)} assume true; {1671#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:43,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {1671#(<= main_~i~0 8)} assume !(~i~0 < 10000); {1662#false} is VALID [2018-11-14 16:58:43,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#false} ~i~0 := 1; {1662#false} is VALID [2018-11-14 16:58:43,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 16:58:43,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 16:58:43,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {1662#false} is VALID [2018-11-14 16:58:43,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {1662#false} assume !(~i~0 < 10000); {1662#false} is VALID [2018-11-14 16:58:43,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {1662#false} ~i~0 := 1;~j~0 := 0; {1662#false} is VALID [2018-11-14 16:58:43,756 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#false} assume true; {1662#false} is VALID [2018-11-14 16:58:43,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {1662#false} is VALID [2018-11-14 16:58:43,756 INFO L256 TraceCheckUtils]: 36: Hoare triple {1662#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1662#false} is VALID [2018-11-14 16:58:43,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {1662#false} ~cond := #in~cond; {1662#false} is VALID [2018-11-14 16:58:43,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#false} assume ~cond == 0; {1662#false} is VALID [2018-11-14 16:58:43,757 INFO L273 TraceCheckUtils]: 39: Hoare triple {1662#false} assume !false; {1662#false} is VALID [2018-11-14 16:58:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:58:43,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:43,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:58:43,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-14 16:58:43,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:43,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:58:43,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:43,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:58:43,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:58:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:58:43,867 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-14 16:58:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:44,604 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-11-14 16:58:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:58:44,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-14 16:58:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:58:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-14 16:58:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:58:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-14 16:58:44,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2018-11-14 16:58:44,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:44,708 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:58:44,708 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 16:58:44,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:58:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 16:58:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-14 16:58:44,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:44,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 46 states. [2018-11-14 16:58:44,758 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 46 states. [2018-11-14 16:58:44,758 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 46 states. [2018-11-14 16:58:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:44,760 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 16:58:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 16:58:44,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:44,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:44,761 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 54 states. [2018-11-14 16:58:44,761 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 54 states. [2018-11-14 16:58:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:44,763 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 16:58:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 16:58:44,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:44,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:44,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:44,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:58:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 16:58:44,779 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 40 [2018-11-14 16:58:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:44,780 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 16:58:44,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:58:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 16:58:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 16:58:44,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:44,781 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:44,781 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:44,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -367956143, now seen corresponding path program 6 times [2018-11-14 16:58:44,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:44,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:45,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {2073#true} call ULTIMATE.init(); {2073#true} is VALID [2018-11-14 16:58:45,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {2073#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2073#true} is VALID [2018-11-14 16:58:45,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2073#true} {2073#true} #63#return; {2073#true} is VALID [2018-11-14 16:58:45,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {2073#true} call #t~ret4 := main(); {2073#true} is VALID [2018-11-14 16:58:45,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {2073#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2075#(= main_~i~0 0)} is VALID [2018-11-14 16:58:45,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {2075#(= main_~i~0 0)} assume true; {2075#(= main_~i~0 0)} is VALID [2018-11-14 16:58:45,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {2075#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2076#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:45,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {2076#(<= main_~i~0 1)} assume true; {2076#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:45,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {2076#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2077#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:45,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {2077#(<= main_~i~0 2)} assume true; {2077#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:45,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {2077#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2078#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:45,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {2078#(<= main_~i~0 3)} assume true; {2078#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:45,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {2078#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2079#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:45,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {2079#(<= main_~i~0 4)} assume true; {2079#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:45,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {2079#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2080#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:45,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {2080#(<= main_~i~0 5)} assume true; {2080#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:45,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {2080#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2081#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:45,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {2081#(<= main_~i~0 6)} assume true; {2081#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:45,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {2081#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2082#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:45,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {2082#(<= main_~i~0 7)} assume true; {2082#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:45,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {2082#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2083#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:45,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {2083#(<= main_~i~0 8)} assume true; {2083#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:45,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {2083#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2084#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:45,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {2084#(<= main_~i~0 9)} assume true; {2084#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:45,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {2084#(<= main_~i~0 9)} assume !(~i~0 < 10000); {2074#false} is VALID [2018-11-14 16:58:45,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {2074#false} ~i~0 := 1; {2074#false} is VALID [2018-11-14 16:58:45,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {2074#false} assume true; {2074#false} is VALID [2018-11-14 16:58:45,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {2074#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2074#false} is VALID [2018-11-14 16:58:45,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {2074#false} assume true; {2074#false} is VALID [2018-11-14 16:58:45,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {2074#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2074#false} is VALID [2018-11-14 16:58:45,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {2074#false} assume true; {2074#false} is VALID [2018-11-14 16:58:45,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {2074#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2074#false} is VALID [2018-11-14 16:58:45,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {2074#false} assume true; {2074#false} is VALID [2018-11-14 16:58:45,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {2074#false} assume !(~i~0 < 10000); {2074#false} is VALID [2018-11-14 16:58:45,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {2074#false} ~i~0 := 1;~j~0 := 0; {2074#false} is VALID [2018-11-14 16:58:45,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {2074#false} assume true; {2074#false} is VALID [2018-11-14 16:58:45,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {2074#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {2074#false} is VALID [2018-11-14 16:58:45,077 INFO L256 TraceCheckUtils]: 38: Hoare triple {2074#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2074#false} is VALID [2018-11-14 16:58:45,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {2074#false} ~cond := #in~cond; {2074#false} is VALID [2018-11-14 16:58:45,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {2074#false} assume ~cond == 0; {2074#false} is VALID [2018-11-14 16:58:45,078 INFO L273 TraceCheckUtils]: 41: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2018-11-14 16:58:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:58:45,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:45,080 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:45,097 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:58:45,214 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:58:45,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:45,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:45,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {2073#true} call ULTIMATE.init(); {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {2073#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2073#true} {2073#true} #63#return; {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {2073#true} call #t~ret4 := main(); {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {2073#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {2073#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2073#true} is VALID [2018-11-14 16:58:45,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {2073#true} assume true; {2073#true} is VALID [2018-11-14 16:58:45,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {2073#true} assume !(~i~0 < 10000); {2073#true} is VALID [2018-11-14 16:58:45,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {2073#true} ~i~0 := 1; {2076#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:45,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {2076#(<= main_~i~0 1)} assume true; {2076#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:45,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {2076#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2082#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:45,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {2082#(<= main_~i~0 7)} assume true; {2082#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:45,968 INFO L273 TraceCheckUtils]: 30: Hoare triple {2082#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2178#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:45,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {2178#(<= main_~i~0 13)} assume true; {2178#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:45,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {2178#(<= main_~i~0 13)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2185#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:45,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {2185#(<= main_~i~0 19)} assume true; {2185#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:45,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {2185#(<= main_~i~0 19)} assume !(~i~0 < 10000); {2074#false} is VALID [2018-11-14 16:58:45,990 INFO L273 TraceCheckUtils]: 35: Hoare triple {2074#false} ~i~0 := 1;~j~0 := 0; {2074#false} is VALID [2018-11-14 16:58:45,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {2074#false} assume true; {2074#false} is VALID [2018-11-14 16:58:45,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {2074#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {2074#false} is VALID [2018-11-14 16:58:45,990 INFO L256 TraceCheckUtils]: 38: Hoare triple {2074#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2074#false} is VALID [2018-11-14 16:58:45,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {2074#false} ~cond := #in~cond; {2074#false} is VALID [2018-11-14 16:58:45,991 INFO L273 TraceCheckUtils]: 40: Hoare triple {2074#false} assume ~cond == 0; {2074#false} is VALID [2018-11-14 16:58:45,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2018-11-14 16:58:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 16:58:46,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:46,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 14 [2018-11-14 16:58:46,012 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-14 16:58:46,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:46,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:58:46,064 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:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:58:46,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:58:46,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:58:46,065 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-11-14 16:58:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:46,509 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-14 16:58:46,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:58:46,509 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-14 16:58:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:58:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 95 transitions. [2018-11-14 16:58:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:58:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 95 transitions. [2018-11-14 16:58:46,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 95 transitions. [2018-11-14 16:58:46,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:46,623 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:58:46,623 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 16:58:46,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:58:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 16:58:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2018-11-14 16:58:46,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:46,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2018-11-14 16:58:46,656 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2018-11-14 16:58:46,656 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2018-11-14 16:58:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:46,659 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-14 16:58:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-14 16:58:46,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:46,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:46,660 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2018-11-14 16:58:46,660 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2018-11-14 16:58:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:46,663 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-14 16:58:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-14 16:58:46,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:46,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:46,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:46,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 16:58:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-14 16:58:46,666 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 42 [2018-11-14 16:58:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:46,666 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-14 16:58:46,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:58:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-14 16:58:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 16:58:46,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:46,667 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:46,668 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:46,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1093239133, now seen corresponding path program 7 times [2018-11-14 16:58:46,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:46,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:46,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2561#true} is VALID [2018-11-14 16:58:46,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {2561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2561#true} is VALID [2018-11-14 16:58:46,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2018-11-14 16:58:46,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #63#return; {2561#true} is VALID [2018-11-14 16:58:46,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret4 := main(); {2561#true} is VALID [2018-11-14 16:58:46,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {2561#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2563#(= main_~i~0 0)} is VALID [2018-11-14 16:58:46,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {2563#(= main_~i~0 0)} assume true; {2563#(= main_~i~0 0)} is VALID [2018-11-14 16:58:46,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {2563#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2564#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:46,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {2564#(<= main_~i~0 1)} assume true; {2564#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:46,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {2564#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2565#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:46,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {2565#(<= main_~i~0 2)} assume true; {2565#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:46,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {2565#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2566#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:46,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {2566#(<= main_~i~0 3)} assume true; {2566#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:46,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {2566#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2567#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:46,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {2567#(<= main_~i~0 4)} assume true; {2567#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:46,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {2567#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:46,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {2568#(<= main_~i~0 5)} assume true; {2568#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:46,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {2568#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:46,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {2569#(<= main_~i~0 6)} assume true; {2569#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:46,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {2569#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:46,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {2570#(<= main_~i~0 7)} assume true; {2570#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:46,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {2570#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:46,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {2571#(<= main_~i~0 8)} assume true; {2571#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:46,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {2571#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:46,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {2572#(<= main_~i~0 9)} assume true; {2572#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:46,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {2572#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:46,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {2573#(<= main_~i~0 10)} assume true; {2573#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:46,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {2573#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2574#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:46,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {2574#(<= main_~i~0 11)} assume true; {2574#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:46,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {2574#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2575#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:46,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {2575#(<= main_~i~0 12)} assume true; {2575#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:46,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {2575#(<= main_~i~0 12)} assume !(~i~0 < 10000); {2562#false} is VALID [2018-11-14 16:58:46,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {2562#false} ~i~0 := 1; {2562#false} is VALID [2018-11-14 16:58:46,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:46,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:46,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:46,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:46,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:46,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:46,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:46,956 INFO L273 TraceCheckUtils]: 40: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:46,956 INFO L273 TraceCheckUtils]: 41: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:46,957 INFO L273 TraceCheckUtils]: 42: Hoare triple {2562#false} assume !(~i~0 < 10000); {2562#false} is VALID [2018-11-14 16:58:46,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {2562#false} ~i~0 := 1;~j~0 := 0; {2562#false} is VALID [2018-11-14 16:58:46,957 INFO L273 TraceCheckUtils]: 44: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:46,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {2562#false} is VALID [2018-11-14 16:58:46,958 INFO L256 TraceCheckUtils]: 46: Hoare triple {2562#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2562#false} is VALID [2018-11-14 16:58:46,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {2562#false} ~cond := #in~cond; {2562#false} is VALID [2018-11-14 16:58:46,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {2562#false} assume ~cond == 0; {2562#false} is VALID [2018-11-14 16:58:46,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2018-11-14 16:58:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 16:58:46,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:46,962 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:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:47,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:47,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2561#true} is VALID [2018-11-14 16:58:47,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {2561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2561#true} is VALID [2018-11-14 16:58:47,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2018-11-14 16:58:47,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #63#return; {2561#true} is VALID [2018-11-14 16:58:47,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret4 := main(); {2561#true} is VALID [2018-11-14 16:58:47,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {2561#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {2594#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:47,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {2594#(<= main_~i~0 0)} assume true; {2594#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:47,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {2594#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2564#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:47,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {2564#(<= main_~i~0 1)} assume true; {2564#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:47,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {2564#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2565#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:47,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {2565#(<= main_~i~0 2)} assume true; {2565#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:47,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {2565#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2566#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:47,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {2566#(<= main_~i~0 3)} assume true; {2566#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:47,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {2566#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2567#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:47,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {2567#(<= main_~i~0 4)} assume true; {2567#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:47,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {2567#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:47,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {2568#(<= main_~i~0 5)} assume true; {2568#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:47,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {2568#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:47,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {2569#(<= main_~i~0 6)} assume true; {2569#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:47,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {2569#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:47,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {2570#(<= main_~i~0 7)} assume true; {2570#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:47,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {2570#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:47,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {2571#(<= main_~i~0 8)} assume true; {2571#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:47,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {2571#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:47,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {2572#(<= main_~i~0 9)} assume true; {2572#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:47,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {2572#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:47,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {2573#(<= main_~i~0 10)} assume true; {2573#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:47,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {2573#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2574#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:47,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {2574#(<= main_~i~0 11)} assume true; {2574#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:47,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {2574#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {2575#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:47,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {2575#(<= main_~i~0 12)} assume true; {2575#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:47,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {2575#(<= main_~i~0 12)} assume !(~i~0 < 10000); {2562#false} is VALID [2018-11-14 16:58:47,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {2562#false} ~i~0 := 1; {2562#false} is VALID [2018-11-14 16:58:47,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:47,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:47,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:47,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:47,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:47,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:47,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:47,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {2562#false} is VALID [2018-11-14 16:58:47,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:47,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {2562#false} assume !(~i~0 < 10000); {2562#false} is VALID [2018-11-14 16:58:47,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {2562#false} ~i~0 := 1;~j~0 := 0; {2562#false} is VALID [2018-11-14 16:58:47,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {2562#false} assume true; {2562#false} is VALID [2018-11-14 16:58:47,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {2562#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {2562#false} is VALID [2018-11-14 16:58:47,300 INFO L256 TraceCheckUtils]: 46: Hoare triple {2562#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2562#false} is VALID [2018-11-14 16:58:47,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {2562#false} ~cond := #in~cond; {2562#false} is VALID [2018-11-14 16:58:47,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {2562#false} assume ~cond == 0; {2562#false} is VALID [2018-11-14 16:58:47,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2018-11-14 16:58:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 16:58:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 16:58:47,335 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-14 16:58:47,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:47,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:58:47,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:47,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:58:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:58:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:58:47,467 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 16 states. [2018-11-14 16:58:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:47,935 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-11-14 16:58:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:58:47,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-14 16:58:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:58:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2018-11-14 16:58:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:58:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2018-11-14 16:58:47,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 80 transitions. [2018-11-14 16:58:48,042 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:48,044 INFO L225 Difference]: With dead ends: 86 [2018-11-14 16:58:48,045 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 16:58:48,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:58:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 16:58:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-11-14 16:58:48,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:48,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 56 states. [2018-11-14 16:58:48,098 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 56 states. [2018-11-14 16:58:48,098 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 56 states. [2018-11-14 16:58:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:48,101 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 16:58:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 16:58:48,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:48,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:48,101 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 64 states. [2018-11-14 16:58:48,101 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 64 states. [2018-11-14 16:58:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:48,103 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 16:58:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 16:58:48,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:48,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:48,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:48,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:58:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-14 16:58:48,105 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 50 [2018-11-14 16:58:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:48,105 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-14 16:58:48,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:58:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 16:58:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 16:58:48,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:48,106 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:48,107 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:48,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1081597949, now seen corresponding path program 8 times [2018-11-14 16:58:48,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:48,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:48,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:48,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:58:48,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:48,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {3060#true} call ULTIMATE.init(); {3060#true} is VALID [2018-11-14 16:58:48,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {3060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3060#true} is VALID [2018-11-14 16:58:48,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {3060#true} assume true; {3060#true} is VALID [2018-11-14 16:58:48,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3060#true} {3060#true} #63#return; {3060#true} is VALID [2018-11-14 16:58:48,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {3060#true} call #t~ret4 := main(); {3060#true} is VALID [2018-11-14 16:58:48,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {3060#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3062#(= main_~i~0 0)} is VALID [2018-11-14 16:58:48,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {3062#(= main_~i~0 0)} assume true; {3062#(= main_~i~0 0)} is VALID [2018-11-14 16:58:48,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {3062#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3063#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:48,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {3063#(<= main_~i~0 1)} assume true; {3063#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:48,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {3063#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3064#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:48,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {3064#(<= main_~i~0 2)} assume true; {3064#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:48,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {3064#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3065#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:48,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {3065#(<= main_~i~0 3)} assume true; {3065#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:48,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {3065#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3066#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:48,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {3066#(<= main_~i~0 4)} assume true; {3066#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:48,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {3066#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3067#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:48,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {3067#(<= main_~i~0 5)} assume true; {3067#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:48,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {3067#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3068#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:48,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {3068#(<= main_~i~0 6)} assume true; {3068#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:48,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {3068#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3069#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:48,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {3069#(<= main_~i~0 7)} assume true; {3069#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:48,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {3069#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3070#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:48,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {3070#(<= main_~i~0 8)} assume true; {3070#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:48,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {3070#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3071#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:48,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {3071#(<= main_~i~0 9)} assume true; {3071#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:48,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {3071#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3072#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:48,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {3072#(<= main_~i~0 10)} assume true; {3072#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:48,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {3072#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3073#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:48,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {3073#(<= main_~i~0 11)} assume true; {3073#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:48,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {3073#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3074#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:48,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {3074#(<= main_~i~0 12)} assume true; {3074#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:48,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {3074#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3075#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:48,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {3075#(<= main_~i~0 13)} assume true; {3075#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:48,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {3075#(<= main_~i~0 13)} assume !(~i~0 < 10000); {3061#false} is VALID [2018-11-14 16:58:48,452 INFO L273 TraceCheckUtils]: 34: Hoare triple {3061#false} ~i~0 := 1; {3061#false} is VALID [2018-11-14 16:58:48,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,454 INFO L273 TraceCheckUtils]: 42: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {3061#false} assume !(~i~0 < 10000); {3061#false} is VALID [2018-11-14 16:58:48,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {3061#false} ~i~0 := 1;~j~0 := 0; {3061#false} is VALID [2018-11-14 16:58:48,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,455 INFO L273 TraceCheckUtils]: 47: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {3061#false} is VALID [2018-11-14 16:58:48,455 INFO L256 TraceCheckUtils]: 48: Hoare triple {3061#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3061#false} is VALID [2018-11-14 16:58:48,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {3061#false} ~cond := #in~cond; {3061#false} is VALID [2018-11-14 16:58:48,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {3061#false} assume ~cond == 0; {3061#false} is VALID [2018-11-14 16:58:48,456 INFO L273 TraceCheckUtils]: 51: Hoare triple {3061#false} assume !false; {3061#false} is VALID [2018-11-14 16:58:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 16:58:48,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:48,458 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:48,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:58:48,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:58:48,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:48,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:48,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {3060#true} call ULTIMATE.init(); {3060#true} is VALID [2018-11-14 16:58:48,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {3060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3060#true} is VALID [2018-11-14 16:58:48,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {3060#true} assume true; {3060#true} is VALID [2018-11-14 16:58:48,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3060#true} {3060#true} #63#return; {3060#true} is VALID [2018-11-14 16:58:48,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {3060#true} call #t~ret4 := main(); {3060#true} is VALID [2018-11-14 16:58:48,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {3060#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3094#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:48,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {3094#(<= main_~i~0 0)} assume true; {3094#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:48,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {3094#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3063#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:48,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {3063#(<= main_~i~0 1)} assume true; {3063#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:48,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {3063#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3064#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:48,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {3064#(<= main_~i~0 2)} assume true; {3064#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:48,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {3064#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3065#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:48,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {3065#(<= main_~i~0 3)} assume true; {3065#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:48,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {3065#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3066#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:48,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {3066#(<= main_~i~0 4)} assume true; {3066#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:48,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {3066#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3067#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:48,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {3067#(<= main_~i~0 5)} assume true; {3067#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:48,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {3067#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3068#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:48,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {3068#(<= main_~i~0 6)} assume true; {3068#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:48,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {3068#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3069#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:48,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {3069#(<= main_~i~0 7)} assume true; {3069#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:48,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {3069#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3070#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:48,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {3070#(<= main_~i~0 8)} assume true; {3070#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:48,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {3070#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3071#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:48,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {3071#(<= main_~i~0 9)} assume true; {3071#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:48,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {3071#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3072#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:48,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {3072#(<= main_~i~0 10)} assume true; {3072#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:48,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {3072#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3073#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:48,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {3073#(<= main_~i~0 11)} assume true; {3073#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:48,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {3073#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3074#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:48,794 INFO L273 TraceCheckUtils]: 30: Hoare triple {3074#(<= main_~i~0 12)} assume true; {3074#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:48,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {3074#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3075#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:48,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {3075#(<= main_~i~0 13)} assume true; {3075#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:48,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {3075#(<= main_~i~0 13)} assume !(~i~0 < 10000); {3061#false} is VALID [2018-11-14 16:58:48,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {3061#false} ~i~0 := 1; {3061#false} is VALID [2018-11-14 16:58:48,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,797 INFO L273 TraceCheckUtils]: 39: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,798 INFO L273 TraceCheckUtils]: 40: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,798 INFO L273 TraceCheckUtils]: 42: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3061#false} is VALID [2018-11-14 16:58:48,798 INFO L273 TraceCheckUtils]: 43: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {3061#false} assume !(~i~0 < 10000); {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L273 TraceCheckUtils]: 45: Hoare triple {3061#false} ~i~0 := 1;~j~0 := 0; {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {3061#false} assume true; {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {3061#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L256 TraceCheckUtils]: 48: Hoare triple {3061#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L273 TraceCheckUtils]: 49: Hoare triple {3061#false} ~cond := #in~cond; {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {3061#false} assume ~cond == 0; {3061#false} is VALID [2018-11-14 16:58:48,799 INFO L273 TraceCheckUtils]: 51: Hoare triple {3061#false} assume !false; {3061#false} is VALID [2018-11-14 16:58:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 16:58:48,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:48,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:58:48,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 16:58:48,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:48,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:58:48,875 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:48,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:58:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:58:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:58:48,877 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 17 states. [2018-11-14 16:58:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:49,266 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-14 16:58:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:58:49,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-14 16:58:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:58:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2018-11-14 16:58:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:58:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2018-11-14 16:58:49,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2018-11-14 16:58:49,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:49,396 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:58:49,396 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 16:58:49,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:58:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 16:58:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2018-11-14 16:58:49,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:49,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 58 states. [2018-11-14 16:58:49,425 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 58 states. [2018-11-14 16:58:49,425 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 58 states. [2018-11-14 16:58:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:49,427 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 16:58:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-14 16:58:49,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:49,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:49,428 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 70 states. [2018-11-14 16:58:49,428 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 70 states. [2018-11-14 16:58:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:49,429 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 16:58:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-14 16:58:49,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:49,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:49,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:49,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:58:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-14 16:58:49,431 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 52 [2018-11-14 16:58:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:49,431 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-14 16:58:49,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:58:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-14 16:58:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:58:49,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:49,432 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:49,432 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:49,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash 549039401, now seen corresponding path program 9 times [2018-11-14 16:58:49,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:49,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:49,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:49,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {3590#true} call ULTIMATE.init(); {3590#true} is VALID [2018-11-14 16:58:49,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {3590#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3590#true} is VALID [2018-11-14 16:58:49,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:49,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3590#true} {3590#true} #63#return; {3590#true} is VALID [2018-11-14 16:58:49,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {3590#true} call #t~ret4 := main(); {3590#true} is VALID [2018-11-14 16:58:49,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {3590#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3592#(= main_~i~0 0)} is VALID [2018-11-14 16:58:49,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {3592#(= main_~i~0 0)} assume true; {3592#(= main_~i~0 0)} is VALID [2018-11-14 16:58:49,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {3592#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3593#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:49,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {3593#(<= main_~i~0 1)} assume true; {3593#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:49,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {3593#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3594#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:49,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {3594#(<= main_~i~0 2)} assume true; {3594#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:49,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {3594#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3595#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:49,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {3595#(<= main_~i~0 3)} assume true; {3595#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:49,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {3595#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3596#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:49,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {3596#(<= main_~i~0 4)} assume true; {3596#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:49,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {3596#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3597#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:49,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {3597#(<= main_~i~0 5)} assume true; {3597#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:49,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {3597#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3598#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:49,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {3598#(<= main_~i~0 6)} assume true; {3598#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:49,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {3598#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3599#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:49,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {3599#(<= main_~i~0 7)} assume true; {3599#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:49,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {3599#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3600#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:49,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {3600#(<= main_~i~0 8)} assume true; {3600#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:49,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {3600#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3601#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:49,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {3601#(<= main_~i~0 9)} assume true; {3601#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:49,814 INFO L273 TraceCheckUtils]: 25: Hoare triple {3601#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3602#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:49,815 INFO L273 TraceCheckUtils]: 26: Hoare triple {3602#(<= main_~i~0 10)} assume true; {3602#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:49,816 INFO L273 TraceCheckUtils]: 27: Hoare triple {3602#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3603#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:49,817 INFO L273 TraceCheckUtils]: 28: Hoare triple {3603#(<= main_~i~0 11)} assume true; {3603#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:49,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {3603#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3604#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:49,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {3604#(<= main_~i~0 12)} assume true; {3604#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:49,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {3604#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3605#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:49,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {3605#(<= main_~i~0 13)} assume true; {3605#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:49,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {3605#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3606#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:49,821 INFO L273 TraceCheckUtils]: 34: Hoare triple {3606#(<= main_~i~0 14)} assume true; {3606#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:49,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {3606#(<= main_~i~0 14)} assume !(~i~0 < 10000); {3591#false} is VALID [2018-11-14 16:58:49,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {3591#false} ~i~0 := 1; {3591#false} is VALID [2018-11-14 16:58:49,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:49,823 INFO L273 TraceCheckUtils]: 38: Hoare triple {3591#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3591#false} is VALID [2018-11-14 16:58:49,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:49,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {3591#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3591#false} is VALID [2018-11-14 16:58:49,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:49,824 INFO L273 TraceCheckUtils]: 42: Hoare triple {3591#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3591#false} is VALID [2018-11-14 16:58:49,824 INFO L273 TraceCheckUtils]: 43: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:49,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {3591#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3591#false} is VALID [2018-11-14 16:58:49,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:49,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {3591#false} assume !(~i~0 < 10000); {3591#false} is VALID [2018-11-14 16:58:49,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {3591#false} ~i~0 := 1;~j~0 := 0; {3591#false} is VALID [2018-11-14 16:58:49,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:49,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {3591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {3591#false} is VALID [2018-11-14 16:58:49,825 INFO L256 TraceCheckUtils]: 50: Hoare triple {3591#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3591#false} is VALID [2018-11-14 16:58:49,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {3591#false} ~cond := #in~cond; {3591#false} is VALID [2018-11-14 16:58:49,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {3591#false} assume ~cond == 0; {3591#false} is VALID [2018-11-14 16:58:49,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {3591#false} assume !false; {3591#false} is VALID [2018-11-14 16:58:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 16:58:49,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:49,828 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:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:58:49,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:58:49,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:49,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:50,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {3590#true} call ULTIMATE.init(); {3590#true} is VALID [2018-11-14 16:58:50,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {3590#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3590#true} is VALID [2018-11-14 16:58:50,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3590#true} {3590#true} #63#return; {3590#true} is VALID [2018-11-14 16:58:50,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {3590#true} call #t~ret4 := main(); {3590#true} is VALID [2018-11-14 16:58:50,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {3590#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {3590#true} is VALID [2018-11-14 16:58:50,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {3590#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {3590#true} is VALID [2018-11-14 16:58:50,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-14 16:58:50,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {3590#true} assume !(~i~0 < 10000); {3590#true} is VALID [2018-11-14 16:58:50,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {3590#true} ~i~0 := 1; {3593#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:50,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {3593#(<= main_~i~0 1)} assume true; {3593#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:50,037 INFO L273 TraceCheckUtils]: 38: Hoare triple {3593#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3599#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:50,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {3599#(<= main_~i~0 7)} assume true; {3599#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:50,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {3599#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3605#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:50,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {3605#(<= main_~i~0 13)} assume true; {3605#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:50,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {3605#(<= main_~i~0 13)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3736#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:50,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {3736#(<= main_~i~0 19)} assume true; {3736#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:50,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {3736#(<= main_~i~0 19)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {3743#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:50,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {3743#(<= main_~i~0 25)} assume true; {3743#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:50,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {3743#(<= main_~i~0 25)} assume !(~i~0 < 10000); {3591#false} is VALID [2018-11-14 16:58:50,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {3591#false} ~i~0 := 1;~j~0 := 0; {3591#false} is VALID [2018-11-14 16:58:50,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {3591#false} assume true; {3591#false} is VALID [2018-11-14 16:58:50,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {3591#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {3591#false} is VALID [2018-11-14 16:58:50,045 INFO L256 TraceCheckUtils]: 50: Hoare triple {3591#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3591#false} is VALID [2018-11-14 16:58:50,045 INFO L273 TraceCheckUtils]: 51: Hoare triple {3591#false} ~cond := #in~cond; {3591#false} is VALID [2018-11-14 16:58:50,045 INFO L273 TraceCheckUtils]: 52: Hoare triple {3591#false} assume ~cond == 0; {3591#false} is VALID [2018-11-14 16:58:50,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {3591#false} assume !false; {3591#false} is VALID [2018-11-14 16:58:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 16:58:50,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:50,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 19 [2018-11-14 16:58:50,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-14 16:58:50,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:50,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:58:50,133 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:50,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:58:50,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:58:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:58:50,134 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 19 states. [2018-11-14 16:58:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:51,091 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-11-14 16:58:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:58:51,091 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-14 16:58:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:58:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 16:58:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:58:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 16:58:51,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 16:58:51,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:51,254 INFO L225 Difference]: With dead ends: 108 [2018-11-14 16:58:51,254 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 16:58:51,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:58:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 16:58:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2018-11-14 16:58:51,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:51,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 66 states. [2018-11-14 16:58:51,295 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 66 states. [2018-11-14 16:58:51,295 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 66 states. [2018-11-14 16:58:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:51,298 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-14 16:58:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-14 16:58:51,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:51,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:51,299 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 86 states. [2018-11-14 16:58:51,299 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 86 states. [2018-11-14 16:58:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:51,302 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-14 16:58:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-14 16:58:51,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:51,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:51,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:51,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 16:58:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-14 16:58:51,305 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 54 [2018-11-14 16:58:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:51,305 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-14 16:58:51,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:58:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-14 16:58:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-14 16:58:51,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:51,307 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:51,307 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:51,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1078997451, now seen corresponding path program 10 times [2018-11-14 16:58:51,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:51,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:51,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {4196#true} call ULTIMATE.init(); {4196#true} is VALID [2018-11-14 16:58:51,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {4196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4196#true} is VALID [2018-11-14 16:58:51,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {4196#true} assume true; {4196#true} is VALID [2018-11-14 16:58:51,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4196#true} {4196#true} #63#return; {4196#true} is VALID [2018-11-14 16:58:51,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {4196#true} call #t~ret4 := main(); {4196#true} is VALID [2018-11-14 16:58:51,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {4196#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4198#(= main_~i~0 0)} is VALID [2018-11-14 16:58:51,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {4198#(= main_~i~0 0)} assume true; {4198#(= main_~i~0 0)} is VALID [2018-11-14 16:58:51,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {4198#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4199#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:51,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {4199#(<= main_~i~0 1)} assume true; {4199#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:51,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {4199#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4200#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:51,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {4200#(<= main_~i~0 2)} assume true; {4200#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:51,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {4200#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4201#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:51,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {4201#(<= main_~i~0 3)} assume true; {4201#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:51,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4202#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:51,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {4202#(<= main_~i~0 4)} assume true; {4202#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:51,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {4202#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4203#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:51,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {4203#(<= main_~i~0 5)} assume true; {4203#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:51,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {4203#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4204#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:51,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {4204#(<= main_~i~0 6)} assume true; {4204#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:51,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {4204#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4205#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:51,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {4205#(<= main_~i~0 7)} assume true; {4205#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:51,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {4205#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4206#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:51,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {4206#(<= main_~i~0 8)} assume true; {4206#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:51,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {4206#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4207#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:51,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {4207#(<= main_~i~0 9)} assume true; {4207#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:51,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {4207#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4208#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:51,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {4208#(<= main_~i~0 10)} assume true; {4208#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:51,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {4208#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4209#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:51,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {4209#(<= main_~i~0 11)} assume true; {4209#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:51,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {4209#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4210#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:51,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {4210#(<= main_~i~0 12)} assume true; {4210#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:51,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {4210#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4211#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:51,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {4211#(<= main_~i~0 13)} assume true; {4211#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:51,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {4211#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4212#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:51,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {4212#(<= main_~i~0 14)} assume true; {4212#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:51,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {4212#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4213#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:51,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {4213#(<= main_~i~0 15)} assume true; {4213#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:51,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {4213#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4214#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:51,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {4214#(<= main_~i~0 16)} assume true; {4214#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:51,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {4214#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4215#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:51,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {4215#(<= main_~i~0 17)} assume true; {4215#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:51,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {4215#(<= main_~i~0 17)} assume !(~i~0 < 10000); {4197#false} is VALID [2018-11-14 16:58:51,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {4197#false} ~i~0 := 1; {4197#false} is VALID [2018-11-14 16:58:51,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:51,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:51,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:51,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:51,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:51,806 INFO L273 TraceCheckUtils]: 53: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,806 INFO L273 TraceCheckUtils]: 54: Hoare triple {4197#false} assume !(~i~0 < 10000); {4197#false} is VALID [2018-11-14 16:58:51,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {4197#false} ~i~0 := 1;~j~0 := 0; {4197#false} is VALID [2018-11-14 16:58:51,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:51,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {4197#false} is VALID [2018-11-14 16:58:51,807 INFO L256 TraceCheckUtils]: 58: Hoare triple {4197#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4197#false} is VALID [2018-11-14 16:58:51,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {4197#false} ~cond := #in~cond; {4197#false} is VALID [2018-11-14 16:58:51,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {4197#false} assume ~cond == 0; {4197#false} is VALID [2018-11-14 16:58:51,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {4197#false} assume !false; {4197#false} is VALID [2018-11-14 16:58:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:58:51,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:51,813 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:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:58:51,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:58:51,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:51,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:52,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {4196#true} call ULTIMATE.init(); {4196#true} is VALID [2018-11-14 16:58:52,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {4196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4196#true} is VALID [2018-11-14 16:58:52,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {4196#true} assume true; {4196#true} is VALID [2018-11-14 16:58:52,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4196#true} {4196#true} #63#return; {4196#true} is VALID [2018-11-14 16:58:52,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {4196#true} call #t~ret4 := main(); {4196#true} is VALID [2018-11-14 16:58:52,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {4196#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4234#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:52,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {4234#(<= main_~i~0 0)} assume true; {4234#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:52,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {4234#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4199#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:52,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {4199#(<= main_~i~0 1)} assume true; {4199#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:52,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {4199#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4200#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:52,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {4200#(<= main_~i~0 2)} assume true; {4200#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:52,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {4200#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4201#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:52,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {4201#(<= main_~i~0 3)} assume true; {4201#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:52,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4202#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:52,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {4202#(<= main_~i~0 4)} assume true; {4202#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:52,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {4202#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4203#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:52,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {4203#(<= main_~i~0 5)} assume true; {4203#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:52,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {4203#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4204#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:52,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {4204#(<= main_~i~0 6)} assume true; {4204#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:52,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {4204#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4205#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:52,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {4205#(<= main_~i~0 7)} assume true; {4205#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:52,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {4205#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4206#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:52,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {4206#(<= main_~i~0 8)} assume true; {4206#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:52,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {4206#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4207#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:52,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {4207#(<= main_~i~0 9)} assume true; {4207#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:52,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {4207#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4208#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:52,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {4208#(<= main_~i~0 10)} assume true; {4208#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:52,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {4208#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4209#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:52,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {4209#(<= main_~i~0 11)} assume true; {4209#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:52,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {4209#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4210#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:52,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {4210#(<= main_~i~0 12)} assume true; {4210#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:52,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {4210#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4211#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:52,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {4211#(<= main_~i~0 13)} assume true; {4211#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:52,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {4211#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4212#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:52,128 INFO L273 TraceCheckUtils]: 34: Hoare triple {4212#(<= main_~i~0 14)} assume true; {4212#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:52,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {4212#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4213#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:52,130 INFO L273 TraceCheckUtils]: 36: Hoare triple {4213#(<= main_~i~0 15)} assume true; {4213#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:52,130 INFO L273 TraceCheckUtils]: 37: Hoare triple {4213#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4214#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:52,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {4214#(<= main_~i~0 16)} assume true; {4214#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:52,132 INFO L273 TraceCheckUtils]: 39: Hoare triple {4214#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4215#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:52,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {4215#(<= main_~i~0 17)} assume true; {4215#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:52,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {4215#(<= main_~i~0 17)} assume !(~i~0 < 10000); {4197#false} is VALID [2018-11-14 16:58:52,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {4197#false} ~i~0 := 1; {4197#false} is VALID [2018-11-14 16:58:52,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:52,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:52,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:52,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,135 INFO L273 TraceCheckUtils]: 50: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:52,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 52: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {4197#false} assume !(~i~0 < 10000); {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {4197#false} ~i~0 := 1;~j~0 := 0; {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {4197#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L256 TraceCheckUtils]: 58: Hoare triple {4197#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4197#false} is VALID [2018-11-14 16:58:52,136 INFO L273 TraceCheckUtils]: 59: Hoare triple {4197#false} ~cond := #in~cond; {4197#false} is VALID [2018-11-14 16:58:52,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {4197#false} assume ~cond == 0; {4197#false} is VALID [2018-11-14 16:58:52,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {4197#false} assume !false; {4197#false} is VALID [2018-11-14 16:58:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:58:52,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:52,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 16:58:52,163 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-14 16:58:52,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:52,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:58:52,215 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:52,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:58:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:58:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:58:52,216 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 21 states. [2018-11-14 16:58:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:53,020 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-11-14 16:58:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:58:53,021 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-14 16:58:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:58:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2018-11-14 16:58:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:58:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2018-11-14 16:58:53,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 97 transitions. [2018-11-14 16:58:54,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:54,067 INFO L225 Difference]: With dead ends: 104 [2018-11-14 16:58:54,067 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 16:58:54,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:58:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 16:58:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-11-14 16:58:54,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:54,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 68 states. [2018-11-14 16:58:54,492 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 68 states. [2018-11-14 16:58:54,492 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 68 states. [2018-11-14 16:58:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:54,495 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-14 16:58:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 16:58:54,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:54,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:54,496 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 80 states. [2018-11-14 16:58:54,496 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 80 states. [2018-11-14 16:58:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:54,498 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-14 16:58:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 16:58:54,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:54,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:54,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:54,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:58:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-14 16:58:54,501 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 62 [2018-11-14 16:58:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:54,501 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-14 16:58:54,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:58:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-14 16:58:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-14 16:58:54,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:54,502 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:54,502 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:54,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 671589339, now seen corresponding path program 11 times [2018-11-14 16:58:54,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:54,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:54,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:55,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {4813#true} call ULTIMATE.init(); {4813#true} is VALID [2018-11-14 16:58:55,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {4813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4813#true} is VALID [2018-11-14 16:58:55,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:55,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4813#true} {4813#true} #63#return; {4813#true} is VALID [2018-11-14 16:58:55,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {4813#true} call #t~ret4 := main(); {4813#true} is VALID [2018-11-14 16:58:55,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {4813#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4815#(= main_~i~0 0)} is VALID [2018-11-14 16:58:55,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {4815#(= main_~i~0 0)} assume true; {4815#(= main_~i~0 0)} is VALID [2018-11-14 16:58:55,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {4815#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4816#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:55,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {4816#(<= main_~i~0 1)} assume true; {4816#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:55,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {4816#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4817#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:55,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {4817#(<= main_~i~0 2)} assume true; {4817#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:55,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {4817#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4818#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:55,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {4818#(<= main_~i~0 3)} assume true; {4818#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:55,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {4818#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4819#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:55,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {4819#(<= main_~i~0 4)} assume true; {4819#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:55,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {4819#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4820#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:55,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {4820#(<= main_~i~0 5)} assume true; {4820#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:55,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {4820#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4821#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:55,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {4821#(<= main_~i~0 6)} assume true; {4821#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:55,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {4821#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4822#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:55,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {4822#(<= main_~i~0 7)} assume true; {4822#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:55,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {4822#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4823#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:55,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {4823#(<= main_~i~0 8)} assume true; {4823#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:55,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {4823#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4824#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:55,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {4824#(<= main_~i~0 9)} assume true; {4824#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:55,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {4824#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4825#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:55,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {4825#(<= main_~i~0 10)} assume true; {4825#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:55,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {4825#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4826#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:55,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {4826#(<= main_~i~0 11)} assume true; {4826#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:55,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {4826#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4827#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:55,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {4827#(<= main_~i~0 12)} assume true; {4827#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:55,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {4827#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4828#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:55,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {4828#(<= main_~i~0 13)} assume true; {4828#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:55,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {4828#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4829#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:55,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {4829#(<= main_~i~0 14)} assume true; {4829#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:55,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {4829#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4830#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:55,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {4830#(<= main_~i~0 15)} assume true; {4830#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:55,243 INFO L273 TraceCheckUtils]: 37: Hoare triple {4830#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4831#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:55,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {4831#(<= main_~i~0 16)} assume true; {4831#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:55,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {4831#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4832#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:55,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {4832#(<= main_~i~0 17)} assume true; {4832#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:55,246 INFO L273 TraceCheckUtils]: 41: Hoare triple {4832#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4833#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:55,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {4833#(<= main_~i~0 18)} assume true; {4833#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:55,247 INFO L273 TraceCheckUtils]: 43: Hoare triple {4833#(<= main_~i~0 18)} assume !(~i~0 < 10000); {4814#false} is VALID [2018-11-14 16:58:55,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {4814#false} ~i~0 := 1; {4814#false} is VALID [2018-11-14 16:58:55,248 INFO L273 TraceCheckUtils]: 45: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,248 INFO L273 TraceCheckUtils]: 46: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4814#false} is VALID [2018-11-14 16:58:55,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4814#false} is VALID [2018-11-14 16:58:55,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,249 INFO L273 TraceCheckUtils]: 50: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4814#false} is VALID [2018-11-14 16:58:55,249 INFO L273 TraceCheckUtils]: 51: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4814#false} is VALID [2018-11-14 16:58:55,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 55: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 56: Hoare triple {4814#false} assume !(~i~0 < 10000); {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {4814#false} ~i~0 := 1;~j~0 := 0; {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 59: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L256 TraceCheckUtils]: 60: Hoare triple {4814#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 61: Hoare triple {4814#false} ~cond := #in~cond; {4814#false} is VALID [2018-11-14 16:58:55,250 INFO L273 TraceCheckUtils]: 62: Hoare triple {4814#false} assume ~cond == 0; {4814#false} is VALID [2018-11-14 16:58:55,251 INFO L273 TraceCheckUtils]: 63: Hoare triple {4814#false} assume !false; {4814#false} is VALID [2018-11-14 16:58:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:58:55,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:55,253 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:55,262 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:58:56,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-14 16:58:56,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:56,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:56,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {4813#true} call ULTIMATE.init(); {4813#true} is VALID [2018-11-14 16:58:56,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {4813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4813#true} is VALID [2018-11-14 16:58:56,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4813#true} {4813#true} #63#return; {4813#true} is VALID [2018-11-14 16:58:56,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {4813#true} call #t~ret4 := main(); {4813#true} is VALID [2018-11-14 16:58:56,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {4813#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {4813#true} is VALID [2018-11-14 16:58:56,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 32: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 33: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,427 INFO L273 TraceCheckUtils]: 41: Hoare triple {4813#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {4813#true} is VALID [2018-11-14 16:58:56,427 INFO L273 TraceCheckUtils]: 42: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-14 16:58:56,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {4813#true} assume !(~i~0 < 10000); {4813#true} is VALID [2018-11-14 16:58:56,427 INFO L273 TraceCheckUtils]: 44: Hoare triple {4813#true} ~i~0 := 1; {4816#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:56,428 INFO L273 TraceCheckUtils]: 45: Hoare triple {4816#(<= main_~i~0 1)} assume true; {4816#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:56,428 INFO L273 TraceCheckUtils]: 46: Hoare triple {4816#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4822#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:56,429 INFO L273 TraceCheckUtils]: 47: Hoare triple {4822#(<= main_~i~0 7)} assume true; {4822#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:56,429 INFO L273 TraceCheckUtils]: 48: Hoare triple {4822#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4828#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:56,430 INFO L273 TraceCheckUtils]: 49: Hoare triple {4828#(<= main_~i~0 13)} assume true; {4828#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:56,431 INFO L273 TraceCheckUtils]: 50: Hoare triple {4828#(<= main_~i~0 13)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4987#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:56,431 INFO L273 TraceCheckUtils]: 51: Hoare triple {4987#(<= main_~i~0 19)} assume true; {4987#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:56,432 INFO L273 TraceCheckUtils]: 52: Hoare triple {4987#(<= main_~i~0 19)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {4994#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:56,433 INFO L273 TraceCheckUtils]: 53: Hoare triple {4994#(<= main_~i~0 25)} assume true; {4994#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:56,434 INFO L273 TraceCheckUtils]: 54: Hoare triple {4994#(<= main_~i~0 25)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5001#(<= main_~i~0 31)} is VALID [2018-11-14 16:58:56,434 INFO L273 TraceCheckUtils]: 55: Hoare triple {5001#(<= main_~i~0 31)} assume true; {5001#(<= main_~i~0 31)} is VALID [2018-11-14 16:58:56,435 INFO L273 TraceCheckUtils]: 56: Hoare triple {5001#(<= main_~i~0 31)} assume !(~i~0 < 10000); {4814#false} is VALID [2018-11-14 16:58:56,435 INFO L273 TraceCheckUtils]: 57: Hoare triple {4814#false} ~i~0 := 1;~j~0 := 0; {4814#false} is VALID [2018-11-14 16:58:56,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-14 16:58:56,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {4814#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {4814#false} is VALID [2018-11-14 16:58:56,436 INFO L256 TraceCheckUtils]: 60: Hoare triple {4814#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4814#false} is VALID [2018-11-14 16:58:56,436 INFO L273 TraceCheckUtils]: 61: Hoare triple {4814#false} ~cond := #in~cond; {4814#false} is VALID [2018-11-14 16:58:56,436 INFO L273 TraceCheckUtils]: 62: Hoare triple {4814#false} assume ~cond == 0; {4814#false} is VALID [2018-11-14 16:58:56,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {4814#false} assume !false; {4814#false} is VALID [2018-11-14 16:58:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-14 16:58:56,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:56,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8] total 24 [2018-11-14 16:58:56,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-11-14 16:58:56,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:56,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:58:56,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:56,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:58:56,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:58:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:58:56,529 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 24 states. [2018-11-14 16:58:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:57,127 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-11-14 16:58:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 16:58:57,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-11-14 16:58:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:58:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-14 16:58:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:58:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-14 16:58:57,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 130 transitions. [2018-11-14 16:58:57,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:57,253 INFO L225 Difference]: With dead ends: 126 [2018-11-14 16:58:57,253 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 16:58:57,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:58:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 16:58:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2018-11-14 16:58:57,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:57,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 78 states. [2018-11-14 16:58:57,426 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 78 states. [2018-11-14 16:58:57,426 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 78 states. [2018-11-14 16:58:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:57,429 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 16:58:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-14 16:58:57,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:57,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:57,429 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 102 states. [2018-11-14 16:58:57,429 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 102 states. [2018-11-14 16:58:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:57,431 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 16:58:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-14 16:58:57,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:57,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:57,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:57,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 16:58:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-14 16:58:57,433 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 64 [2018-11-14 16:58:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:57,434 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-14 16:58:57,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:58:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-14 16:58:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 16:58:57,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:57,435 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:57,435 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:57,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -758507507, now seen corresponding path program 12 times [2018-11-14 16:58:57,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:57,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:58,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {5531#true} call ULTIMATE.init(); {5531#true} is VALID [2018-11-14 16:58:58,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {5531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5531#true} is VALID [2018-11-14 16:58:58,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5531#true} {5531#true} #63#return; {5531#true} is VALID [2018-11-14 16:58:58,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {5531#true} call #t~ret4 := main(); {5531#true} is VALID [2018-11-14 16:58:58,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {5531#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {5533#(= main_~i~0 0)} is VALID [2018-11-14 16:58:58,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {5533#(= main_~i~0 0)} assume true; {5533#(= main_~i~0 0)} is VALID [2018-11-14 16:58:58,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {5533#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5534#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:58,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {5534#(<= main_~i~0 1)} assume true; {5534#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:58,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {5534#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5535#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:58,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {5535#(<= main_~i~0 2)} assume true; {5535#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:58,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {5535#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5536#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:58,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {5536#(<= main_~i~0 3)} assume true; {5536#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:58,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {5536#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5537#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:58,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {5537#(<= main_~i~0 4)} assume true; {5537#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:58,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {5537#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5538#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:58,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {5538#(<= main_~i~0 5)} assume true; {5538#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:58,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {5538#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5539#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:58,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {5539#(<= main_~i~0 6)} assume true; {5539#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:58,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {5539#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5540#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:58,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {5540#(<= main_~i~0 7)} assume true; {5540#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:58,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {5540#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5541#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:58,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {5541#(<= main_~i~0 8)} assume true; {5541#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:58,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {5541#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5542#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:58,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {5542#(<= main_~i~0 9)} assume true; {5542#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:58,185 INFO L273 TraceCheckUtils]: 25: Hoare triple {5542#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5543#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:58,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {5543#(<= main_~i~0 10)} assume true; {5543#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:58,187 INFO L273 TraceCheckUtils]: 27: Hoare triple {5543#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5544#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:58,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {5544#(<= main_~i~0 11)} assume true; {5544#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:58,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {5544#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5545#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:58,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {5545#(<= main_~i~0 12)} assume true; {5545#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:58,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {5545#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5546#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:58,191 INFO L273 TraceCheckUtils]: 32: Hoare triple {5546#(<= main_~i~0 13)} assume true; {5546#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:58,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {5546#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5547#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:58,192 INFO L273 TraceCheckUtils]: 34: Hoare triple {5547#(<= main_~i~0 14)} assume true; {5547#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:58,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {5547#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5548#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:58,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {5548#(<= main_~i~0 15)} assume true; {5548#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:58,195 INFO L273 TraceCheckUtils]: 37: Hoare triple {5548#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5549#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:58,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {5549#(<= main_~i~0 16)} assume true; {5549#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:58,196 INFO L273 TraceCheckUtils]: 39: Hoare triple {5549#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5550#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:58,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {5550#(<= main_~i~0 17)} assume true; {5550#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:58,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {5550#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5551#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:58,198 INFO L273 TraceCheckUtils]: 42: Hoare triple {5551#(<= main_~i~0 18)} assume true; {5551#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:58,199 INFO L273 TraceCheckUtils]: 43: Hoare triple {5551#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5552#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:58,200 INFO L273 TraceCheckUtils]: 44: Hoare triple {5552#(<= main_~i~0 19)} assume true; {5552#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:58,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {5552#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5553#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:58,201 INFO L273 TraceCheckUtils]: 46: Hoare triple {5553#(<= main_~i~0 20)} assume true; {5553#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:58,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {5553#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5554#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:58,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {5554#(<= main_~i~0 21)} assume true; {5554#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:58,204 INFO L273 TraceCheckUtils]: 49: Hoare triple {5554#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5555#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:58,205 INFO L273 TraceCheckUtils]: 50: Hoare triple {5555#(<= main_~i~0 22)} assume true; {5555#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:58,205 INFO L273 TraceCheckUtils]: 51: Hoare triple {5555#(<= main_~i~0 22)} assume !(~i~0 < 10000); {5532#false} is VALID [2018-11-14 16:58:58,205 INFO L273 TraceCheckUtils]: 52: Hoare triple {5532#false} ~i~0 := 1; {5532#false} is VALID [2018-11-14 16:58:58,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,206 INFO L273 TraceCheckUtils]: 54: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5532#false} is VALID [2018-11-14 16:58:58,206 INFO L273 TraceCheckUtils]: 55: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,206 INFO L273 TraceCheckUtils]: 56: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5532#false} is VALID [2018-11-14 16:58:58,206 INFO L273 TraceCheckUtils]: 57: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,207 INFO L273 TraceCheckUtils]: 58: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5532#false} is VALID [2018-11-14 16:58:58,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5532#false} is VALID [2018-11-14 16:58:58,207 INFO L273 TraceCheckUtils]: 61: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5532#false} is VALID [2018-11-14 16:58:58,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 64: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 65: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 66: Hoare triple {5532#false} assume !(~i~0 < 10000); {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 67: Hoare triple {5532#false} ~i~0 := 1;~j~0 := 0; {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L256 TraceCheckUtils]: 70: Hoare triple {5532#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5532#false} is VALID [2018-11-14 16:58:58,208 INFO L273 TraceCheckUtils]: 71: Hoare triple {5532#false} ~cond := #in~cond; {5532#false} is VALID [2018-11-14 16:58:58,209 INFO L273 TraceCheckUtils]: 72: Hoare triple {5532#false} assume ~cond == 0; {5532#false} is VALID [2018-11-14 16:58:58,209 INFO L273 TraceCheckUtils]: 73: Hoare triple {5532#false} assume !false; {5532#false} is VALID [2018-11-14 16:58:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-14 16:58:58,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:58,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:58,220 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:58:58,486 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 16:58:58,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:58,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:58,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {5531#true} call ULTIMATE.init(); {5531#true} is VALID [2018-11-14 16:58:58,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {5531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5531#true} is VALID [2018-11-14 16:58:58,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5531#true} {5531#true} #63#return; {5531#true} is VALID [2018-11-14 16:58:58,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {5531#true} call #t~ret4 := main(); {5531#true} is VALID [2018-11-14 16:58:58,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {5531#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {5531#true} is VALID [2018-11-14 16:58:58,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 32: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 48: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {5531#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-14 16:58:58,760 INFO L273 TraceCheckUtils]: 51: Hoare triple {5531#true} assume !(~i~0 < 10000); {5531#true} is VALID [2018-11-14 16:58:58,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {5531#true} ~i~0 := 1; {5534#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:58,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {5534#(<= main_~i~0 1)} assume true; {5534#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:58,762 INFO L273 TraceCheckUtils]: 54: Hoare triple {5534#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5540#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:58,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {5540#(<= main_~i~0 7)} assume true; {5540#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:58,763 INFO L273 TraceCheckUtils]: 56: Hoare triple {5540#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5546#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:58,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {5546#(<= main_~i~0 13)} assume true; {5546#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:58,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {5546#(<= main_~i~0 13)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5552#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:58,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {5552#(<= main_~i~0 19)} assume true; {5552#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:58,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {5552#(<= main_~i~0 19)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5739#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:58,766 INFO L273 TraceCheckUtils]: 61: Hoare triple {5739#(<= main_~i~0 25)} assume true; {5739#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:58,767 INFO L273 TraceCheckUtils]: 62: Hoare triple {5739#(<= main_~i~0 25)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5746#(<= main_~i~0 31)} is VALID [2018-11-14 16:58:58,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {5746#(<= main_~i~0 31)} assume true; {5746#(<= main_~i~0 31)} is VALID [2018-11-14 16:58:58,769 INFO L273 TraceCheckUtils]: 64: Hoare triple {5746#(<= main_~i~0 31)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {5753#(<= main_~i~0 37)} is VALID [2018-11-14 16:58:58,769 INFO L273 TraceCheckUtils]: 65: Hoare triple {5753#(<= main_~i~0 37)} assume true; {5753#(<= main_~i~0 37)} is VALID [2018-11-14 16:58:58,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {5753#(<= main_~i~0 37)} assume !(~i~0 < 10000); {5532#false} is VALID [2018-11-14 16:58:58,770 INFO L273 TraceCheckUtils]: 67: Hoare triple {5532#false} ~i~0 := 1;~j~0 := 0; {5532#false} is VALID [2018-11-14 16:58:58,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-14 16:58:58,771 INFO L273 TraceCheckUtils]: 69: Hoare triple {5532#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {5532#false} is VALID [2018-11-14 16:58:58,771 INFO L256 TraceCheckUtils]: 70: Hoare triple {5532#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5532#false} is VALID [2018-11-14 16:58:58,771 INFO L273 TraceCheckUtils]: 71: Hoare triple {5532#false} ~cond := #in~cond; {5532#false} is VALID [2018-11-14 16:58:58,771 INFO L273 TraceCheckUtils]: 72: Hoare triple {5532#false} assume ~cond == 0; {5532#false} is VALID [2018-11-14 16:58:58,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {5532#false} assume !false; {5532#false} is VALID [2018-11-14 16:58:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 16:58:58,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:58,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9] total 28 [2018-11-14 16:58:58,795 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-11-14 16:58:58,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:58,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 16:58:58,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:58,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 16:58:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 16:58:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:58:58,877 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 28 states. [2018-11-14 16:58:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:59,909 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2018-11-14 16:58:59,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 16:58:59,909 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-11-14 16:58:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:58:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 145 transitions. [2018-11-14 16:58:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:58:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 145 transitions. [2018-11-14 16:58:59,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 145 transitions. [2018-11-14 16:59:00,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:00,414 INFO L225 Difference]: With dead ends: 142 [2018-11-14 16:59:00,415 INFO L226 Difference]: Without dead ends: 116 [2018-11-14 16:59:00,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:59:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-14 16:59:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2018-11-14 16:59:00,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:00,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 88 states. [2018-11-14 16:59:00,476 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 88 states. [2018-11-14 16:59:00,476 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 88 states. [2018-11-14 16:59:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:00,480 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-11-14 16:59:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-11-14 16:59:00,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:00,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:00,481 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 116 states. [2018-11-14 16:59:00,481 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 116 states. [2018-11-14 16:59:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:00,484 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-11-14 16:59:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-11-14 16:59:00,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:00,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:00,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:00,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 16:59:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-11-14 16:59:00,488 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 74 [2018-11-14 16:59:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:00,488 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-14 16:59:00,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 16:59:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-11-14 16:59:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-14 16:59:00,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:00,489 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:00,490 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:00,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -242931265, now seen corresponding path program 13 times [2018-11-14 16:59:00,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:00,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:01,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {6350#true} call ULTIMATE.init(); {6350#true} is VALID [2018-11-14 16:59:01,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {6350#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6350#true} is VALID [2018-11-14 16:59:01,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {6350#true} assume true; {6350#true} is VALID [2018-11-14 16:59:01,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6350#true} {6350#true} #63#return; {6350#true} is VALID [2018-11-14 16:59:01,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {6350#true} call #t~ret4 := main(); {6350#true} is VALID [2018-11-14 16:59:01,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {6350#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {6352#(= main_~i~0 0)} is VALID [2018-11-14 16:59:01,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {6352#(= main_~i~0 0)} assume true; {6352#(= main_~i~0 0)} is VALID [2018-11-14 16:59:01,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {6352#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6353#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:01,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {6353#(<= main_~i~0 1)} assume true; {6353#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:01,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {6353#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6354#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:01,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {6354#(<= main_~i~0 2)} assume true; {6354#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:01,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {6354#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6355#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:01,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {6355#(<= main_~i~0 3)} assume true; {6355#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:01,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {6355#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6356#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:01,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {6356#(<= main_~i~0 4)} assume true; {6356#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:01,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {6356#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6357#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:01,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {6357#(<= main_~i~0 5)} assume true; {6357#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:01,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {6357#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6358#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:01,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {6358#(<= main_~i~0 6)} assume true; {6358#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:01,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {6358#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6359#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:01,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {6359#(<= main_~i~0 7)} assume true; {6359#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:01,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {6359#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6360#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:01,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {6360#(<= main_~i~0 8)} assume true; {6360#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:01,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {6360#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6361#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:01,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {6361#(<= main_~i~0 9)} assume true; {6361#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:01,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {6361#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6362#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:01,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {6362#(<= main_~i~0 10)} assume true; {6362#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:01,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {6362#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6363#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:01,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {6363#(<= main_~i~0 11)} assume true; {6363#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:01,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {6363#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6364#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:01,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {6364#(<= main_~i~0 12)} assume true; {6364#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:01,179 INFO L273 TraceCheckUtils]: 31: Hoare triple {6364#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6365#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:01,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {6365#(<= main_~i~0 13)} assume true; {6365#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:01,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {6365#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6366#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:01,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {6366#(<= main_~i~0 14)} assume true; {6366#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:01,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {6366#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6367#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:01,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {6367#(<= main_~i~0 15)} assume true; {6367#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:01,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {6367#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6368#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:01,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {6368#(<= main_~i~0 16)} assume true; {6368#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:01,185 INFO L273 TraceCheckUtils]: 39: Hoare triple {6368#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6369#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:01,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {6369#(<= main_~i~0 17)} assume true; {6369#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:01,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {6369#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6370#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:01,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {6370#(<= main_~i~0 18)} assume true; {6370#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:01,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {6370#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6371#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:01,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {6371#(<= main_~i~0 19)} assume true; {6371#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:01,189 INFO L273 TraceCheckUtils]: 45: Hoare triple {6371#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6372#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:01,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {6372#(<= main_~i~0 20)} assume true; {6372#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:01,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {6372#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6373#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:01,191 INFO L273 TraceCheckUtils]: 48: Hoare triple {6373#(<= main_~i~0 21)} assume true; {6373#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:01,193 INFO L273 TraceCheckUtils]: 49: Hoare triple {6373#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6374#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:01,193 INFO L273 TraceCheckUtils]: 50: Hoare triple {6374#(<= main_~i~0 22)} assume true; {6374#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:01,194 INFO L273 TraceCheckUtils]: 51: Hoare triple {6374#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6375#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:01,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {6375#(<= main_~i~0 23)} assume true; {6375#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:01,196 INFO L273 TraceCheckUtils]: 53: Hoare triple {6375#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6376#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:01,196 INFO L273 TraceCheckUtils]: 54: Hoare triple {6376#(<= main_~i~0 24)} assume true; {6376#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:01,197 INFO L273 TraceCheckUtils]: 55: Hoare triple {6376#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6377#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:01,198 INFO L273 TraceCheckUtils]: 56: Hoare triple {6377#(<= main_~i~0 25)} assume true; {6377#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:01,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {6377#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6378#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:01,199 INFO L273 TraceCheckUtils]: 58: Hoare triple {6378#(<= main_~i~0 26)} assume true; {6378#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:01,200 INFO L273 TraceCheckUtils]: 59: Hoare triple {6378#(<= main_~i~0 26)} assume !(~i~0 < 10000); {6351#false} is VALID [2018-11-14 16:59:01,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {6351#false} ~i~0 := 1; {6351#false} is VALID [2018-11-14 16:59:01,200 INFO L273 TraceCheckUtils]: 61: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,201 INFO L273 TraceCheckUtils]: 62: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,201 INFO L273 TraceCheckUtils]: 63: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,201 INFO L273 TraceCheckUtils]: 64: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,201 INFO L273 TraceCheckUtils]: 65: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,202 INFO L273 TraceCheckUtils]: 67: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,202 INFO L273 TraceCheckUtils]: 68: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,202 INFO L273 TraceCheckUtils]: 69: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,202 INFO L273 TraceCheckUtils]: 70: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,202 INFO L273 TraceCheckUtils]: 71: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,203 INFO L273 TraceCheckUtils]: 72: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,203 INFO L273 TraceCheckUtils]: 73: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,203 INFO L273 TraceCheckUtils]: 74: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,203 INFO L273 TraceCheckUtils]: 75: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,204 INFO L273 TraceCheckUtils]: 76: Hoare triple {6351#false} assume !(~i~0 < 10000); {6351#false} is VALID [2018-11-14 16:59:01,204 INFO L273 TraceCheckUtils]: 77: Hoare triple {6351#false} ~i~0 := 1;~j~0 := 0; {6351#false} is VALID [2018-11-14 16:59:01,204 INFO L273 TraceCheckUtils]: 78: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,204 INFO L273 TraceCheckUtils]: 79: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {6351#false} is VALID [2018-11-14 16:59:01,204 INFO L256 TraceCheckUtils]: 80: Hoare triple {6351#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6351#false} is VALID [2018-11-14 16:59:01,205 INFO L273 TraceCheckUtils]: 81: Hoare triple {6351#false} ~cond := #in~cond; {6351#false} is VALID [2018-11-14 16:59:01,205 INFO L273 TraceCheckUtils]: 82: Hoare triple {6351#false} assume ~cond == 0; {6351#false} is VALID [2018-11-14 16:59:01,205 INFO L273 TraceCheckUtils]: 83: Hoare triple {6351#false} assume !false; {6351#false} is VALID [2018-11-14 16:59:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 16:59:01,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:01,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:59:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:01,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:01,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {6350#true} call ULTIMATE.init(); {6350#true} is VALID [2018-11-14 16:59:01,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {6350#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6350#true} is VALID [2018-11-14 16:59:01,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {6350#true} assume true; {6350#true} is VALID [2018-11-14 16:59:01,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6350#true} {6350#true} #63#return; {6350#true} is VALID [2018-11-14 16:59:01,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {6350#true} call #t~ret4 := main(); {6350#true} is VALID [2018-11-14 16:59:01,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {6350#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {6397#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:01,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {6397#(<= main_~i~0 0)} assume true; {6397#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:01,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {6397#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6353#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:01,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {6353#(<= main_~i~0 1)} assume true; {6353#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:01,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {6353#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6354#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:01,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {6354#(<= main_~i~0 2)} assume true; {6354#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:01,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {6354#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6355#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:01,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {6355#(<= main_~i~0 3)} assume true; {6355#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:01,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {6355#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6356#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:01,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {6356#(<= main_~i~0 4)} assume true; {6356#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:01,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {6356#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6357#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:01,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {6357#(<= main_~i~0 5)} assume true; {6357#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:01,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {6357#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6358#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:01,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {6358#(<= main_~i~0 6)} assume true; {6358#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:01,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {6358#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6359#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:01,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {6359#(<= main_~i~0 7)} assume true; {6359#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:01,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {6359#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6360#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:01,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {6360#(<= main_~i~0 8)} assume true; {6360#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:01,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {6360#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6361#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:01,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {6361#(<= main_~i~0 9)} assume true; {6361#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:01,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {6361#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6362#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:01,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {6362#(<= main_~i~0 10)} assume true; {6362#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:01,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {6362#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6363#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:01,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {6363#(<= main_~i~0 11)} assume true; {6363#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:01,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {6363#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6364#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:01,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {6364#(<= main_~i~0 12)} assume true; {6364#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:01,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {6364#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6365#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:01,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {6365#(<= main_~i~0 13)} assume true; {6365#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:01,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {6365#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6366#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:01,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {6366#(<= main_~i~0 14)} assume true; {6366#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:01,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {6366#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6367#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:01,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {6367#(<= main_~i~0 15)} assume true; {6367#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:01,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {6367#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6368#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:01,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {6368#(<= main_~i~0 16)} assume true; {6368#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:01,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {6368#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6369#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:01,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {6369#(<= main_~i~0 17)} assume true; {6369#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:01,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {6369#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6370#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:01,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {6370#(<= main_~i~0 18)} assume true; {6370#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:01,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {6370#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6371#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:01,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {6371#(<= main_~i~0 19)} assume true; {6371#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:01,606 INFO L273 TraceCheckUtils]: 45: Hoare triple {6371#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6372#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:01,606 INFO L273 TraceCheckUtils]: 46: Hoare triple {6372#(<= main_~i~0 20)} assume true; {6372#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:01,607 INFO L273 TraceCheckUtils]: 47: Hoare triple {6372#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6373#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:01,608 INFO L273 TraceCheckUtils]: 48: Hoare triple {6373#(<= main_~i~0 21)} assume true; {6373#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:01,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {6373#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6374#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:01,609 INFO L273 TraceCheckUtils]: 50: Hoare triple {6374#(<= main_~i~0 22)} assume true; {6374#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:01,610 INFO L273 TraceCheckUtils]: 51: Hoare triple {6374#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6375#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:01,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {6375#(<= main_~i~0 23)} assume true; {6375#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:01,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {6375#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6376#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:01,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {6376#(<= main_~i~0 24)} assume true; {6376#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:01,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {6376#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6377#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:01,614 INFO L273 TraceCheckUtils]: 56: Hoare triple {6377#(<= main_~i~0 25)} assume true; {6377#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:01,615 INFO L273 TraceCheckUtils]: 57: Hoare triple {6377#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {6378#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:01,616 INFO L273 TraceCheckUtils]: 58: Hoare triple {6378#(<= main_~i~0 26)} assume true; {6378#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:01,616 INFO L273 TraceCheckUtils]: 59: Hoare triple {6378#(<= main_~i~0 26)} assume !(~i~0 < 10000); {6351#false} is VALID [2018-11-14 16:59:01,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {6351#false} ~i~0 := 1; {6351#false} is VALID [2018-11-14 16:59:01,617 INFO L273 TraceCheckUtils]: 61: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,617 INFO L273 TraceCheckUtils]: 63: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,618 INFO L273 TraceCheckUtils]: 65: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,618 INFO L273 TraceCheckUtils]: 69: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 71: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 74: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 75: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 76: Hoare triple {6351#false} assume !(~i~0 < 10000); {6351#false} is VALID [2018-11-14 16:59:01,619 INFO L273 TraceCheckUtils]: 77: Hoare triple {6351#false} ~i~0 := 1;~j~0 := 0; {6351#false} is VALID [2018-11-14 16:59:01,620 INFO L273 TraceCheckUtils]: 78: Hoare triple {6351#false} assume true; {6351#false} is VALID [2018-11-14 16:59:01,620 INFO L273 TraceCheckUtils]: 79: Hoare triple {6351#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {6351#false} is VALID [2018-11-14 16:59:01,620 INFO L256 TraceCheckUtils]: 80: Hoare triple {6351#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6351#false} is VALID [2018-11-14 16:59:01,620 INFO L273 TraceCheckUtils]: 81: Hoare triple {6351#false} ~cond := #in~cond; {6351#false} is VALID [2018-11-14 16:59:01,620 INFO L273 TraceCheckUtils]: 82: Hoare triple {6351#false} assume ~cond == 0; {6351#false} is VALID [2018-11-14 16:59:01,620 INFO L273 TraceCheckUtils]: 83: Hoare triple {6351#false} assume !false; {6351#false} is VALID [2018-11-14 16:59:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 16:59:01,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:01,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 16:59:01,646 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2018-11-14 16:59:01,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:01,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 16:59:01,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:01,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 16:59:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 16:59:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:59:01,726 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 30 states. [2018-11-14 16:59:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,280 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-11-14 16:59:03,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 16:59:03,280 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2018-11-14 16:59:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:59:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 129 transitions. [2018-11-14 16:59:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:59:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 129 transitions. [2018-11-14 16:59:03,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 129 transitions. [2018-11-14 16:59:03,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:03,407 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:59:03,408 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 16:59:03,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:59:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 16:59:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-11-14 16:59:03,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:03,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 90 states. [2018-11-14 16:59:03,448 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 90 states. [2018-11-14 16:59:03,448 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 90 states. [2018-11-14 16:59:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,451 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-11-14 16:59:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-14 16:59:03,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:03,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:03,452 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 110 states. [2018-11-14 16:59:03,452 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 110 states. [2018-11-14 16:59:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:03,454 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-11-14 16:59:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-14 16:59:03,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:03,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:03,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:03,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 16:59:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-11-14 16:59:03,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 84 [2018-11-14 16:59:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:03,457 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-11-14 16:59:03,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 16:59:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-14 16:59:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-14 16:59:03,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:03,459 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:03,459 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:03,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash -817324315, now seen corresponding path program 14 times [2018-11-14 16:59:03,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:03,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:03,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:05,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2018-11-14 16:59:05,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {7186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7186#true} is VALID [2018-11-14 16:59:05,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {7186#true} assume true; {7186#true} is VALID [2018-11-14 16:59:05,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7186#true} {7186#true} #63#return; {7186#true} is VALID [2018-11-14 16:59:05,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {7186#true} call #t~ret4 := main(); {7186#true} is VALID [2018-11-14 16:59:05,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {7186#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {7188#(= main_~i~0 0)} is VALID [2018-11-14 16:59:05,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {7188#(= main_~i~0 0)} assume true; {7188#(= main_~i~0 0)} is VALID [2018-11-14 16:59:05,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {7188#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7189#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {7189#(<= main_~i~0 1)} assume true; {7189#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {7189#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7190#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:05,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {7190#(<= main_~i~0 2)} assume true; {7190#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:05,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {7190#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7191#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:05,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {7191#(<= main_~i~0 3)} assume true; {7191#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:05,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {7191#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7192#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:05,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {7192#(<= main_~i~0 4)} assume true; {7192#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:05,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {7192#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7193#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:05,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {7193#(<= main_~i~0 5)} assume true; {7193#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:05,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {7193#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7194#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:05,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {7194#(<= main_~i~0 6)} assume true; {7194#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:05,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {7194#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7195#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:05,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {7195#(<= main_~i~0 7)} assume true; {7195#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:05,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {7195#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7196#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:05,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {7196#(<= main_~i~0 8)} assume true; {7196#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:05,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {7196#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7197#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:05,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {7197#(<= main_~i~0 9)} assume true; {7197#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:05,200 INFO L273 TraceCheckUtils]: 25: Hoare triple {7197#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7198#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:05,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {7198#(<= main_~i~0 10)} assume true; {7198#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:05,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {7198#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7199#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:05,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {7199#(<= main_~i~0 11)} assume true; {7199#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:05,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {7199#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7200#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:05,204 INFO L273 TraceCheckUtils]: 30: Hoare triple {7200#(<= main_~i~0 12)} assume true; {7200#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:05,205 INFO L273 TraceCheckUtils]: 31: Hoare triple {7200#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7201#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:05,205 INFO L273 TraceCheckUtils]: 32: Hoare triple {7201#(<= main_~i~0 13)} assume true; {7201#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:05,206 INFO L273 TraceCheckUtils]: 33: Hoare triple {7201#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7202#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:05,207 INFO L273 TraceCheckUtils]: 34: Hoare triple {7202#(<= main_~i~0 14)} assume true; {7202#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:05,208 INFO L273 TraceCheckUtils]: 35: Hoare triple {7202#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7203#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:05,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {7203#(<= main_~i~0 15)} assume true; {7203#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:05,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {7203#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7204#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:05,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {7204#(<= main_~i~0 16)} assume true; {7204#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:05,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {7204#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7205#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:05,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {7205#(<= main_~i~0 17)} assume true; {7205#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:05,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {7205#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7206#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:05,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {7206#(<= main_~i~0 18)} assume true; {7206#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:05,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {7206#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7207#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:05,231 INFO L273 TraceCheckUtils]: 44: Hoare triple {7207#(<= main_~i~0 19)} assume true; {7207#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:05,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {7207#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7208#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:05,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {7208#(<= main_~i~0 20)} assume true; {7208#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:05,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {7208#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7209#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:05,234 INFO L273 TraceCheckUtils]: 48: Hoare triple {7209#(<= main_~i~0 21)} assume true; {7209#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:05,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {7209#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7210#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:05,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {7210#(<= main_~i~0 22)} assume true; {7210#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:05,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {7210#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7211#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:05,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {7211#(<= main_~i~0 23)} assume true; {7211#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:05,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {7211#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7212#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:05,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {7212#(<= main_~i~0 24)} assume true; {7212#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:05,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {7212#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7213#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:05,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {7213#(<= main_~i~0 25)} assume true; {7213#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:05,242 INFO L273 TraceCheckUtils]: 57: Hoare triple {7213#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7214#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:05,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {7214#(<= main_~i~0 26)} assume true; {7214#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:05,243 INFO L273 TraceCheckUtils]: 59: Hoare triple {7214#(<= main_~i~0 26)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7215#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:05,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {7215#(<= main_~i~0 27)} assume true; {7215#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:05,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {7215#(<= main_~i~0 27)} assume !(~i~0 < 10000); {7187#false} is VALID [2018-11-14 16:59:05,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {7187#false} ~i~0 := 1; {7187#false} is VALID [2018-11-14 16:59:05,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,245 INFO L273 TraceCheckUtils]: 64: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,246 INFO L273 TraceCheckUtils]: 68: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,246 INFO L273 TraceCheckUtils]: 69: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 74: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 75: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 76: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,247 INFO L273 TraceCheckUtils]: 78: Hoare triple {7187#false} assume !(~i~0 < 10000); {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L273 TraceCheckUtils]: 79: Hoare triple {7187#false} ~i~0 := 1;~j~0 := 0; {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L273 TraceCheckUtils]: 80: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L256 TraceCheckUtils]: 82: Hoare triple {7187#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L273 TraceCheckUtils]: 83: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L273 TraceCheckUtils]: 84: Hoare triple {7187#false} assume ~cond == 0; {7187#false} is VALID [2018-11-14 16:59:05,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2018-11-14 16:59:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 16:59:05,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:05,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:59:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:59:05,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:59:05,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:05,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:05,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2018-11-14 16:59:05,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {7186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7186#true} is VALID [2018-11-14 16:59:05,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {7186#true} assume true; {7186#true} is VALID [2018-11-14 16:59:05,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7186#true} {7186#true} #63#return; {7186#true} is VALID [2018-11-14 16:59:05,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {7186#true} call #t~ret4 := main(); {7186#true} is VALID [2018-11-14 16:59:05,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {7186#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {7234#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:05,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {7234#(<= main_~i~0 0)} assume true; {7234#(<= main_~i~0 0)} is VALID [2018-11-14 16:59:05,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {7234#(<= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7189#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {7189#(<= main_~i~0 1)} assume true; {7189#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:05,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {7189#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7190#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:05,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {7190#(<= main_~i~0 2)} assume true; {7190#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:05,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {7190#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7191#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:05,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {7191#(<= main_~i~0 3)} assume true; {7191#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:05,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {7191#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7192#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:05,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {7192#(<= main_~i~0 4)} assume true; {7192#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:05,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {7192#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7193#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:05,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {7193#(<= main_~i~0 5)} assume true; {7193#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:05,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {7193#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7194#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:05,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {7194#(<= main_~i~0 6)} assume true; {7194#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:05,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {7194#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7195#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:05,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {7195#(<= main_~i~0 7)} assume true; {7195#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:05,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {7195#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7196#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:05,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {7196#(<= main_~i~0 8)} assume true; {7196#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:05,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {7196#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7197#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:05,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {7197#(<= main_~i~0 9)} assume true; {7197#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:05,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {7197#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7198#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:05,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {7198#(<= main_~i~0 10)} assume true; {7198#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:05,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {7198#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7199#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:05,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {7199#(<= main_~i~0 11)} assume true; {7199#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:05,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {7199#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7200#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:05,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {7200#(<= main_~i~0 12)} assume true; {7200#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:05,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {7200#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7201#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:05,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {7201#(<= main_~i~0 13)} assume true; {7201#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:05,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {7201#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7202#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:05,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {7202#(<= main_~i~0 14)} assume true; {7202#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:05,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {7202#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7203#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:05,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {7203#(<= main_~i~0 15)} assume true; {7203#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:05,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {7203#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7204#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:05,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {7204#(<= main_~i~0 16)} assume true; {7204#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:05,769 INFO L273 TraceCheckUtils]: 39: Hoare triple {7204#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7205#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:05,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {7205#(<= main_~i~0 17)} assume true; {7205#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:05,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {7205#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7206#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:05,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {7206#(<= main_~i~0 18)} assume true; {7206#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:05,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {7206#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7207#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:05,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {7207#(<= main_~i~0 19)} assume true; {7207#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:05,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {7207#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7208#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:05,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {7208#(<= main_~i~0 20)} assume true; {7208#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:05,791 INFO L273 TraceCheckUtils]: 47: Hoare triple {7208#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7209#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:05,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {7209#(<= main_~i~0 21)} assume true; {7209#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:05,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {7209#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7210#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:05,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {7210#(<= main_~i~0 22)} assume true; {7210#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:05,827 INFO L273 TraceCheckUtils]: 51: Hoare triple {7210#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7211#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:05,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {7211#(<= main_~i~0 23)} assume true; {7211#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:05,828 INFO L273 TraceCheckUtils]: 53: Hoare triple {7211#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7212#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:05,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {7212#(<= main_~i~0 24)} assume true; {7212#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:05,829 INFO L273 TraceCheckUtils]: 55: Hoare triple {7212#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7213#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:05,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {7213#(<= main_~i~0 25)} assume true; {7213#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:05,829 INFO L273 TraceCheckUtils]: 57: Hoare triple {7213#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7214#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:05,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {7214#(<= main_~i~0 26)} assume true; {7214#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:05,830 INFO L273 TraceCheckUtils]: 59: Hoare triple {7214#(<= main_~i~0 26)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {7215#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:05,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {7215#(<= main_~i~0 27)} assume true; {7215#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:05,831 INFO L273 TraceCheckUtils]: 61: Hoare triple {7215#(<= main_~i~0 27)} assume !(~i~0 < 10000); {7187#false} is VALID [2018-11-14 16:59:05,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {7187#false} ~i~0 := 1; {7187#false} is VALID [2018-11-14 16:59:05,831 INFO L273 TraceCheckUtils]: 63: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,831 INFO L273 TraceCheckUtils]: 64: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,832 INFO L273 TraceCheckUtils]: 65: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,832 INFO L273 TraceCheckUtils]: 66: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,832 INFO L273 TraceCheckUtils]: 69: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,833 INFO L273 TraceCheckUtils]: 70: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,833 INFO L273 TraceCheckUtils]: 71: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,833 INFO L273 TraceCheckUtils]: 72: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,833 INFO L273 TraceCheckUtils]: 73: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,833 INFO L273 TraceCheckUtils]: 74: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 75: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 76: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 77: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 78: Hoare triple {7187#false} assume !(~i~0 < 10000); {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 79: Hoare triple {7187#false} ~i~0 := 1;~j~0 := 0; {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 80: Hoare triple {7187#false} assume true; {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L273 TraceCheckUtils]: 81: Hoare triple {7187#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {7187#false} is VALID [2018-11-14 16:59:05,834 INFO L256 TraceCheckUtils]: 82: Hoare triple {7187#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7187#false} is VALID [2018-11-14 16:59:05,835 INFO L273 TraceCheckUtils]: 83: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2018-11-14 16:59:05,835 INFO L273 TraceCheckUtils]: 84: Hoare triple {7187#false} assume ~cond == 0; {7187#false} is VALID [2018-11-14 16:59:05,835 INFO L273 TraceCheckUtils]: 85: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2018-11-14 16:59:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 16:59:05,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:05,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 16:59:05,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 86 [2018-11-14 16:59:05,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:05,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 16:59:05,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:05,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 16:59:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 16:59:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:59:05,932 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 31 states. [2018-11-14 16:59:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:06,853 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-11-14 16:59:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 16:59:06,854 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 86 [2018-11-14 16:59:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:59:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 131 transitions. [2018-11-14 16:59:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:59:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 131 transitions. [2018-11-14 16:59:06,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 131 transitions. [2018-11-14 16:59:06,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:06,988 INFO L225 Difference]: With dead ends: 140 [2018-11-14 16:59:06,988 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 16:59:06,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:59:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 16:59:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-14 16:59:07,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:07,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 92 states. [2018-11-14 16:59:07,115 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 92 states. [2018-11-14 16:59:07,115 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 92 states. [2018-11-14 16:59:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:07,118 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-11-14 16:59:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-11-14 16:59:07,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:07,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:07,119 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 112 states. [2018-11-14 16:59:07,119 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 112 states. [2018-11-14 16:59:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:07,121 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-11-14 16:59:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-11-14 16:59:07,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:07,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:07,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:07,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 16:59:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-14 16:59:07,124 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 86 [2018-11-14 16:59:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:07,124 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-14 16:59:07,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 16:59:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 16:59:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-14 16:59:07,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:07,125 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:07,125 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:07,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1241735819, now seen corresponding path program 15 times [2018-11-14 16:59:07,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:07,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:08,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8039#true} is VALID [2018-11-14 16:59:08,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {8039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8039#true} is VALID [2018-11-14 16:59:08,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #63#return; {8039#true} is VALID [2018-11-14 16:59:08,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret4 := main(); {8039#true} is VALID [2018-11-14 16:59:08,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {8039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {8041#(= main_~i~0 0)} is VALID [2018-11-14 16:59:08,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {8041#(= main_~i~0 0)} assume true; {8041#(= main_~i~0 0)} is VALID [2018-11-14 16:59:08,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {8041#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8042#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:08,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {8042#(<= main_~i~0 1)} assume true; {8042#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:08,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {8042#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8043#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:08,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {8043#(<= main_~i~0 2)} assume true; {8043#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:08,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {8043#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8044#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:08,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {8044#(<= main_~i~0 3)} assume true; {8044#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:08,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {8044#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8045#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:08,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {8045#(<= main_~i~0 4)} assume true; {8045#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:08,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {8045#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8046#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:08,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {8046#(<= main_~i~0 5)} assume true; {8046#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:08,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {8046#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8047#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:08,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {8047#(<= main_~i~0 6)} assume true; {8047#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:08,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {8047#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8048#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:08,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {8048#(<= main_~i~0 7)} assume true; {8048#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:08,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {8048#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8049#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:08,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {8049#(<= main_~i~0 8)} assume true; {8049#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:08,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {8049#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8050#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:08,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {8050#(<= main_~i~0 9)} assume true; {8050#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:08,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {8050#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8051#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:08,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {8051#(<= main_~i~0 10)} assume true; {8051#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:08,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {8051#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8052#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:08,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {8052#(<= main_~i~0 11)} assume true; {8052#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:08,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {8052#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8053#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:08,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {8053#(<= main_~i~0 12)} assume true; {8053#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:08,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {8053#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8054#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:08,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {8054#(<= main_~i~0 13)} assume true; {8054#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:08,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {8054#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8055#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:08,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {8055#(<= main_~i~0 14)} assume true; {8055#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:08,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {8055#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8056#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:08,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {8056#(<= main_~i~0 15)} assume true; {8056#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:08,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {8056#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8057#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:08,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {8057#(<= main_~i~0 16)} assume true; {8057#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:08,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {8057#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8058#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:08,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {8058#(<= main_~i~0 17)} assume true; {8058#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:08,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {8058#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8059#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:08,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {8059#(<= main_~i~0 18)} assume true; {8059#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:08,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {8059#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8060#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:08,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {8060#(<= main_~i~0 19)} assume true; {8060#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:08,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {8060#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8061#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:08,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {8061#(<= main_~i~0 20)} assume true; {8061#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:08,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {8061#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8062#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:08,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {8062#(<= main_~i~0 21)} assume true; {8062#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:08,314 INFO L273 TraceCheckUtils]: 49: Hoare triple {8062#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8063#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:08,315 INFO L273 TraceCheckUtils]: 50: Hoare triple {8063#(<= main_~i~0 22)} assume true; {8063#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:08,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {8063#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8064#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:08,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {8064#(<= main_~i~0 23)} assume true; {8064#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:08,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {8064#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8065#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:08,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {8065#(<= main_~i~0 24)} assume true; {8065#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:08,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {8065#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8066#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:08,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {8066#(<= main_~i~0 25)} assume true; {8066#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:08,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {8066#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8067#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:08,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {8067#(<= main_~i~0 26)} assume true; {8067#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:08,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {8067#(<= main_~i~0 26)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8068#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:08,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {8068#(<= main_~i~0 27)} assume true; {8068#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:08,323 INFO L273 TraceCheckUtils]: 61: Hoare triple {8068#(<= main_~i~0 27)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8069#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:08,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {8069#(<= main_~i~0 28)} assume true; {8069#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:08,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {8069#(<= main_~i~0 28)} assume !(~i~0 < 10000); {8040#false} is VALID [2018-11-14 16:59:08,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {8040#false} ~i~0 := 1; {8040#false} is VALID [2018-11-14 16:59:08,325 INFO L273 TraceCheckUtils]: 65: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,326 INFO L273 TraceCheckUtils]: 71: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,343 INFO L273 TraceCheckUtils]: 75: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,343 INFO L273 TraceCheckUtils]: 76: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,344 INFO L273 TraceCheckUtils]: 77: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,344 INFO L273 TraceCheckUtils]: 78: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8040#false} is VALID [2018-11-14 16:59:08,344 INFO L273 TraceCheckUtils]: 79: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {8040#false} assume !(~i~0 < 10000); {8040#false} is VALID [2018-11-14 16:59:08,344 INFO L273 TraceCheckUtils]: 81: Hoare triple {8040#false} ~i~0 := 1;~j~0 := 0; {8040#false} is VALID [2018-11-14 16:59:08,344 INFO L273 TraceCheckUtils]: 82: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,345 INFO L273 TraceCheckUtils]: 83: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {8040#false} is VALID [2018-11-14 16:59:08,345 INFO L256 TraceCheckUtils]: 84: Hoare triple {8040#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8040#false} is VALID [2018-11-14 16:59:08,345 INFO L273 TraceCheckUtils]: 85: Hoare triple {8040#false} ~cond := #in~cond; {8040#false} is VALID [2018-11-14 16:59:08,345 INFO L273 TraceCheckUtils]: 86: Hoare triple {8040#false} assume ~cond == 0; {8040#false} is VALID [2018-11-14 16:59:08,345 INFO L273 TraceCheckUtils]: 87: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2018-11-14 16:59:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-14 16:59:08,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:08,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:59:08,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:59:08,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-14 16:59:08,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:08,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:08,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8039#true} is VALID [2018-11-14 16:59:08,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {8039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8039#true} is VALID [2018-11-14 16:59:08,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #63#return; {8039#true} is VALID [2018-11-14 16:59:08,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret4 := main(); {8039#true} is VALID [2018-11-14 16:59:08,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {8039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {8039#true} is VALID [2018-11-14 16:59:08,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 18: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 36: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 50: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,795 INFO L273 TraceCheckUtils]: 51: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 52: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 53: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 55: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 56: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 59: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,796 INFO L273 TraceCheckUtils]: 60: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,797 INFO L273 TraceCheckUtils]: 61: Hoare triple {8039#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8039#true} is VALID [2018-11-14 16:59:08,797 INFO L273 TraceCheckUtils]: 62: Hoare triple {8039#true} assume true; {8039#true} is VALID [2018-11-14 16:59:08,797 INFO L273 TraceCheckUtils]: 63: Hoare triple {8039#true} assume !(~i~0 < 10000); {8039#true} is VALID [2018-11-14 16:59:08,797 INFO L273 TraceCheckUtils]: 64: Hoare triple {8039#true} ~i~0 := 1; {8042#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:08,798 INFO L273 TraceCheckUtils]: 65: Hoare triple {8042#(<= main_~i~0 1)} assume true; {8042#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:08,798 INFO L273 TraceCheckUtils]: 66: Hoare triple {8042#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8048#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:08,799 INFO L273 TraceCheckUtils]: 67: Hoare triple {8048#(<= main_~i~0 7)} assume true; {8048#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:08,799 INFO L273 TraceCheckUtils]: 68: Hoare triple {8048#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8054#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:08,799 INFO L273 TraceCheckUtils]: 69: Hoare triple {8054#(<= main_~i~0 13)} assume true; {8054#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:08,800 INFO L273 TraceCheckUtils]: 70: Hoare triple {8054#(<= main_~i~0 13)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8060#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:08,801 INFO L273 TraceCheckUtils]: 71: Hoare triple {8060#(<= main_~i~0 19)} assume true; {8060#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:08,802 INFO L273 TraceCheckUtils]: 72: Hoare triple {8060#(<= main_~i~0 19)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8066#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:08,802 INFO L273 TraceCheckUtils]: 73: Hoare triple {8066#(<= main_~i~0 25)} assume true; {8066#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:08,803 INFO L273 TraceCheckUtils]: 74: Hoare triple {8066#(<= main_~i~0 25)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8295#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:08,804 INFO L273 TraceCheckUtils]: 75: Hoare triple {8295#(<= main_~i~0 31)} assume true; {8295#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:08,805 INFO L273 TraceCheckUtils]: 76: Hoare triple {8295#(<= main_~i~0 31)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8302#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:08,805 INFO L273 TraceCheckUtils]: 77: Hoare triple {8302#(<= main_~i~0 37)} assume true; {8302#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:08,806 INFO L273 TraceCheckUtils]: 78: Hoare triple {8302#(<= main_~i~0 37)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8309#(<= main_~i~0 43)} is VALID [2018-11-14 16:59:08,807 INFO L273 TraceCheckUtils]: 79: Hoare triple {8309#(<= main_~i~0 43)} assume true; {8309#(<= main_~i~0 43)} is VALID [2018-11-14 16:59:08,807 INFO L273 TraceCheckUtils]: 80: Hoare triple {8309#(<= main_~i~0 43)} assume !(~i~0 < 10000); {8040#false} is VALID [2018-11-14 16:59:08,808 INFO L273 TraceCheckUtils]: 81: Hoare triple {8040#false} ~i~0 := 1;~j~0 := 0; {8040#false} is VALID [2018-11-14 16:59:08,808 INFO L273 TraceCheckUtils]: 82: Hoare triple {8040#false} assume true; {8040#false} is VALID [2018-11-14 16:59:08,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {8040#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {8040#false} is VALID [2018-11-14 16:59:08,808 INFO L256 TraceCheckUtils]: 84: Hoare triple {8040#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8040#false} is VALID [2018-11-14 16:59:08,808 INFO L273 TraceCheckUtils]: 85: Hoare triple {8040#false} ~cond := #in~cond; {8040#false} is VALID [2018-11-14 16:59:08,809 INFO L273 TraceCheckUtils]: 86: Hoare triple {8040#false} assume ~cond == 0; {8040#false} is VALID [2018-11-14 16:59:08,809 INFO L273 TraceCheckUtils]: 87: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2018-11-14 16:59:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-11-14 16:59:08,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:08,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 34 [2018-11-14 16:59:08,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-11-14 16:59:08,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:08,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 16:59:08,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:08,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 16:59:08,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 16:59:08,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:59:08,931 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 34 states. [2018-11-14 16:59:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:09,827 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-11-14 16:59:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 16:59:09,827 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-11-14 16:59:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:59:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 164 transitions. [2018-11-14 16:59:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:59:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 164 transitions. [2018-11-14 16:59:09,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 164 transitions. [2018-11-14 16:59:09,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:09,989 INFO L225 Difference]: With dead ends: 162 [2018-11-14 16:59:09,990 INFO L226 Difference]: Without dead ends: 134 [2018-11-14 16:59:09,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:59:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-14 16:59:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-11-14 16:59:10,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:10,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 102 states. [2018-11-14 16:59:10,047 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 102 states. [2018-11-14 16:59:10,047 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 102 states. [2018-11-14 16:59:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:10,051 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-11-14 16:59:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-11-14 16:59:10,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:10,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:10,052 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 134 states. [2018-11-14 16:59:10,052 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 134 states. [2018-11-14 16:59:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:10,055 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-11-14 16:59:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-11-14 16:59:10,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:10,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:10,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:10,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-14 16:59:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-11-14 16:59:10,058 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 88 [2018-11-14 16:59:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:10,058 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-11-14 16:59:10,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 16:59:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-11-14 16:59:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-14 16:59:10,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:10,060 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:10,060 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:10,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1448369475, now seen corresponding path program 16 times [2018-11-14 16:59:10,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:10,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:10,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:10,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:11,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {8993#true} call ULTIMATE.init(); {8993#true} is VALID [2018-11-14 16:59:11,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {8993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8993#true} is VALID [2018-11-14 16:59:11,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:11,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8993#true} {8993#true} #63#return; {8993#true} is VALID [2018-11-14 16:59:11,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {8993#true} call #t~ret4 := main(); {8993#true} is VALID [2018-11-14 16:59:11,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {8993#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {8995#(= main_~i~0 0)} is VALID [2018-11-14 16:59:11,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {8995#(= main_~i~0 0)} assume true; {8995#(= main_~i~0 0)} is VALID [2018-11-14 16:59:11,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {8995#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8996#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:11,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {8996#(<= main_~i~0 1)} assume true; {8996#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:11,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {8996#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8997#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:11,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {8997#(<= main_~i~0 2)} assume true; {8997#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:11,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {8997#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8998#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:11,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {8998#(<= main_~i~0 3)} assume true; {8998#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:11,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {8998#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8999#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:11,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {8999#(<= main_~i~0 4)} assume true; {8999#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:11,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {8999#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9000#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:11,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {9000#(<= main_~i~0 5)} assume true; {9000#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:11,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {9000#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9001#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:11,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {9001#(<= main_~i~0 6)} assume true; {9001#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:11,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {9001#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9002#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:11,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {9002#(<= main_~i~0 7)} assume true; {9002#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:11,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {9002#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9003#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:11,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {9003#(<= main_~i~0 8)} assume true; {9003#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:11,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {9003#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9004#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:11,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {9004#(<= main_~i~0 9)} assume true; {9004#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:11,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {9004#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9005#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:11,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {9005#(<= main_~i~0 10)} assume true; {9005#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:11,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {9005#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9006#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:11,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {9006#(<= main_~i~0 11)} assume true; {9006#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:11,856 INFO L273 TraceCheckUtils]: 29: Hoare triple {9006#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9007#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:11,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {9007#(<= main_~i~0 12)} assume true; {9007#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:11,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {9007#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9008#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:11,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {9008#(<= main_~i~0 13)} assume true; {9008#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:11,870 INFO L273 TraceCheckUtils]: 33: Hoare triple {9008#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9009#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:11,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {9009#(<= main_~i~0 14)} assume true; {9009#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:11,871 INFO L273 TraceCheckUtils]: 35: Hoare triple {9009#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9010#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:11,871 INFO L273 TraceCheckUtils]: 36: Hoare triple {9010#(<= main_~i~0 15)} assume true; {9010#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:11,872 INFO L273 TraceCheckUtils]: 37: Hoare triple {9010#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9011#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:11,872 INFO L273 TraceCheckUtils]: 38: Hoare triple {9011#(<= main_~i~0 16)} assume true; {9011#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:11,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {9011#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9012#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:11,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {9012#(<= main_~i~0 17)} assume true; {9012#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:11,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {9012#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9013#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:11,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {9013#(<= main_~i~0 18)} assume true; {9013#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:11,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {9013#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9014#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:11,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {9014#(<= main_~i~0 19)} assume true; {9014#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:11,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {9014#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9015#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:11,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {9015#(<= main_~i~0 20)} assume true; {9015#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:11,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {9015#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9016#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:11,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {9016#(<= main_~i~0 21)} assume true; {9016#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:11,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {9016#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9017#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:11,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {9017#(<= main_~i~0 22)} assume true; {9017#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:11,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {9017#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9018#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:11,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {9018#(<= main_~i~0 23)} assume true; {9018#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:11,884 INFO L273 TraceCheckUtils]: 53: Hoare triple {9018#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9019#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:11,885 INFO L273 TraceCheckUtils]: 54: Hoare triple {9019#(<= main_~i~0 24)} assume true; {9019#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:11,886 INFO L273 TraceCheckUtils]: 55: Hoare triple {9019#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9020#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:11,886 INFO L273 TraceCheckUtils]: 56: Hoare triple {9020#(<= main_~i~0 25)} assume true; {9020#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:11,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {9020#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9021#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:11,888 INFO L273 TraceCheckUtils]: 58: Hoare triple {9021#(<= main_~i~0 26)} assume true; {9021#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:11,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {9021#(<= main_~i~0 26)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9022#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:11,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {9022#(<= main_~i~0 27)} assume true; {9022#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:11,890 INFO L273 TraceCheckUtils]: 61: Hoare triple {9022#(<= main_~i~0 27)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9023#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:11,891 INFO L273 TraceCheckUtils]: 62: Hoare triple {9023#(<= main_~i~0 28)} assume true; {9023#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:11,892 INFO L273 TraceCheckUtils]: 63: Hoare triple {9023#(<= main_~i~0 28)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9024#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:11,892 INFO L273 TraceCheckUtils]: 64: Hoare triple {9024#(<= main_~i~0 29)} assume true; {9024#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:11,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {9024#(<= main_~i~0 29)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9025#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:11,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {9025#(<= main_~i~0 30)} assume true; {9025#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:11,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {9025#(<= main_~i~0 30)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9026#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:11,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {9026#(<= main_~i~0 31)} assume true; {9026#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:11,896 INFO L273 TraceCheckUtils]: 69: Hoare triple {9026#(<= main_~i~0 31)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {9027#(<= main_~i~0 32)} is VALID [2018-11-14 16:59:11,897 INFO L273 TraceCheckUtils]: 70: Hoare triple {9027#(<= main_~i~0 32)} assume true; {9027#(<= main_~i~0 32)} is VALID [2018-11-14 16:59:11,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {9027#(<= main_~i~0 32)} assume !(~i~0 < 10000); {8994#false} is VALID [2018-11-14 16:59:11,898 INFO L273 TraceCheckUtils]: 72: Hoare triple {8994#false} ~i~0 := 1; {8994#false} is VALID [2018-11-14 16:59:11,898 INFO L273 TraceCheckUtils]: 73: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,898 INFO L273 TraceCheckUtils]: 75: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,899 INFO L273 TraceCheckUtils]: 76: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,899 INFO L273 TraceCheckUtils]: 77: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,899 INFO L273 TraceCheckUtils]: 78: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,899 INFO L273 TraceCheckUtils]: 79: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,899 INFO L273 TraceCheckUtils]: 80: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,900 INFO L273 TraceCheckUtils]: 81: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,900 INFO L273 TraceCheckUtils]: 82: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,900 INFO L273 TraceCheckUtils]: 83: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,900 INFO L273 TraceCheckUtils]: 84: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,900 INFO L273 TraceCheckUtils]: 85: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,901 INFO L273 TraceCheckUtils]: 86: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,901 INFO L273 TraceCheckUtils]: 87: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,901 INFO L273 TraceCheckUtils]: 88: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {8994#false} is VALID [2018-11-14 16:59:11,901 INFO L273 TraceCheckUtils]: 89: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,901 INFO L273 TraceCheckUtils]: 90: Hoare triple {8994#false} assume !(~i~0 < 10000); {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L273 TraceCheckUtils]: 91: Hoare triple {8994#false} ~i~0 := 1;~j~0 := 0; {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L273 TraceCheckUtils]: 92: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L273 TraceCheckUtils]: 93: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L256 TraceCheckUtils]: 94: Hoare triple {8994#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L273 TraceCheckUtils]: 95: Hoare triple {8994#false} ~cond := #in~cond; {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L273 TraceCheckUtils]: 96: Hoare triple {8994#false} assume ~cond == 0; {8994#false} is VALID [2018-11-14 16:59:11,902 INFO L273 TraceCheckUtils]: 97: Hoare triple {8994#false} assume !false; {8994#false} is VALID [2018-11-14 16:59:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 16:59:11,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:11,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:59:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:59:11,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:59:11,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:11,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:12,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {8993#true} call ULTIMATE.init(); {8993#true} is VALID [2018-11-14 16:59:12,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {8993#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8993#true} is VALID [2018-11-14 16:59:12,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8993#true} {8993#true} #63#return; {8993#true} is VALID [2018-11-14 16:59:12,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {8993#true} call #t~ret4 := main(); {8993#true} is VALID [2018-11-14 16:59:12,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {8993#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {8993#true} is VALID [2018-11-14 16:59:12,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 32: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 33: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,221 INFO L273 TraceCheckUtils]: 34: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 35: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 36: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 38: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,222 INFO L273 TraceCheckUtils]: 42: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 44: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 45: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 46: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 47: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 48: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 49: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 50: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,223 INFO L273 TraceCheckUtils]: 51: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 52: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 53: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 54: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 55: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 56: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 57: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 58: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,224 INFO L273 TraceCheckUtils]: 59: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 60: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 61: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 62: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 63: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 64: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 65: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 66: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 67: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,225 INFO L273 TraceCheckUtils]: 68: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,226 INFO L273 TraceCheckUtils]: 69: Hoare triple {8993#true} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {8993#true} is VALID [2018-11-14 16:59:12,226 INFO L273 TraceCheckUtils]: 70: Hoare triple {8993#true} assume true; {8993#true} is VALID [2018-11-14 16:59:12,226 INFO L273 TraceCheckUtils]: 71: Hoare triple {8993#true} assume !(~i~0 < 10000); {8993#true} is VALID [2018-11-14 16:59:12,226 INFO L273 TraceCheckUtils]: 72: Hoare triple {8993#true} ~i~0 := 1; {8996#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:12,226 INFO L273 TraceCheckUtils]: 73: Hoare triple {8996#(<= main_~i~0 1)} assume true; {8996#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:12,227 INFO L273 TraceCheckUtils]: 74: Hoare triple {8996#(<= main_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9002#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:12,227 INFO L273 TraceCheckUtils]: 75: Hoare triple {9002#(<= main_~i~0 7)} assume true; {9002#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:12,228 INFO L273 TraceCheckUtils]: 76: Hoare triple {9002#(<= main_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9008#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:12,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {9008#(<= main_~i~0 13)} assume true; {9008#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:12,229 INFO L273 TraceCheckUtils]: 78: Hoare triple {9008#(<= main_~i~0 13)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9014#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:12,230 INFO L273 TraceCheckUtils]: 79: Hoare triple {9014#(<= main_~i~0 19)} assume true; {9014#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:12,231 INFO L273 TraceCheckUtils]: 80: Hoare triple {9014#(<= main_~i~0 19)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9020#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:12,231 INFO L273 TraceCheckUtils]: 81: Hoare triple {9020#(<= main_~i~0 25)} assume true; {9020#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:12,232 INFO L273 TraceCheckUtils]: 82: Hoare triple {9020#(<= main_~i~0 25)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9026#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:12,233 INFO L273 TraceCheckUtils]: 83: Hoare triple {9026#(<= main_~i~0 31)} assume true; {9026#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:12,234 INFO L273 TraceCheckUtils]: 84: Hoare triple {9026#(<= main_~i~0 31)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9283#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:12,234 INFO L273 TraceCheckUtils]: 85: Hoare triple {9283#(<= main_~i~0 37)} assume true; {9283#(<= main_~i~0 37)} is VALID [2018-11-14 16:59:12,235 INFO L273 TraceCheckUtils]: 86: Hoare triple {9283#(<= main_~i~0 37)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9290#(<= main_~i~0 43)} is VALID [2018-11-14 16:59:12,236 INFO L273 TraceCheckUtils]: 87: Hoare triple {9290#(<= main_~i~0 43)} assume true; {9290#(<= main_~i~0 43)} is VALID [2018-11-14 16:59:12,237 INFO L273 TraceCheckUtils]: 88: Hoare triple {9290#(<= main_~i~0 43)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {9297#(<= main_~i~0 49)} is VALID [2018-11-14 16:59:12,238 INFO L273 TraceCheckUtils]: 89: Hoare triple {9297#(<= main_~i~0 49)} assume true; {9297#(<= main_~i~0 49)} is VALID [2018-11-14 16:59:12,238 INFO L273 TraceCheckUtils]: 90: Hoare triple {9297#(<= main_~i~0 49)} assume !(~i~0 < 10000); {8994#false} is VALID [2018-11-14 16:59:12,238 INFO L273 TraceCheckUtils]: 91: Hoare triple {8994#false} ~i~0 := 1;~j~0 := 0; {8994#false} is VALID [2018-11-14 16:59:12,239 INFO L273 TraceCheckUtils]: 92: Hoare triple {8994#false} assume true; {8994#false} is VALID [2018-11-14 16:59:12,239 INFO L273 TraceCheckUtils]: 93: Hoare triple {8994#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {8994#false} is VALID [2018-11-14 16:59:12,239 INFO L256 TraceCheckUtils]: 94: Hoare triple {8994#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8994#false} is VALID [2018-11-14 16:59:12,239 INFO L273 TraceCheckUtils]: 95: Hoare triple {8994#false} ~cond := #in~cond; {8994#false} is VALID [2018-11-14 16:59:12,239 INFO L273 TraceCheckUtils]: 96: Hoare triple {8994#false} assume ~cond == 0; {8994#false} is VALID [2018-11-14 16:59:12,240 INFO L273 TraceCheckUtils]: 97: Hoare triple {8994#false} assume !false; {8994#false} is VALID [2018-11-14 16:59:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-14 16:59:12,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:12,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 11] total 38 [2018-11-14 16:59:12,266 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 98 [2018-11-14 16:59:12,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:12,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 16:59:12,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:12,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 16:59:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 16:59:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:59:12,370 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 38 states. [2018-11-14 16:59:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:13,544 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2018-11-14 16:59:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 16:59:13,544 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 98 [2018-11-14 16:59:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:59:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 179 transitions. [2018-11-14 16:59:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:59:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 179 transitions. [2018-11-14 16:59:13,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 179 transitions. [2018-11-14 16:59:13,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:13,743 INFO L225 Difference]: With dead ends: 178 [2018-11-14 16:59:13,743 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 16:59:13,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 16:59:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 16:59:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2018-11-14 16:59:13,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:13,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 112 states. [2018-11-14 16:59:13,788 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 112 states. [2018-11-14 16:59:13,788 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 112 states. [2018-11-14 16:59:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:13,792 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-11-14 16:59:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-11-14 16:59:13,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:13,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:13,793 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 148 states. [2018-11-14 16:59:13,793 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 148 states. [2018-11-14 16:59:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:13,796 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-11-14 16:59:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-11-14 16:59:13,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:13,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:13,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:13,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-14 16:59:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-11-14 16:59:13,800 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 98 [2018-11-14 16:59:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:13,800 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-11-14 16:59:13,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 16:59:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-11-14 16:59:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-14 16:59:13,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:13,801 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:13,801 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:13,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1929609327, now seen corresponding path program 17 times [2018-11-14 16:59:13,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:13,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:13,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:14,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2018-11-14 16:59:14,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {10048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10048#true} is VALID [2018-11-14 16:59:14,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2018-11-14 16:59:14,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #63#return; {10048#true} is VALID [2018-11-14 16:59:14,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret4 := main(); {10048#true} is VALID [2018-11-14 16:59:14,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {10048#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000);~i~0 := 0;~j~0 := 0; {10050#(= main_~i~0 0)} is VALID [2018-11-14 16:59:14,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {10050#(= main_~i~0 0)} assume true; {10050#(= main_~i~0 0)} is VALID [2018-11-14 16:59:14,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {10050#(= main_~i~0 0)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10051#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:14,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {10051#(<= main_~i~0 1)} assume true; {10051#(<= main_~i~0 1)} is VALID [2018-11-14 16:59:14,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {10051#(<= main_~i~0 1)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10052#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:14,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {10052#(<= main_~i~0 2)} assume true; {10052#(<= main_~i~0 2)} is VALID [2018-11-14 16:59:14,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {10052#(<= main_~i~0 2)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10053#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:14,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {10053#(<= main_~i~0 3)} assume true; {10053#(<= main_~i~0 3)} is VALID [2018-11-14 16:59:14,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {10053#(<= main_~i~0 3)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10054#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:14,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {10054#(<= main_~i~0 4)} assume true; {10054#(<= main_~i~0 4)} is VALID [2018-11-14 16:59:14,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {10054#(<= main_~i~0 4)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10055#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:14,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {10055#(<= main_~i~0 5)} assume true; {10055#(<= main_~i~0 5)} is VALID [2018-11-14 16:59:14,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {10055#(<= main_~i~0 5)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10056#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:14,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {10056#(<= main_~i~0 6)} assume true; {10056#(<= main_~i~0 6)} is VALID [2018-11-14 16:59:14,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {10056#(<= main_~i~0 6)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10057#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:14,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {10057#(<= main_~i~0 7)} assume true; {10057#(<= main_~i~0 7)} is VALID [2018-11-14 16:59:14,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {10057#(<= main_~i~0 7)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10058#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:14,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {10058#(<= main_~i~0 8)} assume true; {10058#(<= main_~i~0 8)} is VALID [2018-11-14 16:59:14,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {10058#(<= main_~i~0 8)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10059#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:14,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {10059#(<= main_~i~0 9)} assume true; {10059#(<= main_~i~0 9)} is VALID [2018-11-14 16:59:14,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {10059#(<= main_~i~0 9)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10060#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:14,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {10060#(<= main_~i~0 10)} assume true; {10060#(<= main_~i~0 10)} is VALID [2018-11-14 16:59:14,959 INFO L273 TraceCheckUtils]: 27: Hoare triple {10060#(<= main_~i~0 10)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10061#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:14,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {10061#(<= main_~i~0 11)} assume true; {10061#(<= main_~i~0 11)} is VALID [2018-11-14 16:59:14,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {10061#(<= main_~i~0 11)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10062#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:14,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {10062#(<= main_~i~0 12)} assume true; {10062#(<= main_~i~0 12)} is VALID [2018-11-14 16:59:14,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {10062#(<= main_~i~0 12)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10063#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:14,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {10063#(<= main_~i~0 13)} assume true; {10063#(<= main_~i~0 13)} is VALID [2018-11-14 16:59:14,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {10063#(<= main_~i~0 13)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10064#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:14,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {10064#(<= main_~i~0 14)} assume true; {10064#(<= main_~i~0 14)} is VALID [2018-11-14 16:59:14,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {10064#(<= main_~i~0 14)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10065#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:14,966 INFO L273 TraceCheckUtils]: 36: Hoare triple {10065#(<= main_~i~0 15)} assume true; {10065#(<= main_~i~0 15)} is VALID [2018-11-14 16:59:14,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {10065#(<= main_~i~0 15)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10066#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:14,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {10066#(<= main_~i~0 16)} assume true; {10066#(<= main_~i~0 16)} is VALID [2018-11-14 16:59:14,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {10066#(<= main_~i~0 16)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10067#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:14,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {10067#(<= main_~i~0 17)} assume true; {10067#(<= main_~i~0 17)} is VALID [2018-11-14 16:59:14,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {10067#(<= main_~i~0 17)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10068#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:14,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {10068#(<= main_~i~0 18)} assume true; {10068#(<= main_~i~0 18)} is VALID [2018-11-14 16:59:14,972 INFO L273 TraceCheckUtils]: 43: Hoare triple {10068#(<= main_~i~0 18)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10069#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:14,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {10069#(<= main_~i~0 19)} assume true; {10069#(<= main_~i~0 19)} is VALID [2018-11-14 16:59:14,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {10069#(<= main_~i~0 19)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10070#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:14,975 INFO L273 TraceCheckUtils]: 46: Hoare triple {10070#(<= main_~i~0 20)} assume true; {10070#(<= main_~i~0 20)} is VALID [2018-11-14 16:59:14,976 INFO L273 TraceCheckUtils]: 47: Hoare triple {10070#(<= main_~i~0 20)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10071#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:14,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {10071#(<= main_~i~0 21)} assume true; {10071#(<= main_~i~0 21)} is VALID [2018-11-14 16:59:14,978 INFO L273 TraceCheckUtils]: 49: Hoare triple {10071#(<= main_~i~0 21)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10072#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:14,978 INFO L273 TraceCheckUtils]: 50: Hoare triple {10072#(<= main_~i~0 22)} assume true; {10072#(<= main_~i~0 22)} is VALID [2018-11-14 16:59:14,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {10072#(<= main_~i~0 22)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10073#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:14,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {10073#(<= main_~i~0 23)} assume true; {10073#(<= main_~i~0 23)} is VALID [2018-11-14 16:59:14,981 INFO L273 TraceCheckUtils]: 53: Hoare triple {10073#(<= main_~i~0 23)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10074#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:14,982 INFO L273 TraceCheckUtils]: 54: Hoare triple {10074#(<= main_~i~0 24)} assume true; {10074#(<= main_~i~0 24)} is VALID [2018-11-14 16:59:14,983 INFO L273 TraceCheckUtils]: 55: Hoare triple {10074#(<= main_~i~0 24)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10075#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:14,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {10075#(<= main_~i~0 25)} assume true; {10075#(<= main_~i~0 25)} is VALID [2018-11-14 16:59:14,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {10075#(<= main_~i~0 25)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10076#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:14,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {10076#(<= main_~i~0 26)} assume true; {10076#(<= main_~i~0 26)} is VALID [2018-11-14 16:59:14,986 INFO L273 TraceCheckUtils]: 59: Hoare triple {10076#(<= main_~i~0 26)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10077#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:14,987 INFO L273 TraceCheckUtils]: 60: Hoare triple {10077#(<= main_~i~0 27)} assume true; {10077#(<= main_~i~0 27)} is VALID [2018-11-14 16:59:14,988 INFO L273 TraceCheckUtils]: 61: Hoare triple {10077#(<= main_~i~0 27)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10078#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:14,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {10078#(<= main_~i~0 28)} assume true; {10078#(<= main_~i~0 28)} is VALID [2018-11-14 16:59:14,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {10078#(<= main_~i~0 28)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10079#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:14,990 INFO L273 TraceCheckUtils]: 64: Hoare triple {10079#(<= main_~i~0 29)} assume true; {10079#(<= main_~i~0 29)} is VALID [2018-11-14 16:59:14,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {10079#(<= main_~i~0 29)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10080#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:14,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {10080#(<= main_~i~0 30)} assume true; {10080#(<= main_~i~0 30)} is VALID [2018-11-14 16:59:14,993 INFO L273 TraceCheckUtils]: 67: Hoare triple {10080#(<= main_~i~0 30)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10081#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:14,994 INFO L273 TraceCheckUtils]: 68: Hoare triple {10081#(<= main_~i~0 31)} assume true; {10081#(<= main_~i~0 31)} is VALID [2018-11-14 16:59:14,995 INFO L273 TraceCheckUtils]: 69: Hoare triple {10081#(<= main_~i~0 31)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10082#(<= main_~i~0 32)} is VALID [2018-11-14 16:59:14,996 INFO L273 TraceCheckUtils]: 70: Hoare triple {10082#(<= main_~i~0 32)} assume true; {10082#(<= main_~i~0 32)} is VALID [2018-11-14 16:59:14,997 INFO L273 TraceCheckUtils]: 71: Hoare triple {10082#(<= main_~i~0 32)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10083#(<= main_~i~0 33)} is VALID [2018-11-14 16:59:14,997 INFO L273 TraceCheckUtils]: 72: Hoare triple {10083#(<= main_~i~0 33)} assume true; {10083#(<= main_~i~0 33)} is VALID [2018-11-14 16:59:14,999 INFO L273 TraceCheckUtils]: 73: Hoare triple {10083#(<= main_~i~0 33)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10084#(<= main_~i~0 34)} is VALID [2018-11-14 16:59:14,999 INFO L273 TraceCheckUtils]: 74: Hoare triple {10084#(<= main_~i~0 34)} assume true; {10084#(<= main_~i~0 34)} is VALID [2018-11-14 16:59:15,000 INFO L273 TraceCheckUtils]: 75: Hoare triple {10084#(<= main_~i~0 34)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10085#(<= main_~i~0 35)} is VALID [2018-11-14 16:59:15,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {10085#(<= main_~i~0 35)} assume true; {10085#(<= main_~i~0 35)} is VALID [2018-11-14 16:59:15,002 INFO L273 TraceCheckUtils]: 77: Hoare triple {10085#(<= main_~i~0 35)} assume !!(~i~0 < 10000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~nondet0;~i~0 := ~i~0 + 1; {10086#(<= main_~i~0 36)} is VALID [2018-11-14 16:59:15,003 INFO L273 TraceCheckUtils]: 78: Hoare triple {10086#(<= main_~i~0 36)} assume true; {10086#(<= main_~i~0 36)} is VALID [2018-11-14 16:59:15,003 INFO L273 TraceCheckUtils]: 79: Hoare triple {10086#(<= main_~i~0 36)} assume !(~i~0 < 10000); {10049#false} is VALID [2018-11-14 16:59:15,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {10049#false} ~i~0 := 1; {10049#false} is VALID [2018-11-14 16:59:15,004 INFO L273 TraceCheckUtils]: 81: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,004 INFO L273 TraceCheckUtils]: 82: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,005 INFO L273 TraceCheckUtils]: 83: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,005 INFO L273 TraceCheckUtils]: 85: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,005 INFO L273 TraceCheckUtils]: 86: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,006 INFO L273 TraceCheckUtils]: 87: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,006 INFO L273 TraceCheckUtils]: 88: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,006 INFO L273 TraceCheckUtils]: 89: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,006 INFO L273 TraceCheckUtils]: 90: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,007 INFO L273 TraceCheckUtils]: 91: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,007 INFO L273 TraceCheckUtils]: 92: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,007 INFO L273 TraceCheckUtils]: 93: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,007 INFO L273 TraceCheckUtils]: 94: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,008 INFO L273 TraceCheckUtils]: 95: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,008 INFO L273 TraceCheckUtils]: 96: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,008 INFO L273 TraceCheckUtils]: 97: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,008 INFO L273 TraceCheckUtils]: 98: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);havoc #t~mem1;~i~0 := ~i~0 + 6;~j~0 := ~j~0 + 1; {10049#false} is VALID [2018-11-14 16:59:15,008 INFO L273 TraceCheckUtils]: 99: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,008 INFO L273 TraceCheckUtils]: 100: Hoare triple {10049#false} assume !(~i~0 < 10000); {10049#false} is VALID [2018-11-14 16:59:15,009 INFO L273 TraceCheckUtils]: 101: Hoare triple {10049#false} ~i~0 := 1;~j~0 := 0; {10049#false} is VALID [2018-11-14 16:59:15,009 INFO L273 TraceCheckUtils]: 102: Hoare triple {10049#false} assume true; {10049#false} is VALID [2018-11-14 16:59:15,009 INFO L273 TraceCheckUtils]: 103: Hoare triple {10049#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + ~j~0 * 4, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + (6 * ~j~0 + 1) * 4, 4); {10049#false} is VALID [2018-11-14 16:59:15,009 INFO L256 TraceCheckUtils]: 104: Hoare triple {10049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10049#false} is VALID [2018-11-14 16:59:15,009 INFO L273 TraceCheckUtils]: 105: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2018-11-14 16:59:15,009 INFO L273 TraceCheckUtils]: 106: Hoare triple {10049#false} assume ~cond == 0; {10049#false} is VALID [2018-11-14 16:59:15,010 INFO L273 TraceCheckUtils]: 107: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2018-11-14 16:59:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 16:59:15,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:15,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:59:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1