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/tcpy_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:32:36,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:32:36,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:32:36,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:32:36,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:32:36,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:32:36,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:32:36,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:32:36,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:32:36,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:32:36,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:32:36,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:32:36,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:32:36,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:32:36,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:32:36,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:32:36,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:32:36,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:32:36,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:32:36,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:32:36,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:32:36,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:32:36,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:32:36,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:32:36,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:32:36,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:32:36,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:32:36,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:32:36,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:32:36,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:32:36,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:32:36,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:32:36,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:32:36,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:32:36,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:32:36,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:32:36,777 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:32:36,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:32:36,809 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:32:36,811 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:32:36,811 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:32:36,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:32:36,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:32:36,813 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:32:36,813 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:32:36,813 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:32:36,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:32:36,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:32:36,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:32:36,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:32:36,814 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:32:36,814 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:32:36,815 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:32:36,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:32:36,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:32:36,816 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:32:36,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:32:36,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:32:36,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:32:36,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:32:36,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:32:36,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:32:36,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:32:36,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:32:36,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:32:36,818 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:32:36,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:32:36,818 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:32:36,819 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:32:36,819 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:32:36,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:32:36,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:32:36,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:32:36,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:32:36,919 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:32:36,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy_true-unreach-call.i [2018-11-23 10:32:36,990 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b39ad2ba/09ade527376f4541811734663d983472/FLAG985fb660a [2018-11-23 10:32:37,389 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:32:37,390 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy_true-unreach-call.i [2018-11-23 10:32:37,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b39ad2ba/09ade527376f4541811734663d983472/FLAG985fb660a [2018-11-23 10:32:37,776 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b39ad2ba/09ade527376f4541811734663d983472 [2018-11-23 10:32:37,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:32:37,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:32:37,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:32:37,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:32:37,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:32:37,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:37" (1/1) ... [2018-11-23 10:32:37,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:37, skipping insertion in model container [2018-11-23 10:32:37,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:37" (1/1) ... [2018-11-23 10:32:37,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:32:37,831 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:32:38,072 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:32:38,077 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:32:38,107 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:32:38,134 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:32:38,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38 WrapperNode [2018-11-23 10:32:38,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:32:38,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:32:38,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:32:38,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:32:38,147 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:32:38" (1/1) ... [2018-11-23 10:32:38,160 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:32:38" (1/1) ... [2018-11-23 10:32:38,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:32:38,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:32:38,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:32:38,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:32:38,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... [2018-11-23 10:32:38,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:32:38,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:32:38,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:32:38,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:32:38,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:32:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:32:38,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:32:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:32:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:32:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:32:38,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:32:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:32:38,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:32:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:32:38,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:32:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:32:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:32:39,027 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:32:39,027 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:32:39,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:39 BoogieIcfgContainer [2018-11-23 10:32:39,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:32:39,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:32:39,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:32:39,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:32:39,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:37" (1/3) ... [2018-11-23 10:32:39,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52671a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:39, skipping insertion in model container [2018-11-23 10:32:39,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:38" (2/3) ... [2018-11-23 10:32:39,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52671a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:39, skipping insertion in model container [2018-11-23 10:32:39,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:39" (3/3) ... [2018-11-23 10:32:39,035 INFO L112 eAbstractionObserver]: Analyzing ICFG tcpy_true-unreach-call.i [2018-11-23 10:32:39,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:32:39,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:32:39,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:32:39,099 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:32:39,100 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:32:39,101 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:32:39,101 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:32:39,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:32:39,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:32:39,102 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:32:39,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:32:39,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:32:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 10:32:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:32:39,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:32:39,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:32:39,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:32:39,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:32:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash -93115520, now seen corresponding path program 1 times [2018-11-23 10:32:39,153 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:32:39,153 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:32:39,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:32:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:39,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:32:39,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 10:32:39,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {30#true} is VALID [2018-11-23 10:32:39,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 10:32:39,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #60#return; {30#true} is VALID [2018-11-23 10:32:39,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret8 := main(); {30#true} is VALID [2018-11-23 10:32:39,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {30#true} is VALID [2018-11-23 10:32:39,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); {53#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:32:39,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 0bv32; {57#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:32:39,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {31#false} is VALID [2018-11-23 10:32:39,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0bv32; {31#false} is VALID [2018-11-23 10:32:39,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#acopy~0.base, ~bvadd32(~#acopy~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {31#false} is VALID [2018-11-23 10:32:39,791 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 10:32:39,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 10:32:39,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 10:32:39,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 10:32:39,795 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:32:39,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:32:39,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:32:39,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:32:39,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:32:39,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:32:39,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:32:39,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:39,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:32:39,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:32:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:32:39,931 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-11-23 10:32:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:40,677 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 10:32:40,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:32:40,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:32:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:32:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:32:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 10:32:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:32:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 10:32:40,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-23 10:32:41,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:32:41,020 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:32:41,020 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 10:32:41,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:32:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 10:32:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 10:32:41,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:32:41,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 10:32:41,203 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 10:32:41,204 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 10:32:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:41,210 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 10:32:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 10:32:41,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:32:41,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:32:41,212 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 10:32:41,212 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 10:32:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:32:41,216 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 10:32:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 10:32:41,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:32:41,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:32:41,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:32:41,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:32:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:32:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 10:32:41,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-23 10:32:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:32:41,223 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 10:32:41,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:32:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:32:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:32:41,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:32:41,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:32:41,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:32:41,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:32:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash 622039550, now seen corresponding path program 1 times [2018-11-23 10:32:41,226 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:32:41,226 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:32:41,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:32:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:32:41,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:32:41,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 10:32:41,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:41,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:41,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 10:32:41,911 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-23 10:32:41,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-11-23 10:32:41,987 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-23 10:32:42,167 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 2 case distinctions, treesize of input 32 treesize of output 33 [2018-11-23 10:32:42,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:42,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:42,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:42,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:32:42,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2018-11-23 10:32:43,195 WARN L180 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2018-11-23 10:32:43,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 10:32:43,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 10:32:43,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:43,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 10:32:43,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:43,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:43,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:32:43,400 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 10:32:43,404 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:32:43,404 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#acopy~0.base|, |main_~#a~0.base|]. (let ((.cse1 (select (select |#memory_int| |main_~#a~0.base|) (_ bv0 32))) (.cse0 (select (select |#memory_int| |main_~#acopy~0.base|) (_ bv0 32)))) (and (= |main_#t~mem6| .cse0) (= .cse1 |main_#t~mem7|) (= .cse1 .cse0) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))) [2018-11-23 10:32:43,405 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem7| |main_#t~mem6|) [2018-11-23 10:32:43,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2018-11-23 10:32:43,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {218#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {218#true} is VALID [2018-11-23 10:32:43,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2018-11-23 10:32:43,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #60#return; {218#true} is VALID [2018-11-23 10:32:43,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret8 := main(); {218#true} is VALID [2018-11-23 10:32:43,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {218#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {218#true} is VALID [2018-11-23 10:32:43,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {218#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));call ~#acopy~0.base, ~#acopy~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); {241#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 10:32:43,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 0bv32; {245#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 10:32:43,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {245#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} assume !!~bvslt32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem3, ~#acopy~0.base, ~bvadd32(~#acopy~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(~SIZE~0, ~i~0), 1bv32))), 4bv32);havoc #t~mem3;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#acopy~0.base, ~bvadd32(~#acopy~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {249#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 10:32:43,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {249#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {249#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 10:32:43,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {249#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} assume !~bvslt32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {249#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 10:32:43,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {249#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} ~i~0 := 0bv32; {259#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 10:32:43,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {259#(and (= |main_~#acopy~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#acopy~0.base|) |main_~#acopy~0.offset|)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= |main_~#acopy~0.base| |main_~#a~0.base|)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#acopy~0.base, ~bvadd32(~#acopy~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {263#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-23 10:32:43,534 INFO L256 TraceCheckUtils]: 13: Hoare triple {263#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {267#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:32:43,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {267#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {271#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:32:43,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {271#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {219#false} is VALID [2018-11-23 10:32:43,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {219#false} assume !false; {219#false} is VALID [2018-11-23 10:32:43,537 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:32:43,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:32:49,701 WARN L180 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2018-11-23 10:32:49,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 299 treesize of output 259 [2018-11-23 10:32:50,022 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 263 treesize of output 147 [2018-11-23 10:32:50,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:32:52,569 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#a~0.offset| (bvadd (bvmul (_ bv4 32) (bvneg main_~i~0)) (bvmul (_ bv4 32) ~SIZE~0) |main_~#a~0.offset| (_ bv4294967292 32))) [2018-11-23 10:32:52,604 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:53,596 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:32:53,748 INFO L303 Elim1Store]: Index analysis took 3206 ms [2018-11-23 10:33:12,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 163 treesize of output 263 [2018-11-23 10:33:12,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 12 xjuncts. [2018-11-23 10:33:26,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 83 [2018-11-23 10:33:26,483 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-11-23 10:33:28,642 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#acopy~0.offset| (bvadd (bvmul (_ bv4 32) (bvneg main_~i~0)) (bvmul (_ bv4 32) ~SIZE~0) |main_~#acopy~0.offset| (_ bv4294967292 32))) [2018-11-23 10:33:28,668 INFO L303 Elim1Store]: Index analysis took 2038 ms [2018-11-23 10:33:30,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-23 10:33:30,761 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 10:33:32,840 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#acopy~0.offset| (bvadd (bvmul (_ bv4 32) (bvneg main_~i~0)) (bvmul (_ bv4 32) ~SIZE~0) |main_~#acopy~0.offset| (_ bv4294967292 32))) [2018-11-23 10:33:32,864 INFO L303 Elim1Store]: Index analysis took 2036 ms [2018-11-23 10:33:33,706 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 61 [2018-11-23 10:33:33,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 10:33:35,870 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#acopy~0.offset| (bvadd (bvmul (_ bv4 32) (bvneg main_~i~0)) (bvmul (_ bv4 32) ~SIZE~0) |main_~#acopy~0.offset| (_ bv4294967292 32))) [2018-11-23 10:33:35,893 INFO L303 Elim1Store]: Index analysis took 2038 ms [2018-11-23 10:33:36,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 59 [2018-11-23 10:33:36,813 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 10:33:38,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:33:49,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 163 [2018-11-23 10:33:51,243 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:33:51,257 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:33:52,077 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:33:52,120 INFO L303 Elim1Store]: Index analysis took 2862 ms [2018-11-23 10:34:04,329 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 131 treesize of output 232 [2018-11-23 10:35:21,245 WARN L180 SmtUtils]: Spent 1.27 m on a formula simplification. DAG size of input: 305 DAG size of output: 158 [2018-11-23 10:35:23,711 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:23,748 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:23,753 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:23,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 144 [2018-11-23 10:35:23,929 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-11-23 10:35:26,115 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:26,133 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:26,139 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:26,140 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:26,141 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:26,141 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:35:26,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 170 [2018-11-23 10:35:26,284 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts.