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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:29:17,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:29:17,942 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:29:17,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:29:17,955 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:29:17,956 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:29:17,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:29:17,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:29:17,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:29:17,962 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:29:17,963 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:29:17,963 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:29:17,964 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:29:17,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:29:17,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:29:17,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:29:17,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:29:17,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:29:17,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:29:17,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:29:17,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:29:17,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:29:17,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:29:17,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:29:17,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:29:17,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:29:17,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:29:17,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:29:17,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:29:17,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:29:17,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:29:17,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:29:17,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:29:17,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:29:17,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:29:17,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:29:17,990 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:29:18,017 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:29:18,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:29:18,018 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:29:18,019 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:29:18,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:29:18,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:29:18,020 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:29:18,020 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:29:18,020 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:29:18,020 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:29:18,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:29:18,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:29:18,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:29:18,021 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:29:18,021 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:29:18,022 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:29:18,022 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:29:18,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:29:18,022 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:29:18,022 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:29:18,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:29:18,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:29:18,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:29:18,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:29:18,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:29:18,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:29:18,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:29:18,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:29:18,024 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:29:18,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:29:18,025 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:29:18,025 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:29:18,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:29:18,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:29:18,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:29:18,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:29:18,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:29:18,105 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:29:18,106 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 10:29:18,175 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e3e14ad8/0b7acb09811d485dabc6fa305b1f40b5/FLAG267fbb735 [2018-11-23 10:29:18,629 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:29:18,630 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2_true-unreach-call.i [2018-11-23 10:29:18,635 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e3e14ad8/0b7acb09811d485dabc6fa305b1f40b5/FLAG267fbb735 [2018-11-23 10:29:19,021 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e3e14ad8/0b7acb09811d485dabc6fa305b1f40b5 [2018-11-23 10:29:19,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:29:19,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:29:19,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:29:19,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:29:19,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:29:19,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b138f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19, skipping insertion in model container [2018-11-23 10:29:19,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:29:19,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:29:19,307 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:29:19,312 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:29:19,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:29:19,373 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:29:19,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19 WrapperNode [2018-11-23 10:29:19,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:29:19,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:29:19,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:29:19,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:29:19,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:29:19,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:29:19,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:29:19,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:29:19,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (1/1) ... [2018-11-23 10:29:19,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:29:19,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:29:19,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:29:19,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:29:19,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (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 10:29:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:29:19,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:29:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:29:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:29:19,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:29:19,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:29:19,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:29:19,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:29:19,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:29:19,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:29:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:29:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:29:20,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:29:20,475 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 10:29:20,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:20 BoogieIcfgContainer [2018-11-23 10:29:20,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:29:20,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:29:20,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:29:20,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:29:20,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:29:19" (1/3) ... [2018-11-23 10:29:20,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ab3d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:20, skipping insertion in model container [2018-11-23 10:29:20,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:19" (2/3) ... [2018-11-23 10:29:20,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ab3d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:20, skipping insertion in model container [2018-11-23 10:29:20,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:20" (3/3) ... [2018-11-23 10:29:20,487 INFO L112 eAbstractionObserver]: Analyzing ICFG revcpyswp2_true-unreach-call.i [2018-11-23 10:29:20,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:29:20,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:29:20,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:29:20,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:29:20,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:29:20,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:29:20,559 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:29:20,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:29:20,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:29:20,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:29:20,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:29:20,560 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:29:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 10:29:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:29:20,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:20,583 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 10:29:20,585 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:20,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash -66205200, now seen corresponding path program 1 times [2018-11-23 10:29:20,595 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:20,596 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:20,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:20,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:20,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 10:29:20,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {35#true} is VALID [2018-11-23 10:29:20,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 10:29:20,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #84#return; {35#true} is VALID [2018-11-23 10:29:20,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret14 := main(); {35#true} is VALID [2018-11-23 10:29:20,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {35#true} is VALID [2018-11-23 10:29:20,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {35#true} is VALID [2018-11-23 10:29:20,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 10:29:20,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} ~i~0 := 0bv32; {36#false} is VALID [2018-11-23 10:29:20,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 10:29:20,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} ~i~0 := 0bv32; {36#false} is VALID [2018-11-23 10:29:20,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 10:29:20,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} ~i~0 := 0bv32; {36#false} is VALID [2018-11-23 10:29:20,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {36#false} is VALID [2018-11-23 10:29:20,925 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {36#false} is VALID [2018-11-23 10:29:20,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 10:29:20,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume 0bv32 == ~cond; {36#false} is VALID [2018-11-23 10:29:20,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 10:29:20,929 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 10:29:20,930 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:20,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:29:20,948 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 10:29:20,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:20,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:29:21,056 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 10:29:21,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:29:21,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:29:21,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:29:21,069 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 10:29:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:21,275 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-11-23 10:29:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:29:21,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 10:29:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:29:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:29:21,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 10:29:21,581 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 10:29:21,593 INFO L225 Difference]: With dead ends: 55 [2018-11-23 10:29:21,593 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:29:21,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 10:29:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:29:21,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:29:21,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:21,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:29:21,648 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:29:21,649 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:29:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:21,653 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 10:29:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:29:21,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:21,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:21,655 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:29:21,655 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:29:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:21,659 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 10:29:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:29:21,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:21,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:21,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:21,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:29:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 10:29:21,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2018-11-23 10:29:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:21,666 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 10:29:21,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:29:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:29:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:29:21,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:21,667 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 10:29:21,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -944661538, now seen corresponding path program 1 times [2018-11-23 10:29:21,669 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:21,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:22,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {248#true} is VALID [2018-11-23 10:29:22,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {248#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {248#true} is VALID [2018-11-23 10:29:22,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2018-11-23 10:29:22,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #84#return; {248#true} is VALID [2018-11-23 10:29:22,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret14 := main(); {248#true} is VALID [2018-11-23 10:29:22,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {248#true} is VALID [2018-11-23 10:29:22,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {248#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {271#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:22,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {271#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {249#false} is VALID [2018-11-23 10:29:22,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#false} ~i~0 := 0bv32; {249#false} is VALID [2018-11-23 10:29:22,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {249#false} assume !~bvslt32(~i~0, ~SIZE~0); {249#false} is VALID [2018-11-23 10:29:22,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {249#false} ~i~0 := 0bv32; {249#false} is VALID [2018-11-23 10:29:22,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {249#false} assume !~bvslt32(~i~0, ~SIZE~0); {249#false} is VALID [2018-11-23 10:29:22,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {249#false} ~i~0 := 0bv32; {249#false} is VALID [2018-11-23 10:29:22,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {249#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {249#false} is VALID [2018-11-23 10:29:22,189 INFO L256 TraceCheckUtils]: 14: Hoare triple {249#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {249#false} is VALID [2018-11-23 10:29:22,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {249#false} ~cond := #in~cond; {249#false} is VALID [2018-11-23 10:29:22,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {249#false} assume 0bv32 == ~cond; {249#false} is VALID [2018-11-23 10:29:22,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {249#false} assume !false; {249#false} is VALID [2018-11-23 10:29:22,191 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 10:29:22,192 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:22,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:22,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:29:22,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:29:22,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:22,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:29:22,245 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 10:29:22,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:29:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:29:22,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:29:22,246 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-23 10:29:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:22,869 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 10:29:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:29:22,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:29:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 10:29:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 10:29:22,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2018-11-23 10:29:23,059 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 10:29:23,061 INFO L225 Difference]: With dead ends: 45 [2018-11-23 10:29:23,061 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:29:23,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 10:29:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:29:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 10:29:23,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:23,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 10:29:23,078 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 10:29:23,079 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 10:29:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:23,084 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 10:29:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 10:29:23,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:23,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:23,085 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 10:29:23,085 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 10:29:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:23,090 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 10:29:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 10:29:23,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:23,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:23,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:23,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:29:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 10:29:23,094 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2018-11-23 10:29:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:23,095 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 10:29:23,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:29:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:29:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:29:23,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:23,096 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 10:29:23,096 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:23,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2028063140, now seen corresponding path program 1 times [2018-11-23 10:29:23,098 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:23,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:23,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 10:29:23,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {459#true} is VALID [2018-11-23 10:29:23,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 10:29:23,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #84#return; {459#true} is VALID [2018-11-23 10:29:23,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret14 := main(); {459#true} is VALID [2018-11-23 10:29:23,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {459#true} is VALID [2018-11-23 10:29:23,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {459#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {482#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:23,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {482#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {482#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:23,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {482#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {489#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:23,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {489#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {460#false} is VALID [2018-11-23 10:29:23,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#false} ~i~0 := 0bv32; {460#false} is VALID [2018-11-23 10:29:23,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#false} assume !~bvslt32(~i~0, ~SIZE~0); {460#false} is VALID [2018-11-23 10:29:23,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#false} ~i~0 := 0bv32; {460#false} is VALID [2018-11-23 10:29:23,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {460#false} assume !~bvslt32(~i~0, ~SIZE~0); {460#false} is VALID [2018-11-23 10:29:23,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#false} ~i~0 := 0bv32; {460#false} is VALID [2018-11-23 10:29:23,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {460#false} is VALID [2018-11-23 10:29:23,351 INFO L256 TraceCheckUtils]: 16: Hoare triple {460#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {460#false} is VALID [2018-11-23 10:29:23,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2018-11-23 10:29:23,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#false} assume 0bv32 == ~cond; {460#false} is VALID [2018-11-23 10:29:23,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 10:29:23,354 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 10:29:23,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:23,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 10:29:23,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#false} assume 0bv32 == ~cond; {460#false} is VALID [2018-11-23 10:29:23,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2018-11-23 10:29:23,527 INFO L256 TraceCheckUtils]: 16: Hoare triple {460#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {460#false} is VALID [2018-11-23 10:29:23,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {460#false} is VALID [2018-11-23 10:29:23,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#false} ~i~0 := 0bv32; {460#false} is VALID [2018-11-23 10:29:23,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {460#false} assume !~bvslt32(~i~0, ~SIZE~0); {460#false} is VALID [2018-11-23 10:29:23,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#false} ~i~0 := 0bv32; {460#false} is VALID [2018-11-23 10:29:23,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#false} assume !~bvslt32(~i~0, ~SIZE~0); {460#false} is VALID [2018-11-23 10:29:23,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#false} ~i~0 := 0bv32; {460#false} is VALID [2018-11-23 10:29:23,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {553#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {460#false} is VALID [2018-11-23 10:29:23,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {553#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-23 10:29:23,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:23,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {459#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:23,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {459#true} is VALID [2018-11-23 10:29:23,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret14 := main(); {459#true} is VALID [2018-11-23 10:29:23,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #84#return; {459#true} is VALID [2018-11-23 10:29:23,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 10:29:23,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {459#true} is VALID [2018-11-23 10:29:23,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 10:29:23,548 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 10:29:23,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:23,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:29:23,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 10:29:23,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:23,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:29:23,616 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 10:29:23,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:29:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:29:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:23,617 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-23 10:29:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:24,475 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 10:29:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:29:24,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 10:29:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 10:29:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 10:29:24,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-23 10:29:24,584 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 10:29:24,586 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:29:24,587 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 10:29:24,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 10:29:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 10:29:24,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:24,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 10:29:24,605 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 10:29:24,605 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 10:29:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:24,609 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 10:29:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 10:29:24,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:24,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:24,611 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 10:29:24,611 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 10:29:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:24,615 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 10:29:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 10:29:24,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:24,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:24,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:24,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 10:29:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 10:29:24,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-11-23 10:29:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:24,618 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 10:29:24,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:29:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:29:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:29:24,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:24,620 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 10:29:24,620 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:24,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:24,620 INFO L82 PathProgramCache]: Analyzing trace with hash 500050266, now seen corresponding path program 2 times [2018-11-23 10:29:24,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:24,621 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:24,640 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:24,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:29:24,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:24,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:24,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {749#true} call ULTIMATE.init(); {749#true} is VALID [2018-11-23 10:29:24,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {749#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {749#true} is VALID [2018-11-23 10:29:24,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {749#true} assume true; {749#true} is VALID [2018-11-23 10:29:24,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {749#true} {749#true} #84#return; {749#true} is VALID [2018-11-23 10:29:24,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {749#true} call #t~ret14 := main(); {749#true} is VALID [2018-11-23 10:29:24,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {749#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {749#true} is VALID [2018-11-23 10:29:24,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {749#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {772#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:24,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {772#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {772#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:24,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {772#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {772#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:24,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {772#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {772#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:24,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {772#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {772#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:24,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {772#(bvsgt ~SIZE~0 (_ bv1 32))} assume !~bvslt32(~i~0, ~SIZE~0); {772#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:24,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {772#(bvsgt ~SIZE~0 (_ bv1 32))} ~i~0 := 0bv32; {791#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:24,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {791#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {750#false} is VALID [2018-11-23 10:29:24,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#false} ~i~0 := 0bv32; {750#false} is VALID [2018-11-23 10:29:24,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {750#false} assume !~bvslt32(~i~0, ~SIZE~0); {750#false} is VALID [2018-11-23 10:29:24,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {750#false} ~i~0 := 0bv32; {750#false} is VALID [2018-11-23 10:29:24,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {750#false} is VALID [2018-11-23 10:29:24,793 INFO L256 TraceCheckUtils]: 18: Hoare triple {750#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {750#false} is VALID [2018-11-23 10:29:24,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {750#false} ~cond := #in~cond; {750#false} is VALID [2018-11-23 10:29:24,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {750#false} assume 0bv32 == ~cond; {750#false} is VALID [2018-11-23 10:29:24,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {750#false} assume !false; {750#false} is VALID [2018-11-23 10:29:24,795 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 10:29:24,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:29:24,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 10:29:24,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:24,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:29:24,841 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 10:29:24,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:29:24,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:29:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:29:24,842 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-23 10:29:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:25,226 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 10:29:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:29:25,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 10:29:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:29:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 10:29:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:29:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 10:29:25,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2018-11-23 10:29:25,386 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 10:29:25,388 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:29:25,389 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:29:25,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 10:29:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:29:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-11-23 10:29:25,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:25,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2018-11-23 10:29:25,408 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2018-11-23 10:29:25,408 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2018-11-23 10:29:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:25,413 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:29:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:29:25,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:25,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:25,414 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2018-11-23 10:29:25,415 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2018-11-23 10:29:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:25,417 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:29:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:29:25,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:25,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:25,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:25,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:29:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 10:29:25,421 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2018-11-23 10:29:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:25,422 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 10:29:25,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:29:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 10:29:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:29:25,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:25,423 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 10:29:25,423 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:25,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash -303433706, now seen corresponding path program 1 times [2018-11-23 10:29:25,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:25,424 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:25,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:29:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:25,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:25,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2018-11-23 10:29:25,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {1008#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1008#true} is VALID [2018-11-23 10:29:25,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2018-11-23 10:29:25,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #84#return; {1008#true} is VALID [2018-11-23 10:29:25,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret14 := main(); {1008#true} is VALID [2018-11-23 10:29:25,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {1008#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1008#true} is VALID [2018-11-23 10:29:25,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {1008#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1031#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:25,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {1031#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1031#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:25,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {1031#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1038#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:25,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {1038#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1038#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:25,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {1038#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1045#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:29:25,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {1045#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1049#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:25,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {1053#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:25,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {1053#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7;call write~intINTTYPE4(~tmp~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1053#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:25,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1060#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:29:25,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {1060#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {1009#false} is VALID [2018-11-23 10:29:25,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {1009#false} ~i~0 := 0bv32; {1009#false} is VALID [2018-11-23 10:29:25,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {1009#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10;call write~intINTTYPE4(~tmp~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1009#false} is VALID [2018-11-23 10:29:25,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {1009#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1009#false} is VALID [2018-11-23 10:29:25,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {1009#false} assume !~bvslt32(~i~0, ~SIZE~0); {1009#false} is VALID [2018-11-23 10:29:25,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {1009#false} ~i~0 := 0bv32; {1009#false} is VALID [2018-11-23 10:29:25,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {1009#false} is VALID [2018-11-23 10:29:25,819 INFO L256 TraceCheckUtils]: 22: Hoare triple {1009#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1009#false} is VALID [2018-11-23 10:29:25,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2018-11-23 10:29:25,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {1009#false} assume 0bv32 == ~cond; {1009#false} is VALID [2018-11-23 10:29:25,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2018-11-23 10:29:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:29:25,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:26,100 INFO L273 TraceCheckUtils]: 25: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2018-11-23 10:29:26,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {1009#false} assume 0bv32 == ~cond; {1009#false} is VALID [2018-11-23 10:29:26,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2018-11-23 10:29:26,102 INFO L256 TraceCheckUtils]: 22: Hoare triple {1009#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1009#false} is VALID [2018-11-23 10:29:26,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem12 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32); {1009#false} is VALID [2018-11-23 10:29:26,102 INFO L273 TraceCheckUtils]: 20: Hoare triple {1009#false} ~i~0 := 0bv32; {1009#false} is VALID [2018-11-23 10:29:26,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {1009#false} assume !~bvslt32(~i~0, ~SIZE~0); {1009#false} is VALID [2018-11-23 10:29:26,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {1009#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1009#false} is VALID [2018-11-23 10:29:26,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {1009#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10;call write~intINTTYPE4(~tmp~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1009#false} is VALID [2018-11-23 10:29:26,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {1009#false} ~i~0 := 0bv32; {1009#false} is VALID [2018-11-23 10:29:26,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {1124#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {1009#false} is VALID [2018-11-23 10:29:26,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {1128#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1124#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-23 10:29:26,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {1128#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7;call write~intINTTYPE4(~tmp~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1128#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:26,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {1135#(bvslt (_ bv1 32) ~SIZE~0)} ~i~0 := 0bv32; {1128#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:29:26,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {1139#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1135#(bvslt (_ bv1 32) ~SIZE~0)} is VALID [2018-11-23 10:29:26,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {1143#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1139#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-23 10:29:26,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {1143#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1143#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:26,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1143#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:29:26,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {1150#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem3 := read~intINTTYPE4(~#a_copy~0.base, ~bvadd32(~#a_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#b_copy~0.base, ~bvadd32(~#b_copy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem4, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1150#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} is VALID [2018-11-23 10:29:26,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {1008#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~tmp~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#a_copy~0.base, ~#a_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#b_copy~0.base, ~#b_copy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1150#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} is VALID [2018-11-23 10:29:26,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {1008#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1008#true} is VALID [2018-11-23 10:29:26,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret14 := main(); {1008#true} is VALID [2018-11-23 10:29:26,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #84#return; {1008#true} is VALID [2018-11-23 10:29:26,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2018-11-23 10:29:26,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {1008#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1008#true} is VALID [2018-11-23 10:29:26,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2018-11-23 10:29:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:29:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:29:26,148 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 10:29:26,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:26,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:29:26,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:26,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:29:26,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:29:26,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:29:26,246 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 14 states. [2018-11-23 10:29:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:29,174 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-11-23 10:29:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:29:29,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 10:29:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:29:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2018-11-23 10:29:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:29:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2018-11-23 10:29:29,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 118 transitions. [2018-11-23 10:29:29,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:29,476 INFO L225 Difference]: With dead ends: 101 [2018-11-23 10:29:29,476 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 10:29:29,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 10:29:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 10:29:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2018-11-23 10:29:29,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:29,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 64 states. [2018-11-23 10:29:29,561 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 64 states. [2018-11-23 10:29:29,561 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 64 states. [2018-11-23 10:29:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:29,567 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-23 10:29:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 10:29:29,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:29,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:29,569 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 81 states. [2018-11-23 10:29:29,569 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 81 states. [2018-11-23 10:29:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:29,574 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-23 10:29:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 10:29:29,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:29,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:29,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:29,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 10:29:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-11-23 10:29:29,580 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26 [2018-11-23 10:29:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:29,580 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-11-23 10:29:29,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:29:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-23 10:29:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:29:29,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:29,582 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 10:29:29,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:29,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1412368174, now seen corresponding path program 2 times [2018-11-23 10:29:29,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:29,615 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:29,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:29:29,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:29,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:29,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:29,966 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 17 treesize of output 29 [2018-11-23 10:29:30,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:30,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:30,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 10:29:30,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:30,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:30,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:30,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-11-23 10:29:30,602 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 10:29:30,770 INFO L303 Elim1Store]: Index analysis took 151 ms [2018-11-23 10:29:30,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 90 [2018-11-23 10:29:30,907 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 79 treesize of output 78 [2018-11-23 10:29:30,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:31,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:31,367 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 72 treesize of output 90 [2018-11-23 10:29:31,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:31,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 95 [2018-11-23 10:29:31,973 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 86 treesize of output 85 [2018-11-23 10:29:31,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,551 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-11-23 10:29:32,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 94 [2018-11-23 10:29:32,665 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 83 treesize of output 82 [2018-11-23 10:29:32,691 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,892 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:32,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 62 [2018-11-23 10:29:33,088 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 25 treesize of output 24 [2018-11-23 10:29:33,093 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 81 [2018-11-23 10:29:33,328 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 70 treesize of output 69 [2018-11-23 10:29:33,331 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,472 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,503 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-23 10:29:33,609 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 25 treesize of output 24 [2018-11-23 10:29:33,612 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 62 [2018-11-23 10:29:33,741 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 25 treesize of output 24 [2018-11-23 10:29:33,765 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,790 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:33,819 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:34,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:34,008 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 1 variables, input treesize:131, output treesize:76 [2018-11-23 10:29:36,568 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:36,569 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|]. (and (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#b~0.offset| (_ bv0 32)) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (let ((.cse1 (bvmul (_ bv4 32) main_~i~0)) (.cse2 (bvmul (_ bv4 32) (bvneg main_~i~0))) (.cse3 (bvmul (_ bv4 32) ~SIZE~0))) (let ((.cse0 (store |v_#memory_int_18| |main_~#a~0.base| (store (select |v_#memory_int_18| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse1) (select (select |v_#memory_int_18| |main_~#a_copy~0.base|) (bvadd .cse2 .cse3 |main_~#a_copy~0.offset| (_ bv4294967292 32))))))) (store .cse0 |main_~#b~0.base| (store (select .cse0 |main_~#b~0.base|) (bvadd .cse1 |main_~#b~0.offset|) (select (select .cse0 |main_~#b_copy~0.base|) (bvadd .cse2 .cse3 |main_~#b_copy~0.offset| (_ bv4294967292 32))))))) |#memory_int|) (bvsgt ~SIZE~0 (_ bv1 32)) (= |main_~#a_copy~0.offset| (_ bv0 32))) [2018-11-23 10:29:36,569 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvmul (_ bv4 32) main_~i~0)) (.cse1 (bvmul (_ bv4 32) (bvneg main_~i~0))) (.cse2 (bvmul (_ bv4 32) ~SIZE~0))) (and (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0)) (select (select |#memory_int| |main_~#a_copy~0.base|) (bvadd .cse1 .cse2 |main_~#a_copy~0.offset| (_ bv4294967292 32)))) (= |main_~#b~0.offset| (_ bv0 32)) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (select (select |#memory_int| |main_~#b~0.base|) (bvadd .cse0 |main_~#b~0.offset|)) (select (select |#memory_int| |main_~#b_copy~0.base|) (bvadd .cse1 .cse2 |main_~#b_copy~0.offset| (_ bv4294967292 32)))) (bvsgt ~SIZE~0 (_ bv1 32)) (= |main_~#a_copy~0.offset| (_ bv0 32)))) [2018-11-23 10:29:36,732 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 10:29:36,925 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 10:29:37,750 WARN L180 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-23 10:29:38,006 INFO L303 Elim1Store]: Index analysis took 221 ms [2018-11-23 10:29:38,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 94 [2018-11-23 10:29:38,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:38,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:38,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:38,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 82 [2018-11-23 10:29:38,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:38,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2018-11-23 10:29:38,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:38,417 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 34 treesize of output 41 [2018-11-23 10:29:38,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:38,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:38,561 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 10:29:38,846 INFO L303 Elim1Store]: Index analysis took 265 ms [2018-11-23 10:29:38,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 107 [2018-11-23 10:29:39,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:39,060 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 105 [2018-11-23 10:29:39,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:40,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:40,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:40,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:40,655 INFO L303 Elim1Store]: Index analysis took 172 ms [2018-11-23 10:29:41,049 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 128 [2018-11-23 10:29:41,057 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 10:29:42,566 INFO L303 Elim1Store]: Index analysis took 228 ms [2018-11-23 10:29:42,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 107 [2018-11-23 10:29:42,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:42,707 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 98 treesize of output 105 [2018-11-23 10:29:42,711 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:43,156 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:44,158 INFO L303 Elim1Store]: Index analysis took 275 ms [2018-11-23 10:29:44,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 102 [2018-11-23 10:29:44,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:44,481 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 97 treesize of output 104 [2018-11-23 10:29:44,491 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:45,044 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:45,605 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-11-23 10:29:45,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 10:29:45,667 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 19 treesize of output 18 [2018-11-23 10:29:45,697 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:45,773 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:45,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:29:46,214 INFO L303 Elim1Store]: Index analysis took 267 ms [2018-11-23 10:29:46,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 88 [2018-11-23 10:29:46,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:46,273 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 34 treesize of output 41 [2018-11-23 10:29:46,275 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:46,565 INFO L303 Elim1Store]: Index analysis took 189 ms [2018-11-23 10:29:46,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 97 [2018-11-23 10:29:46,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:46,693 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 88 treesize of output 95 [2018-11-23 10:29:46,697 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:46,956 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:47,015 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:48,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 10:29:48,623 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:136, output treesize:166 [2018-11-23 10:29:50,654 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:50,655 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, |main_~#b_copy~0.base|, |main_~#b_copy~0.offset|]. (let ((.cse2 (select |v_#memory_int_19| |main_~#a~0.base|)) (.cse1 (select |v_#memory_int_19| |main_~#a_copy~0.base|)) (.cse0 (bvmul (_ bv4 32) ~SIZE~0))) (and (= (select (select |v_#memory_int_19| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |v_#memory_int_19| |main_~#b_copy~0.base|) (bvadd .cse0 |main_~#b_copy~0.offset| (_ bv4294967292 32)))) (= (select .cse1 (bvadd .cse0 |main_~#a_copy~0.offset| (_ bv4294967292 32))) (select .cse2 |main_~#a~0.offset|)) (not (= |main_~#a_copy~0.base| |main_~#a~0.base|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |#memory_int| (let ((.cse3 (store |v_#memory_int_19| |main_~#a~0.base| (store .cse2 (bvadd |main_~#a~0.offset| (_ bv4 32)) (select .cse1 (bvadd .cse0 |main_~#a_copy~0.offset| (_ bv4294967288 32))))))) (store .cse3 |main_~#b~0.base| (store (select .cse3 |main_~#b~0.base|) (bvadd |main_~#b~0.offset| (_ bv4 32)) (select (select .cse3 |main_~#b_copy~0.base|) (bvadd .cse0 |main_~#b_copy~0.offset| (_ bv4294967288 32))))))) (= |main_~#b~0.offset| (_ bv0 32)) (not (= |main_~#a_copy~0.base| |main_~#b~0.base|)) (= |main_~#a~0.offset| (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= |main_~#a_copy~0.offset| (_ bv0 32)))) [2018-11-23 10:29:50,655 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#b_copy~0.base|, |main_~#b_copy~0.offset|]. (let ((.cse14 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse8 (select .cse14 |main_~#a~0.offset|)) (.cse15 (select |#memory_int| |main_~#a_copy~0.base|)) (.cse13 (bvmul (_ bv4 32) ~SIZE~0)) (.cse11 (select |#memory_int| |main_~#b~0.base|))) (let ((.cse0 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse1 (not (= |main_~#b~0.base| |main_~#a~0.base|))) (.cse2 (= |main_~#b~0.offset| (_ bv0 32))) (.cse3 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|))) (.cse9 (select .cse11 (bvadd |main_~#b~0.offset| (_ bv4 32)))) (.cse4 (= .cse8 (select .cse15 (bvadd .cse13 |main_~#a_copy~0.offset| (_ bv4294967292 32))))) (.cse5 (= |main_~#a~0.offset| (_ bv0 32))) (.cse7 (= (select .cse14 (bvadd |main_~#a~0.offset| (_ bv4 32))) (select .cse15 (bvadd .cse13 |main_~#a_copy~0.offset| (_ bv4294967288 32))))) (.cse6 (bvsgt ~SIZE~0 (_ bv1 32))) (.cse10 (= |main_~#a_copy~0.offset| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 .cse9) .cse10) (let ((.cse12 (select |#memory_int| |main_~#b_copy~0.base|))) (and .cse0 .cse1 .cse2 .cse3 (= (select .cse11 |main_~#b~0.offset|) (select .cse12 (bvadd .cse13 |main_~#b_copy~0.offset| (_ bv4294967292 32)))) (= .cse9 (select .cse12 (bvadd .cse13 |main_~#b_copy~0.offset| (_ bv4294967288 32)))) .cse4 .cse5 .cse7 .cse6 .cse10)))))) [2018-11-23 10:29:51,370 WARN L180 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 10:29:52,494 WARN L180 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 10:29:52,720 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-11-23 10:29:52,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 110 [2018-11-23 10:29:52,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:52,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:52,796 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 83 treesize of output 93 [2018-11-23 10:29:52,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:53,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2018-11-23 10:29:53,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:53,157 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 55 treesize of output 49 [2018-11-23 10:29:53,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:53,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:53,306 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 10:29:54,385 INFO L303 Elim1Store]: Index analysis took 331 ms [2018-11-23 10:29:54,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 159 treesize of output 146 [2018-11-23 10:29:54,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:54,651 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:54,703 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 137 treesize of output 140 [2018-11-23 10:29:54,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:56,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:56,630 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:56,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:56,857 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:56,859 INFO L303 Elim1Store]: Index analysis took 257 ms [2018-11-23 10:29:57,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 132 treesize of output 251 [2018-11-23 10:29:57,156 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-11-23 10:30:48,381 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:30:48,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 152 [2018-11-23 10:30:48,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:48,453 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 91 treesize of output 90 [2018-11-23 10:30:48,458 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:48,672 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:48,869 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-11-23 10:30:48,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 147 [2018-11-23 10:30:48,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:49,047 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-23 10:30:49,047 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 73 treesize of output 69 [2018-11-23 10:30:49,052 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:49,261 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:49,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 133 [2018-11-23 10:30:49,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:49,388 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 73 treesize of output 69 [2018-11-23 10:30:49,393 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:49,582 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:30:54,043 INFO L303 Elim1Store]: Index analysis took 181 ms [2018-11-23 10:30:54,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 131 [2018-11-23 10:30:54,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:54,182 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:30:54,214 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 122 treesize of output 135 [2018-11-23 10:30:54,220 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 10:30:55,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:55,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:55,074 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:30:55,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:30:55,294 INFO L303 Elim1Store]: Index analysis took 303 ms [2018-11-23 10:30:55,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 173 [2018-11-23 10:30:55,523 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-11-23 10:30:58,811 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 10:31:11,036 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:31:26,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-11-23 10:31:26,956 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:298, output treesize:739 [2018-11-23 10:31:28,984 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:31:28,984 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_7, |main_~#b_copy~0.base|, |main_~#b_copy~0.offset|, |v_#memory_int_20|]. (let ((.cse23 (bvmul (_ bv4 32) ~SIZE~0)) (.cse25 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse8 (bvadd |main_~#a~0.offset| .cse25)) (.cse7 (bvadd .cse25 |main_~#b~0.offset|)) (.cse10 (= |main_~#b~0.offset| (_ bv0 32))) (.cse17 (bvadd |main_~#b~0.offset| (_ bv4 32))) (.cse15 (= main_~i~0 (_ bv0 32))) (.cse16 (bvsgt ~SIZE~0 (_ bv1 32))) (.cse18 (= |main_~#a_copy~0.offset| (_ bv0 32))) (.cse12 (bvadd .cse23 |main_~#a_copy~0.offset| (_ bv4294967292 32))) (.cse5 (not (= |main_~#b~0.base| |main_~#a~0.base|))) (.cse4 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse11 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|))) (.cse14 (= |main_~#a~0.offset| (_ bv0 32))) (.cse1 (bvadd |main_~#a~0.offset| (_ bv4 32))) (.cse3 (bvadd .cse23 |main_~#a_copy~0.offset| (_ bv4294967288 32)))) (or (let ((.cse0 (select |v_#memory_int_20| |main_~#a~0.base|))) (let ((.cse2 (select |v_#memory_int_20| |main_~#a_copy~0.base|)) (.cse13 (select .cse0 |main_~#a~0.offset|)) (.cse9 (select |v_#memory_int_20| |main_~#b~0.base|))) (and (= (select .cse0 .cse1) (select .cse2 .cse3)) .cse4 .cse5 (= (let ((.cse6 (store |v_#memory_int_20| |main_~#a~0.base| (store .cse0 .cse8 (select .cse9 .cse7))))) (store .cse6 |main_~#b~0.base| (store (select .cse6 |main_~#b~0.base|) .cse7 (select .cse0 .cse8)))) |#memory_int|) .cse10 .cse11 (= (select .cse2 .cse12) .cse13) .cse14 .cse15 .cse16 (= .cse13 (select .cse9 .cse17)) .cse18))) (let ((.cse22 (select v_prenex_7 |main_~#b_copy~0.base|)) (.cse21 (select v_prenex_7 |main_~#b~0.base|)) (.cse20 (select v_prenex_7 |main_~#a~0.base|)) (.cse24 (select v_prenex_7 |main_~#a_copy~0.base|))) (and (= (let ((.cse19 (store v_prenex_7 |main_~#a~0.base| (store .cse20 .cse8 (select .cse21 .cse7))))) (store .cse19 |main_~#b~0.base| (store (select .cse19 |main_~#b~0.base|) .cse7 (select .cse20 .cse8)))) |#memory_int|) .cse10 (= (select .cse22 (bvadd .cse23 |main_~#b_copy~0.offset| (_ bv4294967288 32))) (select .cse21 .cse17)) .cse15 .cse16 .cse18 (= (select .cse24 .cse12) (select .cse20 |main_~#a~0.offset|)) .cse5 .cse4 .cse11 .cse14 (= (select .cse22 (bvadd .cse23 |main_~#b_copy~0.offset| (_ bv4294967292 32))) (select .cse21 |main_~#b~0.offset|)) (= (select .cse20 .cse1) (select .cse24 .cse3))))))) [2018-11-23 10:31:28,984 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#b_copy~0.base|, v_prenex_10, v_prenex_12, v_prenex_11, |main_~#b_copy~0.offset|]. (let ((.cse21 (bvmul (_ bv4 32) main_~i~0)) (.cse22 (select |#memory_int| |main_~#a_copy~0.base|)) (.cse16 (bvmul (_ bv4 32) ~SIZE~0))) (let ((.cse18 (select .cse22 (bvadd .cse16 |main_~#a_copy~0.offset| (_ bv4294967292 32)))) (.cse19 (select |#memory_int| |main_~#b~0.base|)) (.cse7 (select |#memory_int| |main_~#a~0.base|)) (.cse2 (bvadd |main_~#a~0.offset| .cse21))) (let ((.cse8 (select .cse7 .cse2)) (.cse11 (not (= |main_~#a_copy~0.base| |main_~#a~0.base|))) (.cse15 (select .cse19 (bvadd |main_~#b~0.offset| (_ bv4 32)))) (.cse10 (not (= |main_~#b~0.base| |main_~#a~0.base|))) (.cse0 (= |main_~#b~0.offset| (_ bv0 32))) (.cse12 (not (= |main_~#a_copy~0.base| |main_~#b~0.base|))) (.cse3 (= main_~i~0 (_ bv0 32))) (.cse13 (= |main_~#a~0.offset| (_ bv0 32))) (.cse4 (bvsgt ~SIZE~0 (_ bv1 32))) (.cse14 (= (select .cse7 (bvadd |main_~#a~0.offset| (_ bv4 32))) (select .cse22 (bvadd .cse16 |main_~#a_copy~0.offset| (_ bv4294967288 32))))) (.cse5 (= (select .cse19 (bvadd .cse21 |main_~#b~0.offset|)) .cse18)) (.cse9 (= |main_~#a_copy~0.offset| (_ bv0 32)))) (or (let ((.cse6 (bvadd .cse16 v_prenex_12 (_ bv4294967292 32))) (.cse1 (bvadd .cse16 v_prenex_12 (_ bv4294967288 32)))) (and .cse0 (not (= .cse1 .cse2)) .cse3 .cse4 .cse5 (not (= .cse6 .cse2)) (= (select .cse7 .cse6) .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 (select .cse7 .cse1)))) (let ((.cse17 (bvadd .cse16 v_prenex_11 (_ bv4294967288 32)))) (and .cse0 (not (= .cse17 .cse2)) (= .cse18 .cse8) .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse13 (= (select .cse7 (bvadd .cse16 v_prenex_11 (_ bv4294967292 32))) .cse18) .cse14 (= .cse15 (select .cse7 .cse17)))) (and (= (select .cse19 (bvadd .cse16 |main_~#b_copy~0.offset| (_ bv4294967292 32))) .cse8) .cse10 .cse11 .cse0 .cse12 (= .cse15 (select .cse19 (bvadd .cse16 |main_~#b_copy~0.offset| (_ bv4294967288 32)))) .cse3 .cse13 .cse4 .cse5 .cse14 .cse9) (let ((.cse20 (select |#memory_int| |main_~#b_copy~0.base|))) (and .cse0 (= (select .cse20 (bvadd .cse16 v_prenex_10 (_ bv4294967292 32))) .cse8) (= .cse15 (select .cse20 (bvadd .cse16 v_prenex_10 (_ bv4294967288 32)))) .cse3 .cse4 .cse5 (not (= |main_~#b_copy~0.base| |main_~#a~0.base|)) .cse9 (not (= |main_~#b_copy~0.base| |main_~#b~0.base|)) .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse10 .cse11 (= (select .cse19 (bvadd .cse21 |main_~#b~0.offset| (_ bv4 32))) .cse8) .cse0 .cse12 .cse3 .cse13 .cse4 .cse5 .cse14 .cse9) (and .cse10 .cse11 .cse0 .cse12 (= .cse15 (select .cse19 (bvadd .cse21 |main_~#b~0.offset| (_ bv4294967292 32)))) .cse3 .cse13 .cse4 .cse5 .cse14 .cse9) (and .cse11 (= .cse15 .cse18) .cse10 .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse9))))) [2018-11-23 10:31:32,367 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 108 [2018-11-23 10:31:45,819 WARN L180 SmtUtils]: Spent 3.93 s on a formula simplification that was a NOOP. DAG size: 114 [2018-11-23 10:31:47,175 INFO L303 Elim1Store]: Index analysis took 167 ms [2018-11-23 10:31:47,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2018-11-23 10:31:47,235 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 33 treesize of output 15 [2018-11-23 10:31:47,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-23 10:31:47,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:31:47,469 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 54 treesize of output 50 [2018-11-23 10:31:47,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:31:47,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.