java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:21:37,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:21:37,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:21:37,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:21:37,548 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:21:37,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:21:37,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:21:37,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:21:37,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:21:37,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:21:37,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:21:37,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:21:37,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:21:37,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:21:37,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:21:37,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:21:37,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:21:37,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:21:37,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:21:37,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:21:37,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:21:37,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:21:37,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:21:37,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:21:37,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:21:37,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:21:37,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:21:37,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:21:37,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:21:37,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:21:37,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:21:37,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:21:37,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:21:37,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:21:37,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:21:37,583 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:21:37,583 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:21:37,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:21:37,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:21:37,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:21:37,609 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:21:37,610 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:21:37,610 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:21:37,610 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:21:37,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:21:37,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:21:37,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:21:37,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:21:37,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:21:37,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:21:37,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:21:37,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:21:37,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:21:37,615 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:21:37,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:21:37,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:21:37,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:21:37,616 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:21:37,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:21:37,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:21:37,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:21:37,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:21:37,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:21:37,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:21:37,619 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:21:37,619 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:21:37,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:21:37,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:21:37,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:21:37,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:21:37,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:21:37,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:21:37,683 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:21:37,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i [2018-11-23 12:21:37,737 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d08839d5/d617a78e02f7433880f61ed106f7a86f/FLAGe9c20de6c [2018-11-23 12:21:38,181 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:21:38,182 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i [2018-11-23 12:21:38,188 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d08839d5/d617a78e02f7433880f61ed106f7a86f/FLAGe9c20de6c [2018-11-23 12:21:38,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d08839d5/d617a78e02f7433880f61ed106f7a86f [2018-11-23 12:21:38,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:21:38,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:21:38,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:38,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:21:38,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:21:38,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38, skipping insertion in model container [2018-11-23 12:21:38,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:21:38,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:21:38,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:38,828 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:21:38,867 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:38,889 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:21:38,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38 WrapperNode [2018-11-23 12:21:38,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:38,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:38,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:21:38,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:21:38,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:38,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:21:38,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:21:38,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:21:38,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... [2018-11-23 12:21:38,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:21:38,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:21:38,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:21:38,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:21:38,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:21:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:21:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:21:39,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:21:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:21:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:21:39,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:21:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:21:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:21:39,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:21:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:21:39,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:21:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:21:39,990 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:21:39,991 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:21:39,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:39 BoogieIcfgContainer [2018-11-23 12:21:39,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:21:39,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:21:39,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:21:39,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:21:39,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:38" (1/3) ... [2018-11-23 12:21:39,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a11ba74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:39, skipping insertion in model container [2018-11-23 12:21:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:38" (2/3) ... [2018-11-23 12:21:39,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a11ba74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:39, skipping insertion in model container [2018-11-23 12:21:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:39" (3/3) ... [2018-11-23 12:21:40,001 INFO L112 eAbstractionObserver]: Analyzing ICFG revcpyswp2_true-unreach-call.i [2018-11-23 12:21:40,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:21:40,018 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:21:40,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:21:40,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:21:40,070 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:21:40,071 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:21:40,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:21:40,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:21:40,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:21:40,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:21:40,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:21:40,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:21:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:21:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:21:40,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:40,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:40,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:40,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -66205200, now seen corresponding path program 1 times [2018-11-23 12:21:40,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:40,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:40,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:21:40,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {35#true} is VALID [2018-11-23 12:21:40,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:21:40,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #84#return; {35#true} is VALID [2018-11-23 12:21:40,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret14 := main(); {35#true} is VALID [2018-11-23 12:21:40,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {35#true} is VALID [2018-11-23 12:21:40,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {35#true} is VALID [2018-11-23 12:21:40,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:21:40,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:21:40,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:21:40,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:21:40,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:21:40,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:21:40,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {36#false} is VALID [2018-11-23 12:21:40,328 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {36#false} is VALID [2018-11-23 12:21:40,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 12:21:40,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-23 12:21:40,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:21:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:40,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:40,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:21:40,343 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 12:21:40,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:40,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:21:40,489 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-23 12:21:40,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:21:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:21:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:21:40,501 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:21:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:40,629 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-11-23 12:21:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:21:40,630 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 12:21:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:21:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:21:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:21:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:21:40,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:21:40,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:40,914 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:21:40,914 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:21:40,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:21:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:21:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:21:40,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:40,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:21:40,971 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:21:40,971 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:21:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:40,976 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:21:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:21:40,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:40,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:40,977 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:21:40,978 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:21:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:40,982 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:21:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:21:40,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:40,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:40,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:40,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:21:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 12:21:40,989 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2018-11-23 12:21:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:40,989 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 12:21:40,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:21:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:21:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:21:40,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:40,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:40,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:40,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:40,992 INFO L82 PathProgramCache]: Analyzing trace with hash -944661538, now seen corresponding path program 1 times [2018-11-23 12:21:40,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:40,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:40,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:41,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-23 12:21:41,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {197#true} is VALID [2018-11-23 12:21:41,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-23 12:21:41,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #84#return; {197#true} is VALID [2018-11-23 12:21:41,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret14 := main(); {197#true} is VALID [2018-11-23 12:21:41,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {197#true} is VALID [2018-11-23 12:21:41,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {199#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:41,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !(~i~0 < ~SIZE~0); {198#false} is VALID [2018-11-23 12:21:41,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-23 12:21:41,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#false} assume !(~i~0 < ~SIZE~0); {198#false} is VALID [2018-11-23 12:21:41,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-23 12:21:41,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} assume !(~i~0 < ~SIZE~0); {198#false} is VALID [2018-11-23 12:21:41,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-23 12:21:41,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {198#false} is VALID [2018-11-23 12:21:41,281 INFO L256 TraceCheckUtils]: 14: Hoare triple {198#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {198#false} is VALID [2018-11-23 12:21:41,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-23 12:21:41,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#false} assume 0 == ~cond; {198#false} is VALID [2018-11-23 12:21:41,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-23 12:21:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:41,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:41,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:41,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:21:41,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:41,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:21:41,431 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-23 12:21:41,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:41,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:41,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:41,432 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-23 12:21:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:42,059 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 12:21:42,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:42,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:21:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:21:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 12:21:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:21:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 12:21:42,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2018-11-23 12:21:42,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:42,209 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:21:42,210 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:21:42,211 INFO L631 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-23 12:21:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:21:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:21:42,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:42,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:21:42,231 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:21:42,231 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:21:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:42,233 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:21:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:21:42,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:42,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:42,235 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:21:42,235 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:21:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:42,238 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:21:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:21:42,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:42,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:42,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:42,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:21:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 12:21:42,242 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2018-11-23 12:21:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:42,242 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 12:21:42,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:21:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:21:42,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:42,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:42,244 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:42,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2028063140, now seen corresponding path program 1 times [2018-11-23 12:21:42,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:42,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:42,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 12:21:42,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {357#true} is VALID [2018-11-23 12:21:42,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 12:21:42,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #84#return; {357#true} is VALID [2018-11-23 12:21:42,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret14 := main(); {357#true} is VALID [2018-11-23 12:21:42,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {357#true} is VALID [2018-11-23 12:21:42,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {359#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:42,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {359#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {359#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:42,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {359#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {360#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-23 12:21:42,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {360#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {358#false} is VALID [2018-11-23 12:21:42,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:21:42,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~i~0 < ~SIZE~0); {358#false} is VALID [2018-11-23 12:21:42,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:21:42,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} assume !(~i~0 < ~SIZE~0); {358#false} is VALID [2018-11-23 12:21:42,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:21:42,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {358#false} is VALID [2018-11-23 12:21:42,386 INFO L256 TraceCheckUtils]: 16: Hoare triple {358#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {358#false} is VALID [2018-11-23 12:21:42,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 12:21:42,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 12:21:42,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 12:21:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:42,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:42,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:42,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:42,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 12:21:42,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {357#true} is VALID [2018-11-23 12:21:42,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 12:21:42,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #84#return; {357#true} is VALID [2018-11-23 12:21:42,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret14 := main(); {357#true} is VALID [2018-11-23 12:21:42,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {357#true} is VALID [2018-11-23 12:21:42,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {382#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:21:42,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {382#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {382#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:21:42,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {382#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {389#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:42,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} assume !(~i~0 < ~SIZE~0); {358#false} is VALID [2018-11-23 12:21:42,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:21:42,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~i~0 < ~SIZE~0); {358#false} is VALID [2018-11-23 12:21:42,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:21:42,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} assume !(~i~0 < ~SIZE~0); {358#false} is VALID [2018-11-23 12:21:42,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:21:42,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {358#false} is VALID [2018-11-23 12:21:42,742 INFO L256 TraceCheckUtils]: 16: Hoare triple {358#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {358#false} is VALID [2018-11-23 12:21:42,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 12:21:42,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 12:21:42,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 12:21:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:42,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:42,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 12:21:42,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 12:21:42,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:42,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:21:42,867 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-23 12:21:42,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:21:42,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:21:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:21:42,868 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-23 12:21:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,231 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 12:21:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:21:43,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 12:21:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:21:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:21:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:21:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:21:43,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-23 12:21:43,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:43,393 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:21:43,393 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:21:43,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:21:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:21:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:21:43,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:43,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:21:43,417 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:21:43,417 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:21:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,420 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:21:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:21:43,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:43,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:43,421 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:21:43,421 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:21:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,424 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:21:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:21:43,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:43,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:43,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:43,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:21:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 12:21:43,428 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-11-23 12:21:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:43,428 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 12:21:43,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:21:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:21:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:21:43,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:43,429 INFO L402 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-23 12:21:43,430 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:43,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash 500050266, now seen corresponding path program 2 times [2018-11-23 12:21:43,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:43,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:43,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:43,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2018-11-23 12:21:43,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {587#true} is VALID [2018-11-23 12:21:43,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2018-11-23 12:21:43,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #84#return; {587#true} is VALID [2018-11-23 12:21:43,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret14 := main(); {587#true} is VALID [2018-11-23 12:21:43,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {587#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {587#true} is VALID [2018-11-23 12:21:43,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {589#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:43,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {589#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:43,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {589#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:43,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {589#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:43,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {589#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:43,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#(<= 2 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {589#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:43,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#(<= 2 ~SIZE~0)} ~i~0 := 0; {590#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:43,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {590#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !(~i~0 < ~SIZE~0); {588#false} is VALID [2018-11-23 12:21:43,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2018-11-23 12:21:43,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {588#false} assume !(~i~0 < ~SIZE~0); {588#false} is VALID [2018-11-23 12:21:43,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2018-11-23 12:21:43,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {588#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {588#false} is VALID [2018-11-23 12:21:43,588 INFO L256 TraceCheckUtils]: 18: Hoare triple {588#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {588#false} is VALID [2018-11-23 12:21:43,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2018-11-23 12:21:43,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2018-11-23 12:21:43,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {588#false} assume !false; {588#false} is VALID [2018-11-23 12:21:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:21:43,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:43,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:21:43,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:21:43,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:43,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:21:43,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:43,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:21:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:21:43,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:21:43,626 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-23 12:21:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,811 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:21:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:21:43,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:21:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:21:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 12:21:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:21:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 12:21:43,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2018-11-23 12:21:43,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:43,911 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:21:43,911 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:21:43,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:21:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:21:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-11-23 12:21:43,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:43,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2018-11-23 12:21:43,944 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2018-11-23 12:21:43,945 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2018-11-23 12:21:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,948 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 12:21:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:21:43,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:43,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:43,950 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2018-11-23 12:21:43,950 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2018-11-23 12:21:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:43,953 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 12:21:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:21:43,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:43,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:43,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:43,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:21:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 12:21:43,956 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2018-11-23 12:21:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:43,957 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 12:21:43,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:21:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:21:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:21:43,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:43,958 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:43,959 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:43,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash -303433706, now seen corresponding path program 1 times [2018-11-23 12:21:43,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:43,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:43,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:21:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:44,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2018-11-23 12:21:44,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {783#true} is VALID [2018-11-23 12:21:44,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2018-11-23 12:21:44,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #84#return; {783#true} is VALID [2018-11-23 12:21:44,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret14 := main(); {783#true} is VALID [2018-11-23 12:21:44,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {783#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {783#true} is VALID [2018-11-23 12:21:44,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {783#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {785#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {785#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {785#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {785#(<= 2 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {785#(<= 2 ~SIZE~0)} ~i~0 := 0; {786#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:44,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {786#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {786#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:44,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {786#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {787#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-23 12:21:44,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {787#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {784#false} is VALID [2018-11-23 12:21:44,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {784#false} ~i~0 := 0; {784#false} is VALID [2018-11-23 12:21:44,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {784#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {784#false} is VALID [2018-11-23 12:21:44,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {784#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {784#false} is VALID [2018-11-23 12:21:44,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {784#false} assume !(~i~0 < ~SIZE~0); {784#false} is VALID [2018-11-23 12:21:44,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {784#false} ~i~0 := 0; {784#false} is VALID [2018-11-23 12:21:44,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {784#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {784#false} is VALID [2018-11-23 12:21:44,146 INFO L256 TraceCheckUtils]: 22: Hoare triple {784#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {784#false} is VALID [2018-11-23 12:21:44,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {784#false} ~cond := #in~cond; {784#false} is VALID [2018-11-23 12:21:44,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {784#false} assume 0 == ~cond; {784#false} is VALID [2018-11-23 12:21:44,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {784#false} assume !false; {784#false} is VALID [2018-11-23 12:21:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:21:44,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:44,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:44,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:44,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:44,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2018-11-23 12:21:44,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {783#true} is VALID [2018-11-23 12:21:44,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2018-11-23 12:21:44,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #84#return; {783#true} is VALID [2018-11-23 12:21:44,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret14 := main(); {783#true} is VALID [2018-11-23 12:21:44,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {783#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {783#true} is VALID [2018-11-23 12:21:44,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {783#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {785#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {785#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {785#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {785#(<= 2 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {785#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:21:44,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {785#(<= 2 ~SIZE~0)} ~i~0 := 0; {827#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:21:44,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {827#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {827#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:21:44,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {827#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {834#(and (<= main_~i~0 1) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:21:44,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {834#(and (<= main_~i~0 1) (<= 2 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {784#false} is VALID [2018-11-23 12:21:44,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {784#false} ~i~0 := 0; {784#false} is VALID [2018-11-23 12:21:44,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {784#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {784#false} is VALID [2018-11-23 12:21:44,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {784#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {784#false} is VALID [2018-11-23 12:21:44,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {784#false} assume !(~i~0 < ~SIZE~0); {784#false} is VALID [2018-11-23 12:21:44,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {784#false} ~i~0 := 0; {784#false} is VALID [2018-11-23 12:21:44,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {784#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {784#false} is VALID [2018-11-23 12:21:44,468 INFO L256 TraceCheckUtils]: 22: Hoare triple {784#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {784#false} is VALID [2018-11-23 12:21:44,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {784#false} ~cond := #in~cond; {784#false} is VALID [2018-11-23 12:21:44,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {784#false} assume 0 == ~cond; {784#false} is VALID [2018-11-23 12:21:44,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {784#false} assume !false; {784#false} is VALID [2018-11-23 12:21:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:21:44,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:44,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 12:21:44,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:21:44,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:44,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:21:44,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:44,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:21:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:21:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:21:44,529 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-11-23 12:21:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:45,109 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:21:45,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:21:45,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:21:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:21:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 12:21:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:21:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 12:21:45,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-23 12:21:45,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:45,281 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:21:45,282 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:21:45,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:21:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:21:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 12:21:45,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:45,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 35 states. [2018-11-23 12:21:45,332 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 35 states. [2018-11-23 12:21:45,332 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 35 states. [2018-11-23 12:21:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:45,336 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:21:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:21:45,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:45,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:45,338 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states. [2018-11-23 12:21:45,338 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states. [2018-11-23 12:21:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:45,341 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:21:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:21:45,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:45,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:45,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:45,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:21:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 12:21:45,345 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2018-11-23 12:21:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:45,345 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 12:21:45,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:21:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 12:21:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:21:45,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:45,347 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:45,347 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:45,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1412368174, now seen corresponding path program 2 times [2018-11-23 12:21:45,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:45,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:45,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:46,555 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-11-23 12:21:46,765 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-11-23 12:21:47,295 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2018-11-23 12:21:47,484 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2018-11-23 12:21:47,765 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2018-11-23 12:21:48,065 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-11-23 12:21:48,224 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-23 12:21:48,605 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2018-11-23 12:21:49,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2018-11-23 12:21:49,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1098#true} is VALID [2018-11-23 12:21:49,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 12:21:49,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #84#return; {1098#true} is VALID [2018-11-23 12:21:49,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret14 := main(); {1098#true} is VALID [2018-11-23 12:21:49,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1098#true} is VALID [2018-11-23 12:21:49,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {1098#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {1100#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:21:49,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1101#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:21:49,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {1101#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1102#(and (or (and (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ main_~i~0 1) ~SIZE~0)) (<= (+ main_~i~0 4) (* 2 ~SIZE~0))) (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {1102#(and (or (and (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ main_~i~0 1) ~SIZE~0)) (<= (+ main_~i~0 4) (* 2 ~SIZE~0))) (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1102#(and (or (and (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ main_~i~0 1) ~SIZE~0)) (<= (+ main_~i~0 4) (* 2 ~SIZE~0))) (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {1102#(and (or (and (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ main_~i~0 1) ~SIZE~0)) (<= (+ main_~i~0 4) (* 2 ~SIZE~0))) (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1103#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= main_~i~0 ~SIZE~0)) (<= (+ main_~i~0 3) (* 2 ~SIZE~0))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {1103#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= main_~i~0 ~SIZE~0)) (<= (+ main_~i~0 3) (* 2 ~SIZE~0))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1104#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (or (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= 3 ~SIZE~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {1104#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (or (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= 3 ~SIZE~0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1105#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= 2 ~SIZE~0)) (<= 3 ~SIZE~0)) (= main_~i~0 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {1105#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= 2 ~SIZE~0)) (<= 3 ~SIZE~0)) (= main_~i~0 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1106#(and (or (and (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= 2 ~SIZE~0)) (<= 3 ~SIZE~0)) (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= main_~i~0 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#(and (or (and (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= 2 ~SIZE~0)) (<= 3 ~SIZE~0)) (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= main_~i~0 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1107#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#b~0.base|) 0) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {1107#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#b~0.base|) 0) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1107#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#b~0.base|) 0) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {1107#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (and (= (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#b~0.base|) 0) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1108#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 4 ~SIZE~0)) (and (= (select (select |#memory_int| |main_~#b~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 4 ~SIZE~0)) (and (= (select (select |#memory_int| |main_~#b~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1109#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:21:49,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {1109#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} ~i~0 := 0; {1110#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {1110#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (<= 2 ~SIZE~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1101#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:21:49,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {1101#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1111#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (or (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0)))) 0) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:21:49,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {1111#(and (not (= |main_~#a~0.base| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (or (= (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0)))) 0) (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| (* 4 main_~i~0))))) |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1112#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {1112#(and (or (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1113#(and (or (<= (+ main_~i~0 1) ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4))))))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {1113#(and (or (<= (+ main_~i~0 1) ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4))))))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1114#(and (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:21:49,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#(and (= (select (select |#memory_int| |main_~#a~0.base|) 0) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ |main_~#a_copy~0.offset| (+ (* (- 4) 0) (+ (* 4 ~SIZE~0) (- 4)))))) (= |main_~#a~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))} ~i~0 := 0; {1115#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) (= main_~i~0 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (* (- 4) main_~i~0) (- 4)))) (= main_~i~0 0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {1116#(= |main_#t~mem13| |main_#t~mem12|)} is VALID [2018-11-23 12:21:49,421 INFO L256 TraceCheckUtils]: 26: Hoare triple {1116#(= |main_#t~mem13| |main_#t~mem12|)} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1117#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:21:49,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {1117#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1118#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:21:49,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {1118#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1099#false} is VALID [2018-11-23 12:21:49,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2018-11-23 12:21:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:49,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:49,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:49,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:21:49,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:21:49,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:49,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:49,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-23 12:21:49,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-23 12:21:49,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:49,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 12:21:49,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:49,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:49,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:49,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:49,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2018-11-23 12:21:50,084 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-11-23 12:21:50,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2018-11-23 12:21:50,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 12:21:50,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 72 [2018-11-23 12:21:50,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 12:21:50,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:139, output treesize:86 [2018-11-23 12:21:50,773 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-23 12:21:50,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2018-11-23 12:21:50,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:50,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-11-23 12:21:50,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 102 [2018-11-23 12:21:50,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:50,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-11-23 12:21:50,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:50,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:51,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 12:21:51,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:171, output treesize:118 [2018-11-23 12:21:51,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 124 [2018-11-23 12:21:51,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:51,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-11-23 12:21:51,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:51,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 109 [2018-11-23 12:21:51,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:51,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-11-23 12:21:51,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:51,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:51,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:51,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 12:21:51,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:118 [2018-11-23 12:21:51,845 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:51,846 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_~#b_copy~0.offset|, v_prenex_1, |v_#memory_int_15|, |main_~#b_copy~0.base|]. (let ((.cse8 (select |v_#memory_int_15| |main_~#b~0.base|)) (.cse2 (select |v_#memory_int_15| |main_~#a~0.base|))) (let ((.cse1 (select .cse2 |main_~#a~0.offset|)) (.cse6 (select |v_#memory_int_15| |main_~#b_copy~0.base|)) (.cse3 (select .cse8 |main_~#b~0.offset|)) (.cse9 (* 4 v_prenex_1)) (.cse4 (select |v_#memory_int_15| |main_~#a_copy~0.base|)) (.cse7 (* (- 4) v_prenex_1)) (.cse5 (* 4 ~SIZE~0))) (and (<= 1 v_prenex_1) (= |#memory_int| (let ((.cse0 (store |v_#memory_int_15| |main_~#a~0.base| (store .cse2 |main_~#a~0.offset| .cse3)))) (store .cse0 |main_~#b~0.base| (store (select .cse0 |main_~#b~0.base|) |main_~#b~0.offset| .cse1)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= .cse1 (select .cse4 (+ .cse5 |main_~#a_copy~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select .cse6 (+ |main_~#b_copy~0.offset| .cse7 .cse5 (- 4))) (select .cse8 (+ .cse9 |main_~#b~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= (select .cse6 (+ |main_~#b_copy~0.offset| .cse5 (- 4))) .cse3) (= |main_~#b~0.offset| 0) (= (select .cse2 (+ .cse9 |main_~#a~0.offset|)) (select .cse4 (+ .cse7 .cse5 |main_~#a_copy~0.offset| (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:21:51,846 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |main_~#b_copy~0.offset|, |main_~#b_copy~0.base|]. (let ((.cse3 (* (- 4) v_prenex_1)) (.cse1 (* 4 v_prenex_1)) (.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse5 (select |#memory_int| |main_~#b_copy~0.base|)) (.cse2 (select |#memory_int| |main_~#a_copy~0.base|)) (.cse4 (* 4 ~SIZE~0)) (.cse6 (select |#memory_int| |main_~#b~0.base|))) (and (= (select .cse0 (+ .cse1 |main_~#a~0.offset|)) (select .cse2 (+ .cse3 .cse4 |main_~#a_copy~0.offset| (- 4)))) (= (select .cse5 (+ |main_~#b_copy~0.offset| .cse3 .cse4 (- 4))) (select .cse6 (+ .cse1 |main_~#b~0.offset|))) (<= 1 v_prenex_1) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (select .cse0 |main_~#a~0.offset|) (select .cse5 (+ |main_~#b_copy~0.offset| .cse4 (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select .cse2 (+ .cse4 |main_~#a_copy~0.offset| (- 4))) (select .cse6 |main_~#b~0.offset|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:52,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 134 [2018-11-23 12:21:52,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:52,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 87 [2018-11-23 12:21:52,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-23 12:21:52,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 119 [2018-11-23 12:21:52,372 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:52,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:52,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 12:21:52,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 128 [2018-11-23 12:21:52,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:52,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 144 [2018-11-23 12:21:52,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-11-23 12:21:52,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:21:52,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 116 [2018-11-23 12:21:52,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:52,789 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:52,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-11-23 12:21:52,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,833 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:21:53,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-23 12:21:53,024 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:173, output treesize:347 [2018-11-23 12:21:53,047 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:53,047 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~tmp~0, |main_~#b_copy~0.offset|, v_prenex_1, |main_~#b_copy~0.base|]. (let ((.cse0 (select |v_#memory_int_16| |main_~#b_copy~0.base|)) (.cse1 (* (- 4) v_prenex_1)) (.cse5 (select |v_#memory_int_16| |main_~#a~0.base|)) (.cse4 (* 4 v_prenex_1)) (.cse3 (select |v_#memory_int_16| |main_~#b~0.base|)) (.cse9 (select |v_#memory_int_16| |main_~#a_copy~0.base|)) (.cse2 (* 4 ~SIZE~0))) (and (= (select .cse0 (+ |main_~#b_copy~0.offset| .cse1 .cse2 (- 4))) (select .cse3 (+ .cse4 |main_~#b~0.offset|))) (<= 1 v_prenex_1) (= (select .cse5 |main_~#a~0.offset|) (select .cse0 (+ |main_~#b_copy~0.offset| .cse2 (- 4)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (let ((.cse8 (* 4 main_~i~0))) (let ((.cse7 (+ .cse8 |main_~#b~0.offset|))) (let ((.cse6 (store |v_#memory_int_16| |main_~#a~0.base| (store .cse5 (+ .cse8 |main_~#a~0.offset|) (select .cse3 .cse7))))) (store .cse6 |main_~#b~0.base| (store (select .cse6 |main_~#b~0.base|) .cse7 main_~tmp~0))))) |#memory_int|) (= (select .cse9 (+ .cse1 .cse2 |main_~#a_copy~0.offset| (- 4))) (select .cse5 (+ .cse4 |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select .cse3 |main_~#b~0.offset|) (select .cse9 (+ .cse2 |main_~#a_copy~0.offset| (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)) (= |main_~#a~0.offset| 0))) [2018-11-23 12:21:53,048 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |main_~#b_copy~0.offset|, |main_~#b_copy~0.base|, v_prenex_3, v_prenex_2, v_prenex_4, v_prenex_5, v_prenex_6]. (let ((.cse24 (* 4 main_~i~0)) (.cse2 (select |#memory_int| |main_~#a_copy~0.base|)) (.cse4 (* 4 ~SIZE~0))) (let ((.cse9 (select .cse2 (+ .cse4 |main_~#a_copy~0.offset| (- 4)))) (.cse5 (select |#memory_int| |main_~#b~0.base|)) (.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse20 (+ .cse24 |main_~#b~0.offset|))) (let ((.cse14 (= |main_~#b~0.offset| .cse20)) (.cse6 (= |main_~#a_copy~0.offset| 0)) (.cse7 (< 1 ~SIZE~0)) (.cse8 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|))) (.cse11 (not (= |main_~#b~0.base| |main_~#a~0.base|))) (.cse12 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse10 (select .cse0 (+ .cse24 |main_~#a~0.offset|))) (.cse13 (= |main_~#b~0.offset| 0)) (.cse21 (select .cse0 |main_~#a~0.offset|)) (.cse22 (= .cse9 (select .cse5 |main_~#b~0.offset|))) (.cse15 (= |main_~#a~0.offset| 0))) (or (let ((.cse3 (* (- 4) v_prenex_1)) (.cse1 (* 4 v_prenex_1))) (and (= (select .cse0 (+ .cse1 |main_~#a~0.offset|)) (select .cse2 (+ .cse3 .cse4 |main_~#a_copy~0.offset| (- 4)))) (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| .cse3 .cse4 (- 4))) (select .cse5 (+ .cse1 |main_~#b~0.offset|))) .cse6 .cse7 .cse8 (= .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)) .cse15)) (let ((.cse16 (* 4 v_prenex_3))) (let ((.cse17 (* (- 4) v_prenex_3)) (.cse19 (+ .cse16 |main_~#b~0.offset|)) (.cse18 (select |#memory_int| v_prenex_4))) (and (= (select .cse0 (+ .cse16 |main_~#a~0.offset|)) (select .cse2 (+ .cse17 .cse4 |main_~#a_copy~0.offset| (- 4)))) (= (select .cse18 (+ v_prenex_2 .cse17 .cse4 (- 4))) (select .cse5 .cse19)) (<= 1 v_prenex_3) (not (= .cse19 .cse20)) (not .cse14) .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 (= .cse21 (select .cse18 (+ v_prenex_2 .cse4 (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) .cse22 (not (= v_prenex_4 |main_~#a_copy~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)) .cse15))) (let ((.cse23 (select |#memory_int| v_prenex_6))) (and .cse6 .cse7 .cse8 .cse11 .cse12 (<= 1 main_~i~0) (= (select .cse23 (+ v_prenex_5 (* (- 4) main_~i~0) .cse4 (- 4))) .cse10) .cse13 (= .cse21 (select .cse23 (+ v_prenex_5 .cse4 (- 4)))) (not (= v_prenex_6 |main_~#a~0.base|)) .cse22 (not (= v_prenex_6 |main_~#a_copy~0.base|)) (not (= v_prenex_6 |main_~#b~0.base|)) .cse15)))))) [2018-11-23 12:21:53,302 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-23 12:21:54,031 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-23 12:21:56,583 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2018-11-23 12:21:59,166 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-23 12:21:59,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 142 [2018-11-23 12:21:59,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:59,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:59,588 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:59,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2018-11-23 12:21:59,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:59,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2018-11-23 12:21:59,863 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:59,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-23 12:21:59,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:59,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:59,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:00,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 160 [2018-11-23 12:22:00,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:00,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:00,183 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:00,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2018-11-23 12:22:00,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:00,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 112 [2018-11-23 12:22:00,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:00,426 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:00,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 12:22:00,437 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:00,462 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:00,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:00,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-23 12:22:00,608 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:335, output treesize:198 [2018-11-23 12:22:00,622 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:00,623 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~tmp~0, v_prenex_3, v_prenex_4, v_prenex_2, v_prenex_8, v_prenex_9, v_prenex_6, v_prenex_7, v_prenex_5]. (let ((.cse14 (* 4 ~SIZE~0)) (.cse23 (* 4 main_~i~0))) (let ((.cse0 (= |main_~#a_copy~0.offset| 0)) (.cse1 (< 1 ~SIZE~0)) (.cse7 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|))) (.cse8 (not (= |main_~#b~0.base| |main_~#a~0.base|))) (.cse9 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse5 (+ .cse23 |main_~#a~0.offset|)) (.cse3 (+ .cse23 |main_~#b~0.offset|)) (.cse10 (= |main_~#b~0.offset| 0)) (.cse12 (+ .cse14 |main_~#a_copy~0.offset| (- 4))) (.cse17 (= main_~i~0 0)) (.cse18 (= |main_~#a~0.offset| 0))) (or (let ((.cse4 (select |v_#memory_int_17| |main_~#a~0.base|)) (.cse11 (select |v_#memory_int_17| |main_~#a_copy~0.base|)) (.cse13 (select |v_#memory_int_17| v_prenex_4)) (.cse16 (* (- 4) v_prenex_3)) (.cse6 (select |v_#memory_int_17| |main_~#b~0.base|)) (.cse15 (* 4 v_prenex_3))) (and (<= 1 v_prenex_3) .cse0 .cse1 (= |#memory_int| (let ((.cse2 (store |v_#memory_int_17| |main_~#a~0.base| (store .cse4 .cse5 (select .cse6 .cse3))))) (store .cse2 |main_~#b~0.base| (store (select .cse2 |main_~#b~0.base|) .cse3 main_~tmp~0)))) .cse7 .cse8 .cse9 (not (= v_prenex_4 |main_~#a_copy~0.base|)) .cse10 (= (select .cse6 |main_~#b~0.offset|) (select .cse11 .cse12)) (= (select .cse4 |main_~#a~0.offset|) (select .cse13 (+ v_prenex_2 .cse14 (- 4)))) (= (select .cse4 (+ .cse15 |main_~#a~0.offset|)) (select .cse11 (+ .cse16 .cse14 |main_~#a_copy~0.offset| (- 4)))) (= (select .cse13 (+ v_prenex_2 .cse16 .cse14 (- 4))) (select .cse6 (+ .cse15 |main_~#b~0.offset|))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)) .cse17 .cse18)) (let ((.cse19 (select v_prenex_8 v_prenex_6)) (.cse20 (select v_prenex_8 |main_~#a~0.base|)) (.cse22 (select v_prenex_8 |main_~#b~0.base|))) (and (not (= v_prenex_6 |main_~#b~0.base|)) .cse0 .cse1 (not (= v_prenex_6 |main_~#a~0.base|)) .cse7 .cse8 (not (= v_prenex_6 |main_~#a_copy~0.base|)) .cse9 (<= 1 v_prenex_7) (= (select .cse19 (+ v_prenex_5 (* (- 4) v_prenex_7) .cse14 (- 4))) (select .cse20 (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (= |#memory_int| (let ((.cse21 (store v_prenex_8 |main_~#a~0.base| (store .cse20 .cse5 (select .cse22 .cse3))))) (store .cse21 |main_~#b~0.base| (store (select .cse21 |main_~#b~0.base|) .cse3 v_prenex_9)))) (<= ~SIZE~0 (+ v_prenex_7 1)) .cse10 (= (select .cse19 (+ v_prenex_5 .cse14 (- 4))) (select .cse20 |main_~#a~0.offset|)) (= (select .cse22 |main_~#b~0.offset|) (select (select v_prenex_8 |main_~#a_copy~0.base|) .cse12)) .cse17 .cse18))))) [2018-11-23 12:22:00,623 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_2, v_prenex_3, v_prenex_4, v_prenex_5, v_prenex_7, v_prenex_6]. (let ((.cse9 (select |#memory_int| |main_~#a_copy~0.base|)) (.cse2 (* 4 ~SIZE~0)) (.cse10 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse3 (= |main_~#a_copy~0.offset| 0)) (.cse4 (< 1 ~SIZE~0)) (.cse5 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|))) (.cse6 (= (select .cse9 (+ .cse2 |main_~#a_copy~0.offset| (- 4))) (select .cse10 (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (.cse7 (not (= |main_~#b~0.base| |main_~#a~0.base|))) (.cse8 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse11 (= |main_~#b~0.offset| 0)) (.cse12 (= main_~i~0 0)) (.cse13 (= |main_~#a~0.offset| 0))) (or (let ((.cse1 (* (- 4) v_prenex_3)) (.cse0 (* 4 v_prenex_3))) (and (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#b~0.base|) (+ .cse0 |main_~#b~0.offset|)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 .cse1 .cse2 (- 4)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (select .cse9 (+ .cse1 .cse2 |main_~#a_copy~0.offset| (- 4))) (select .cse10 (+ .cse0 |main_~#a~0.offset|))) .cse11 (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)) .cse12 .cse13)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) .cse2 (- 4))) (select .cse10 (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) .cse3 .cse4 (not (= v_prenex_6 |main_~#a~0.base|)) .cse5 .cse6 (not (= v_prenex_6 |main_~#a_copy~0.base|)) .cse7 .cse8 (not (= |main_~#b~0.base| v_prenex_6)) (<= ~SIZE~0 (+ v_prenex_7 1)) .cse11 .cse12 .cse13)))) [2018-11-23 12:22:01,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 136 [2018-11-23 12:22:01,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 100 [2018-11-23 12:22:01,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:22:01,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 113 [2018-11-23 12:22:01,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 71 [2018-11-23 12:22:01,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-23 12:22:01,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:22:01,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 101 [2018-11-23 12:22:01,459 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:01,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-11-23 12:22:01,471 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:22:01,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 117 [2018-11-23 12:22:01,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 100 [2018-11-23 12:22:01,821 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 12:22:01,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 94 [2018-11-23 12:22:01,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-11-23 12:22:01,954 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-11-23 12:22:02,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-11-23 12:22:02,014 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:02,027 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:02,080 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:22:02,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-11-23 12:22:02,298 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:290, output treesize:300 [2018-11-23 12:22:02,319 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:02,320 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, |main_~#b~0.base|, main_~tmp~0, v_prenex_6, v_prenex_5, v_prenex_7, v_prenex_10, v_prenex_4, v_prenex_12, v_prenex_3, v_prenex_2, v_prenex_11]. (let ((.cse4 (* 4 main_~i~0)) (.cse8 (* 4 ~SIZE~0))) (let ((.cse0 (= |main_~#a_copy~0.offset| 0)) (.cse1 (< 1 ~SIZE~0)) (.cse2 (= main_~i~0 1)) (.cse9 (+ .cse8 |main_~#a_copy~0.offset| (- 4))) (.cse10 (+ .cse4 |main_~#a~0.offset| (- 4))) (.cse7 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse6 (+ .cse4 |main_~#a~0.offset|)) (.cse11 (= |main_~#a~0.offset| 0))) (or (let ((.cse5 (select |v_#memory_int_18| |main_~#a~0.base|))) (and .cse0 .cse1 (not (= v_prenex_6 |main_~#a~0.base|)) .cse2 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= |#memory_int| (let ((.cse3 (store |v_#memory_int_18| |main_~#a~0.base| (store .cse5 .cse6 (select (select |v_#memory_int_18| |main_~#b~0.base|) .cse4))))) (store .cse3 |main_~#b~0.base| (store (select .cse3 |main_~#b~0.base|) .cse4 main_~tmp~0)))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= v_prenex_6 |main_~#a_copy~0.base|)) .cse7 (= (select (select |v_#memory_int_18| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) .cse8 (- 4))) (select .cse5 (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| v_prenex_6)) (= (select (select |v_#memory_int_18| |main_~#a_copy~0.base|) .cse9) (select .cse5 .cse10)) (<= ~SIZE~0 (+ v_prenex_7 1)) .cse11)) (let ((.cse14 (select v_prenex_10 v_prenex_12)) (.cse13 (select v_prenex_10 |main_~#a~0.base|)) (.cse15 (* 4 v_prenex_3)) (.cse12 (select v_prenex_10 |main_~#a_copy~0.base|)) (.cse16 (* (- 4) v_prenex_3))) (and (not (= v_prenex_4 v_prenex_12)) (<= 1 v_prenex_3) .cse0 .cse1 .cse2 (= (select .cse12 .cse9) (select .cse13 .cse10)) .cse7 (= (select .cse14 .cse15) (select (select v_prenex_10 v_prenex_4) (+ v_prenex_2 .cse16 .cse8 (- 4)))) (= |#memory_int| (let ((.cse17 (store v_prenex_10 |main_~#a~0.base| (store .cse13 .cse6 (select .cse14 .cse4))))) (store .cse17 v_prenex_12 (store (select .cse17 v_prenex_12) .cse4 v_prenex_11)))) (not (= |main_~#a_copy~0.base| v_prenex_12)) (= (select .cse13 (+ .cse15 |main_~#a~0.offset|)) (select .cse12 (+ .cse16 .cse8 |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_12 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) .cse11))))) [2018-11-23 12:22:02,320 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_2, v_prenex_3, v_prenex_4, v_prenex_12, v_prenex_5, v_prenex_7, v_prenex_6, v_prenex_13, v_prenex_14]. (let ((.cse8 (select |#memory_int| |main_~#a_copy~0.base|)) (.cse2 (* 4 ~SIZE~0)) (.cse9 (select |#memory_int| |main_~#a~0.base|)) (.cse10 (* 4 main_~i~0))) (let ((.cse3 (= |main_~#a_copy~0.offset| 0)) (.cse4 (< 1 ~SIZE~0)) (.cse5 (= main_~i~0 1)) (.cse6 (= (select .cse8 (+ .cse2 |main_~#a_copy~0.offset| (- 4))) (select .cse9 (+ .cse10 |main_~#a~0.offset| (- 4))))) (.cse7 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse11 (= |main_~#a~0.offset| 0))) (or (let ((.cse1 (* (- 4) v_prenex_3)) (.cse0 (* 4 v_prenex_3))) (and (= (select (select |#memory_int| v_prenex_12) .cse0) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 .cse1 .cse2 (- 4)))) (<= 1 v_prenex_3) .cse3 .cse4 .cse5 .cse6 .cse7 (= (select .cse8 (+ .cse1 .cse2 |main_~#a_copy~0.offset| (- 4))) (select .cse9 (+ .cse0 |main_~#a~0.offset|))) (not (= |main_~#a_copy~0.base| v_prenex_12)) (not (= v_prenex_12 |main_~#a~0.base|)) (not (= v_prenex_12 v_prenex_4)) (not (= .cse0 .cse10)) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) .cse11)) (and .cse3 .cse4 .cse5 .cse6 (<= ~SIZE~0 (+ main_~i~0 1)) .cse7 .cse11) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) .cse2 (- 4))) (select .cse9 (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) .cse3 .cse4 (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) .cse5 .cse6 (not (= v_prenex_6 |main_~#a_copy~0.base|)) .cse7 .cse11) (and .cse3 .cse4 .cse5 .cse6 (not (= |main_~#a_copy~0.base| v_prenex_13)) (= (select (select |#memory_int| v_prenex_13) (+ (* (- 4) main_~i~0) v_prenex_14 .cse2 (- 4))) (select .cse9 (+ .cse10 |main_~#a~0.offset|))) (not (= v_prenex_13 |main_~#a~0.base|)) .cse7 .cse11)))) [2018-11-23 12:22:05,678 WARN L180 SmtUtils]: Spent 2.99 s on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 12:22:06,326 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-23 12:22:06,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 12:22:06,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-11-23 12:22:06,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:22:06,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3 [2018-11-23 12:22:06,657 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:06,658 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a_copy~0.base|, ~SIZE~0, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 0)) (.cse1 (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) (- 4))))) (and (= |main_#t~mem12| .cse0) (= .cse0 .cse1) (< 1 ~SIZE~0) (= |main_#t~mem13| .cse1) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)))) [2018-11-23 12:22:06,658 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem12| |main_#t~mem13|) [2018-11-23 12:22:06,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2018-11-23 12:22:06,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {1098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1098#true} is VALID [2018-11-23 12:22:06,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2018-11-23 12:22:06,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #84#return; {1098#true} is VALID [2018-11-23 12:22:06,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret14 := main(); {1098#true} is VALID [2018-11-23 12:22:06,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {1098#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1098#true} is VALID [2018-11-23 12:22:06,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {1098#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {1140#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (= |main_~#a~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))} is VALID [2018-11-23 12:22:06,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {1140#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (= |main_~#a~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1144#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= main_~i~0 0) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (= |main_~#a~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))} is VALID [2018-11-23 12:22:06,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {1144#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (= main_~i~0 0) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (= |main_~#a~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1148#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= |main_~#b~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (= |main_~#a~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))} is VALID [2018-11-23 12:22:06,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {1148#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= |main_~#b~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (= |main_~#a~0.offset| 0) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1152#(and (exists ((|main_~#b_copy~0.offset| Int) (main_~i~0 Int) (|main_~#b_copy~0.base| Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {1152#(and (exists ((|main_~#b_copy~0.offset| Int) (main_~i~0 Int) (|main_~#b_copy~0.base| Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1152#(and (exists ((|main_~#b_copy~0.offset| Int) (main_~i~0 Int) (|main_~#b_copy~0.base| Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {1152#(and (exists ((|main_~#b_copy~0.offset| Int) (main_~i~0 Int) (|main_~#b_copy~0.base| Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1152#(and (exists ((|main_~#b_copy~0.offset| Int) (main_~i~0 Int) (|main_~#b_copy~0.base| Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#(and (exists ((|main_~#b_copy~0.offset| Int) (main_~i~0 Int) (|main_~#b_copy~0.base| Int)) (and (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) main_~i~0) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~i~0) |main_~#b~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1162#(and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {1162#(and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|))) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1166#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {1166#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1166#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {1166#(and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1173#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= 0 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= (* 4 v_prenex_3) (* 4 main_~i~0))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (<= 1 main_~i~0) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (not (= v_prenex_6 |main_~#a~0.base|)) (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= 0 (* 4 main_~i~0)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:06,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {1173#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= 0 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= (* 4 v_prenex_3) (* 4 main_~i~0))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (<= 1 main_~i~0) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (not (= v_prenex_6 |main_~#a~0.base|)) (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) main_~i~0) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= 0 (* 4 main_~i~0)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1177#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (<= 1 v_prenex_7) (not (= v_prenex_6 |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|)) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)) (<= main_~i~0 (+ v_prenex_7 1)))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:06,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {1177#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (<= 1 v_prenex_7) (not (= v_prenex_6 |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|)) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)) (<= main_~i~0 (+ v_prenex_7 1)))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((|main_~#b_copy~0.offset| Int) (v_prenex_1 Int) (|main_~#b_copy~0.base| Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_1) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (= (select (select |#memory_int| |main_~#b_copy~0.base|) (+ |main_~#b_copy~0.offset| (* (- 4) v_prenex_1) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_1) |main_~#b~0.offset|))) (<= 1 v_prenex_1) (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#a_copy~0.base|)) (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (<= main_~i~0 1) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} assume !(~i~0 < ~SIZE~0); {1181#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (<= 1 v_prenex_7) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|)) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:06,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (<= 1 v_prenex_7) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|)) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a~0.offset| 0)))} ~i~0 := 0; {1185#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (<= 1 v_prenex_7) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|)) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:06,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {1185#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4)))) (not (= v_prenex_4 |main_~#a_copy~0.base|)) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (not (= v_prenex_6 |main_~#b~0.base|)) (<= 1 v_prenex_7) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|)) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* 4 ~SIZE~0) (- 4)))) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a~0.offset| 0)))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1189#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| v_prenex_6)) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:08,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {1189#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| v_prenex_6)) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1193#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| v_prenex_6)) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} is UNKNOWN [2018-11-23 12:22:08,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {1193#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 v_prenex_3) |main_~#b~0.offset|)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)) (not (= v_prenex_4 |main_~#b~0.base|)))) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= |main_~#b~0.base| v_prenex_6)) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1197#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (<= ~SIZE~0 (+ main_~i~0 1)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_13)) (= (select (select |#memory_int| v_prenex_13) (+ (* (- 4) main_~i~0) v_prenex_14 (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_12) (* 4 v_prenex_3)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (not (= v_prenex_12 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_12)) (not (= v_prenex_12 v_prenex_4)) (not (= (* 4 v_prenex_3) (* 4 main_~i~0))) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:08,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {1197#(or (and (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (<= ~SIZE~0 (+ main_~i~0 1)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_13)) (= (select (select |#memory_int| v_prenex_13) (+ (* (- 4) main_~i~0) v_prenex_14 (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_12) (* 4 v_prenex_3)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (not (= v_prenex_12 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_12)) (not (= v_prenex_12 v_prenex_4)) (not (= (* 4 v_prenex_3) (* 4 main_~i~0))) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)))) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| (- 4)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1201#(or (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_12) (* 4 v_prenex_3)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (not (= v_prenex_12 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_12)) (not (= v_prenex_12 v_prenex_4)) (not (= (* 4 v_prenex_3) 4)) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_14 (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= v_prenex_13 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_13)))) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:22:08,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {1201#(or (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (and (= (select (select |#memory_int| v_prenex_6) (+ v_prenex_5 (* (- 4) v_prenex_7) (* 4 ~SIZE~0) (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (not (= v_prenex_6 |main_~#a~0.base|)) (<= ~SIZE~0 (+ v_prenex_7 1)) (not (= v_prenex_6 |main_~#a_copy~0.base|)))) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int)) (and (= (select (select |#memory_int| v_prenex_12) (* 4 v_prenex_3)) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* (- 4) v_prenex_3) (* 4 ~SIZE~0) (- 4)))) (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* (- 4) v_prenex_3) (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_3) |main_~#a~0.offset|))) (<= 1 v_prenex_3) (not (= v_prenex_12 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_12)) (not (= v_prenex_12 v_prenex_4)) (not (= (* 4 v_prenex_3) 4)) (not (= |main_~#a_copy~0.base| v_prenex_4)) (not (= v_prenex_4 |main_~#a~0.base|)))) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_14 (* 4 ~SIZE~0) (- 8))) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= v_prenex_13 |main_~#a~0.base|)) (not (= |main_~#a_copy~0.base| v_prenex_13)))) (<= main_~i~0 2) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0)))} assume !(~i~0 < ~SIZE~0); {1205#(and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:08,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {1205#(and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1209#(and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:08,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {1209#(and (= (select (select |#memory_int| |main_~#a_copy~0.base|) (+ (* 4 ~SIZE~0) |main_~#a_copy~0.offset| (- 4))) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a_copy~0.offset| 0) (< 1 ~SIZE~0) (<= ~SIZE~0 2) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {1116#(= |main_#t~mem13| |main_#t~mem12|)} is VALID [2018-11-23 12:22:08,934 INFO L256 TraceCheckUtils]: 26: Hoare triple {1116#(= |main_#t~mem13| |main_#t~mem12|)} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1216#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:08,934 INFO L273 TraceCheckUtils]: 27: Hoare triple {1216#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1220#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:08,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {1220#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1099#false} is VALID [2018-11-23 12:22:08,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2018-11-23 12:22:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:08,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:08,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2018-11-23 12:22:08,972 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2018-11-23 12:22:08,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:08,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:22:09,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:09,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:22:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:22:09,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1238, Unknown=1, NotChecked=0, Total=1482 [2018-11-23 12:22:09,283 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 39 states. [2018-11-23 12:22:12,037 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-11-23 12:22:12,397 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-23 12:22:12,732 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2018-11-23 12:22:15,099 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-11-23 12:22:15,479 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2018-11-23 12:22:15,866 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-11-23 12:22:16,442 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2018-11-23 12:22:17,292 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 94 [2018-11-23 12:22:19,585 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 110 [2018-11-23 12:22:22,282 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2018-11-23 12:22:23,522 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 33 [2018-11-23 12:22:25,471 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 46 [2018-11-23 12:22:26,109 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-11-23 12:22:26,763 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 35 [2018-11-23 12:22:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:27,114 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-23 12:22:27,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:22:27,114 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2018-11-23 12:22:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:22:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2018-11-23 12:22:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:22:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2018-11-23 12:22:27,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 83 transitions. [2018-11-23 12:22:27,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:27,542 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:22:27,543 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:22:27,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=625, Invalid=3034, Unknown=1, NotChecked=0, Total=3660 [2018-11-23 12:22:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:22:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-11-23 12:22:27,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:27,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 52 states. [2018-11-23 12:22:27,794 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 52 states. [2018-11-23 12:22:27,794 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 52 states. [2018-11-23 12:22:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:27,800 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 12:22:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-23 12:22:27,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:27,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:27,802 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 74 states. [2018-11-23 12:22:27,802 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 74 states. [2018-11-23 12:22:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:27,806 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 12:22:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-23 12:22:27,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:27,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:27,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:27,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:22:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-23 12:22:27,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2018-11-23 12:22:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:27,810 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-23 12:22:27,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:22:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 12:22:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:22:27,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:27,811 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:27,812 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:27,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash -313383408, now seen corresponding path program 3 times [2018-11-23 12:22:27,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:27,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:27,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:28,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1604#true} is VALID [2018-11-23 12:22:28,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {1604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1604#true} is VALID [2018-11-23 12:22:28,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2018-11-23 12:22:28,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #84#return; {1604#true} is VALID [2018-11-23 12:22:28,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret14 := main(); {1604#true} is VALID [2018-11-23 12:22:28,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {1604#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1604#true} is VALID [2018-11-23 12:22:28,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {1604#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {1606#(= main_~i~0 0)} is VALID [2018-11-23 12:22:28,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {1606#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1606#(= main_~i~0 0)} is VALID [2018-11-23 12:22:28,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {1606#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1607#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:28,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {1607#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1607#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:28,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {1607#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1608#(<= main_~i~0 2)} is VALID [2018-11-23 12:22:28,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {1608#(<= main_~i~0 2)} assume !(~i~0 < ~SIZE~0); {1609#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:28,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {1609#(<= ~SIZE~0 2)} ~i~0 := 0; {1610#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:22:28,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {1610#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1610#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:22:28,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {1610#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1611#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:22:28,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {1611#(<= ~SIZE~0 (+ main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1611#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:22:28,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {1611#(<= ~SIZE~0 (+ main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1612#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-23 12:22:28,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {1612#(<= ~SIZE~0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1605#false} is VALID [2018-11-23 12:22:28,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {1605#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1605#false} is VALID [2018-11-23 12:22:28,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {1605#false} assume !(~i~0 < ~SIZE~0); {1605#false} is VALID [2018-11-23 12:22:28,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {1605#false} ~i~0 := 0; {1605#false} is VALID [2018-11-23 12:22:28,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1605#false} is VALID [2018-11-23 12:22:28,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1605#false} is VALID [2018-11-23 12:22:28,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1605#false} is VALID [2018-11-23 12:22:28,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {1605#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1605#false} is VALID [2018-11-23 12:22:28,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {1605#false} assume !(~i~0 < ~SIZE~0); {1605#false} is VALID [2018-11-23 12:22:28,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {1605#false} ~i~0 := 0; {1605#false} is VALID [2018-11-23 12:22:28,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {1605#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {1605#false} is VALID [2018-11-23 12:22:28,016 INFO L256 TraceCheckUtils]: 28: Hoare triple {1605#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1605#false} is VALID [2018-11-23 12:22:28,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {1605#false} ~cond := #in~cond; {1605#false} is VALID [2018-11-23 12:22:28,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {1605#false} assume 0 == ~cond; {1605#false} is VALID [2018-11-23 12:22:28,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2018-11-23 12:22:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:22:28,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:28,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:22:28,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:22:28,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:28,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:28,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1604#true} is VALID [2018-11-23 12:22:28,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {1604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1604#true} is VALID [2018-11-23 12:22:28,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2018-11-23 12:22:28,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #84#return; {1604#true} is VALID [2018-11-23 12:22:28,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret14 := main(); {1604#true} is VALID [2018-11-23 12:22:28,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {1604#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1604#true} is VALID [2018-11-23 12:22:28,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {1604#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {1634#(<= main_~i~0 0)} is VALID [2018-11-23 12:22:28,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {1634#(<= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1634#(<= main_~i~0 0)} is VALID [2018-11-23 12:22:28,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {1634#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1607#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:28,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {1607#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1607#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:28,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {1607#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1608#(<= main_~i~0 2)} is VALID [2018-11-23 12:22:28,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {1608#(<= main_~i~0 2)} assume !(~i~0 < ~SIZE~0); {1609#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:28,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {1609#(<= ~SIZE~0 2)} ~i~0 := 0; {1653#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:28,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {1653#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1653#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:28,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1653#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1660#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:28,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1660#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1660#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:28,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1660#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1667#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:28,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1667#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1605#false} is VALID [2018-11-23 12:22:28,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {1605#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1605#false} is VALID [2018-11-23 12:22:28,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {1605#false} assume !(~i~0 < ~SIZE~0); {1605#false} is VALID [2018-11-23 12:22:28,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {1605#false} ~i~0 := 0; {1605#false} is VALID [2018-11-23 12:22:28,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1605#false} is VALID [2018-11-23 12:22:28,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1605#false} is VALID [2018-11-23 12:22:28,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#false} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1605#false} is VALID [2018-11-23 12:22:28,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {1605#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1605#false} is VALID [2018-11-23 12:22:28,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {1605#false} assume !(~i~0 < ~SIZE~0); {1605#false} is VALID [2018-11-23 12:22:28,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {1605#false} ~i~0 := 0; {1605#false} is VALID [2018-11-23 12:22:28,473 INFO L273 TraceCheckUtils]: 27: Hoare triple {1605#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {1605#false} is VALID [2018-11-23 12:22:28,473 INFO L256 TraceCheckUtils]: 28: Hoare triple {1605#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1605#false} is VALID [2018-11-23 12:22:28,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {1605#false} ~cond := #in~cond; {1605#false} is VALID [2018-11-23 12:22:28,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {1605#false} assume 0 == ~cond; {1605#false} is VALID [2018-11-23 12:22:28,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2018-11-23 12:22:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:22:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:28,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 12:22:28,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-23 12:22:28,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:28,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:22:28,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:28,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:22:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:22:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:22:28,539 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 13 states. [2018-11-23 12:22:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:29,826 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-11-23 12:22:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:22:29,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-23 12:22:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:22:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2018-11-23 12:22:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:22:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2018-11-23 12:22:29,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 116 transitions. [2018-11-23 12:22:29,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:29,994 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:22:29,994 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:22:29,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:22:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:22:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2018-11-23 12:22:30,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:30,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 71 states. [2018-11-23 12:22:30,347 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 71 states. [2018-11-23 12:22:30,347 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 71 states. [2018-11-23 12:22:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:30,351 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 12:22:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 12:22:30,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:30,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:30,352 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 89 states. [2018-11-23 12:22:30,352 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 89 states. [2018-11-23 12:22:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:30,356 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 12:22:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 12:22:30,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:30,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:30,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:30,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:22:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-11-23 12:22:30,360 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 32 [2018-11-23 12:22:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:30,360 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-11-23 12:22:30,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:22:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-11-23 12:22:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:22:30,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:30,361 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:30,362 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:30,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2007469070, now seen corresponding path program 4 times [2018-11-23 12:22:30,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:30,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:30,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:31,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {2171#true} call ULTIMATE.init(); {2171#true} is VALID [2018-11-23 12:22:31,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {2171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2171#true} is VALID [2018-11-23 12:22:31,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {2171#true} assume true; {2171#true} is VALID [2018-11-23 12:22:31,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2171#true} {2171#true} #84#return; {2171#true} is VALID [2018-11-23 12:22:31,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {2171#true} call #t~ret14 := main(); {2171#true} is VALID [2018-11-23 12:22:31,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {2171#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2171#true} is VALID [2018-11-23 12:22:31,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {2171#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {2173#(= main_~i~0 0)} is VALID [2018-11-23 12:22:31,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {2173#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2173#(= main_~i~0 0)} is VALID [2018-11-23 12:22:31,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {2173#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2174#(<= 1 main_~i~0)} is VALID [2018-11-23 12:22:31,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {2174#(<= 1 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2174#(<= 1 main_~i~0)} is VALID [2018-11-23 12:22:31,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {2174#(<= 1 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2175#(<= 2 main_~i~0)} is VALID [2018-11-23 12:22:31,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {2175#(<= 2 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {2176#(<= 3 ~SIZE~0)} ~i~0 := 0; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {2176#(<= 3 ~SIZE~0)} ~i~0 := 0; {2177#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:31,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {2177#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2177#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:31,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {2177#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2178#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-23 12:22:31,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {2178#(<= (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2178#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-23 12:22:31,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {2178#(<= (+ main_~i~0 2) ~SIZE~0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2179#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-23 12:22:31,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {2179#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2172#false} is VALID [2018-11-23 12:22:31,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {2172#false} ~i~0 := 0; {2172#false} is VALID [2018-11-23 12:22:31,098 INFO L273 TraceCheckUtils]: 29: Hoare triple {2172#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {2172#false} is VALID [2018-11-23 12:22:31,098 INFO L256 TraceCheckUtils]: 30: Hoare triple {2172#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {2172#false} is VALID [2018-11-23 12:22:31,099 INFO L273 TraceCheckUtils]: 31: Hoare triple {2172#false} ~cond := #in~cond; {2172#false} is VALID [2018-11-23 12:22:31,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {2172#false} assume 0 == ~cond; {2172#false} is VALID [2018-11-23 12:22:31,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {2172#false} assume !false; {2172#false} is VALID [2018-11-23 12:22:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:22:31,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:31,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:22:31,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:22:31,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:31,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:31,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {2171#true} call ULTIMATE.init(); {2171#true} is VALID [2018-11-23 12:22:31,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {2171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2171#true} is VALID [2018-11-23 12:22:31,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {2171#true} assume true; {2171#true} is VALID [2018-11-23 12:22:31,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2171#true} {2171#true} #84#return; {2171#true} is VALID [2018-11-23 12:22:31,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {2171#true} call #t~ret14 := main(); {2171#true} is VALID [2018-11-23 12:22:31,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {2171#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2171#true} is VALID [2018-11-23 12:22:31,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {2171#true} assume ~SIZE~0 > 1;havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~i~0 := 0; {2201#(<= 0 main_~i~0)} is VALID [2018-11-23 12:22:31,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {2201#(<= 0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2201#(<= 0 main_~i~0)} is VALID [2018-11-23 12:22:31,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {2201#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2174#(<= 1 main_~i~0)} is VALID [2018-11-23 12:22:31,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {2174#(<= 1 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2174#(<= 1 main_~i~0)} is VALID [2018-11-23 12:22:31,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {2174#(<= 1 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2175#(<= 2 main_~i~0)} is VALID [2018-11-23 12:22:31,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {2175#(<= 2 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem3 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem3;call #t~mem4 := read~int(~#b_copy~0.base, ~#b_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4);call write~int(#t~mem4, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {2176#(<= 3 ~SIZE~0)} ~i~0 := 0; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem7;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {2176#(<= 3 ~SIZE~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {2176#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2176#(<= 3 ~SIZE~0)} is VALID [2018-11-23 12:22:31,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {2176#(<= 3 ~SIZE~0)} ~i~0 := 0; {2250#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} is VALID [2018-11-23 12:22:31,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {2250#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2250#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} is VALID [2018-11-23 12:22:31,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {2250#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2257#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} is VALID [2018-11-23 12:22:31,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {2257#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem10;call write~int(~tmp~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2257#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} is VALID [2018-11-23 12:22:31,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {2257#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2264#(and (<= main_~i~0 2) (<= 3 ~SIZE~0))} is VALID [2018-11-23 12:22:31,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#(and (<= main_~i~0 2) (<= 3 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {2172#false} is VALID [2018-11-23 12:22:31,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {2172#false} ~i~0 := 0; {2172#false} is VALID [2018-11-23 12:22:31,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {2172#false} assume !!(~i~0 < ~SIZE~0);call #t~mem12 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~#a_copy~0.base, ~#a_copy~0.offset + 4 * (~SIZE~0 - ~i~0 - 1), 4); {2172#false} is VALID [2018-11-23 12:22:31,317 INFO L256 TraceCheckUtils]: 30: Hoare triple {2172#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {2172#false} is VALID [2018-11-23 12:22:31,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {2172#false} ~cond := #in~cond; {2172#false} is VALID [2018-11-23 12:22:31,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {2172#false} assume 0 == ~cond; {2172#false} is VALID [2018-11-23 12:22:31,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {2172#false} assume !false; {2172#false} is VALID [2018-11-23 12:22:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:22:31,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:31,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 12:22:31,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 12:22:31,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:31,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:22:31,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:31,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:22:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:22:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:22:31,381 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 13 states. [2018-11-23 12:22:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:32,940 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-23 12:22:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:22:32,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 12:22:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:22:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 104 transitions. [2018-11-23 12:22:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:22:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 104 transitions. [2018-11-23 12:22:32,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 104 transitions. [2018-11-23 12:22:33,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:33,066 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:22:33,066 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:22:33,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:22:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:22:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-11-23 12:22:33,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:33,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 66 states. [2018-11-23 12:22:33,480 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 66 states. [2018-11-23 12:22:33,480 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 66 states. [2018-11-23 12:22:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:33,483 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 12:22:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 12:22:33,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:33,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:33,484 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 82 states. [2018-11-23 12:22:33,484 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 82 states. [2018-11-23 12:22:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:33,487 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 12:22:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 12:22:33,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:33,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:33,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:33,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:22:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-23 12:22:33,490 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 34 [2018-11-23 12:22:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:33,491 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-23 12:22:33,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:22:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 12:22:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:22:33,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:33,491 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:33,492 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:33,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash 649202188, now seen corresponding path program 5 times [2018-11-23 12:22:33,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:33,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:33,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:34,153 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2018-11-23 12:22:34,365 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2018-11-23 12:22:35,051 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 45 [2018-11-23 12:22:35,229 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:22:35,233 INFO L168 Benchmark]: Toolchain (without parser) took 56686.21 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -243.2 MB). Peak memory consumption was 868.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:22:35,234 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:22:35,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:22:35,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:22:35,236 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:22:35,236 INFO L168 Benchmark]: RCFGBuilder took 1032.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:22:35,237 INFO L168 Benchmark]: TraceAbstraction took 55237.52 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 393.2 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 497.7 MB). Peak memory consumption was 890.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:22:35,239 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 341.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1032.79 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55237.52 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 393.2 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 497.7 MB). Peak memory consumption was 890.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...