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/poly1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:28:57,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:28:57,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:28:57,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:28:57,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:28:57,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:28:57,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:28:57,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:28:57,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:28:57,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:28:57,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:28:57,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:28:57,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:28:57,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:28:57,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:28:57,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:28:57,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:28:57,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:28:57,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:28:57,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:28:57,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:28:57,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:28:57,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:28:57,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:28:57,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:28:57,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:28:57,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:28:57,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:28:57,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:28:57,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:28:57,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:28:57,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:28:57,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:28:57,119 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:28:57,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:28:57,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:28:57,121 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:28:57,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:28:57,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:28:57,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:28:57,153 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:28:57,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:28:57,154 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:28:57,155 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:28:57,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:28:57,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:28:57,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:28:57,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:28:57,156 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:28:57,156 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:28:57,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:28:57,157 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:28:57,157 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:28:57,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:28:57,158 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:28:57,158 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:28:57,158 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:28:57,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:28:57,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:28:57,160 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:28:57,160 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:28:57,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:28:57,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:28:57,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:28:57,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:28:57,161 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:28:57,161 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:28:57,162 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:28:57,162 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:28:57,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:28:57,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:28:57,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:28:57,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:28:57,250 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:28:57,250 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:28:57,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i [2018-11-23 10:28:57,316 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68ab8a7f/eda4aac80d7f4522afb8fb7512ff292d/FLAGf1191042a [2018-11-23 10:28:57,758 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:28:57,759 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i [2018-11-23 10:28:57,768 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68ab8a7f/eda4aac80d7f4522afb8fb7512ff292d/FLAGf1191042a [2018-11-23 10:28:58,096 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68ab8a7f/eda4aac80d7f4522afb8fb7512ff292d [2018-11-23 10:28:58,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:28:58,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:28:58,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:58,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:28:58,113 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:28:58,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b3cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58, skipping insertion in model container [2018-11-23 10:28:58,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:28:58,147 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:28:58,407 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:58,414 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:28:58,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:58,484 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:28:58,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58 WrapperNode [2018-11-23 10:28:58,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:58,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:58,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:28:58,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:28:58,496 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:28:58" (1/1) ... [2018-11-23 10:28:58,507 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:28:58" (1/1) ... [2018-11-23 10:28:58,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:58,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:28:58,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:28:58,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:28:58,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2018-11-23 10:28:58,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:28:58,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:28:58,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:28:58,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:28:58,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (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:28:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-23 10:28:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:28:58,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:28:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:28:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:28:58,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:28:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:28:58,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:28:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-23 10:28:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:28:58,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:28:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:28:59,248 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:28:59,249 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:28:59,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:59 BoogieIcfgContainer [2018-11-23 10:28:59,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:28:59,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:28:59,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:28:59,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:28:59,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:58" (1/3) ... [2018-11-23 10:28:59,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff27d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:59, skipping insertion in model container [2018-11-23 10:28:59,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (2/3) ... [2018-11-23 10:28:59,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff27d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:59, skipping insertion in model container [2018-11-23 10:28:59,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:59" (3/3) ... [2018-11-23 10:28:59,258 INFO L112 eAbstractionObserver]: Analyzing ICFG poly1_true-unreach-call.i [2018-11-23 10:28:59,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:28:59,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:28:59,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:28:59,324 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:28:59,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:28:59,325 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:28:59,325 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:28:59,325 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:28:59,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:28:59,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:28:59,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:28:59,326 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:28:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 10:28:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:28:59,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:28:59,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:28:59,355 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:28:59,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:28:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1279113652, now seen corresponding path program 1 times [2018-11-23 10:28:59,367 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:28:59,368 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:28:59,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:28:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:28:59,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:28:59,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 10:28:59,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {29#true} is VALID [2018-11-23 10:28:59,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 10:28:59,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #56#return; {29#true} is VALID [2018-11-23 10:28:59,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2018-11-23 10:28:59,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {29#true} is VALID [2018-11-23 10:28:59,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {29#true} is VALID [2018-11-23 10:28:59,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 10:28:59,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {30#false} is VALID [2018-11-23 10:28:59,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {30#false} is VALID [2018-11-23 10:28:59,600 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {30#false} is VALID [2018-11-23 10:28:59,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 10:28:59,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 10:28:59,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 10:28:59,605 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:28:59,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:28:59,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:28:59,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:28:59,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:28:59,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:28:59,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:28:59,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:28:59,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:28:59,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:28:59,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:28:59,821 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 10:29:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:00,105 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 10:29:00,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:29:00,105 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:29:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 10:29:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 10:29:00,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 10:29:00,357 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:00,369 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:29:00,369 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:29:00,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:29:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:29:00,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:00,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:29:00,412 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:29:00,412 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:29:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:00,415 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 10:29:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 10:29:00,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:00,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:00,417 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:29:00,417 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:29:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:00,421 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 10:29:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 10:29:00,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:00,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:00,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:00,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:29:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 10:29:00,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-23 10:29:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:00,427 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 10:29:00,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:29:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 10:29:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:29:00,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:00,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:00,429 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:00,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash 249058862, now seen corresponding path program 1 times [2018-11-23 10:29:00,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:00,430 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:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:00,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:00,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2018-11-23 10:29:00,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {194#true} is VALID [2018-11-23 10:29:00,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-23 10:29:00,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #56#return; {194#true} is VALID [2018-11-23 10:29:00,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret5 := main(); {194#true} is VALID [2018-11-23 10:29:00,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2018-11-23 10:29:00,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {194#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {217#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:00,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {195#false} is VALID [2018-11-23 10:29:00,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {195#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {195#false} is VALID [2018-11-23 10:29:00,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {195#false} is VALID [2018-11-23 10:29:00,739 INFO L256 TraceCheckUtils]: 10: Hoare triple {195#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {195#false} is VALID [2018-11-23 10:29:00,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {195#false} ~cond := #in~cond; {195#false} is VALID [2018-11-23 10:29:00,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {195#false} assume 0bv32 == ~cond; {195#false} is VALID [2018-11-23 10:29:00,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2018-11-23 10:29:00,743 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:00,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:29:00,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:29:00,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:00,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:29:00,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:00,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:29:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:29:00,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:29:00,813 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 10:29:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:01,465 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 10:29:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:29:01,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:29:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-23 10:29:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-23 10:29:01,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2018-11-23 10:29:01,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:01,962 INFO L225 Difference]: With dead ends: 33 [2018-11-23 10:29:01,963 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:29:01,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:29:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:29:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 10:29:01,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:01,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 10:29:01,993 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 10:29:01,993 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 10:29:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:01,995 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:29:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:29:01,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:01,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:01,997 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 10:29:01,997 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 10:29:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:01,999 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:29:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:29:02,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:02,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:29:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 10:29:02,003 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-23 10:29:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:02,003 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 10:29:02,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:29:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 10:29:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:29:02,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:02,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:02,005 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:02,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1260861268, now seen corresponding path program 1 times [2018-11-23 10:29:02,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:02,006 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:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:02,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 10:29:02,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {357#true} is VALID [2018-11-23 10:29:02,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 10:29:02,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #56#return; {357#true} is VALID [2018-11-23 10:29:02,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret5 := main(); {357#true} is VALID [2018-11-23 10:29:02,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {357#true} is VALID [2018-11-23 10:29:02,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {380#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:02,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {380#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:02,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {380#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {387#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-23 10:29:02,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {387#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {358#false} is VALID [2018-11-23 10:29:02,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {358#false} is VALID [2018-11-23 10:29:02,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {358#false} is VALID [2018-11-23 10:29:02,514 INFO L256 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {358#false} is VALID [2018-11-23 10:29:02,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 10:29:02,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0bv32 == ~cond; {358#false} is VALID [2018-11-23 10:29:02,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 10:29:02,517 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:02,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:02,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 10:29:02,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0bv32 == ~cond; {358#false} is VALID [2018-11-23 10:29:02,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 10:29:02,649 INFO L256 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {358#false} is VALID [2018-11-23 10:29:02,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {358#false} is VALID [2018-11-23 10:29:02,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {358#false} is VALID [2018-11-23 10:29:02,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {427#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {358#false} is VALID [2018-11-23 10:29:02,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {427#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-23 10:29:02,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {431#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-23 10:29:02,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {431#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-23 10:29:02,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {357#true} is VALID [2018-11-23 10:29:02,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret5 := main(); {357#true} is VALID [2018-11-23 10:29:02,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #56#return; {357#true} is VALID [2018-11-23 10:29:02,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 10:29:02,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {357#true} is VALID [2018-11-23 10:29:02,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 10:29:02,704 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:02,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:02,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:29:02,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:29:02,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:02,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:29:02,849 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:02,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:29:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:29:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:02,850 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-23 10:29:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:04,229 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 10:29:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:29:04,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:29:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-23 10:29:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-23 10:29:04,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2018-11-23 10:29:04,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:04,517 INFO L225 Difference]: With dead ends: 35 [2018-11-23 10:29:04,518 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:29:04,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:29:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 10:29:04,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:04,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 10:29:04,536 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 10:29:04,536 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 10:29:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:04,539 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 10:29:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 10:29:04,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:04,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:04,540 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 10:29:04,541 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 10:29:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:04,543 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 10:29:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 10:29:04,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:04,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:04,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:04,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:29:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 10:29:04,547 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2018-11-23 10:29:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:04,547 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 10:29:04,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:29:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 10:29:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:29:04,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:04,548 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:04,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:04,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -595160150, now seen corresponding path program 2 times [2018-11-23 10:29:04,550 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:04,550 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:04,571 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:05,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:29:05,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:05,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:05,280 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,282 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 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 40 treesize of output 61 [2018-11-23 10:29:05,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,342 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2018-11-23 10:29:05,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:05,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:05,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:05,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2018-11-23 10:29:05,758 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 10:29:05,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,872 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 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 95 treesize of output 130 [2018-11-23 10:29:05,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:05,980 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,993 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:05,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 283 [2018-11-23 10:29:06,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:06,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:06,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:06,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2018-11-23 10:29:06,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 108 treesize of output 92 [2018-11-23 10:29:06,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,381 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:06,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,397 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:29:06,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:06,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 211 [2018-11-23 10:29:06,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:29:06,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:06,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:29:06,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:20 [2018-11-23 10:29:06,478 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:29:06,478 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse5 (bvadd .cse0 (_ bv1 64)))) (let ((.cse6 (bvmul (_ bv8 32) ((_ extract 31 0) .cse0))) (.cse3 (select |#memory_int| |main_~#a~0.base|)) (.cse4 (bvmul (_ bv8 32) ((_ extract 31 0) .cse5)))) (let ((.cse1 (select .cse3 (bvadd .cse4 (_ bv4 32)))) (.cse2 (select .cse3 .cse6))) (and (= main_~i~0 .cse0) (= .cse1 .cse2) (= (select .cse3 .cse4) ((_ extract 31 0) (bvmul .cse5 .cse5))) (= (select .cse3 (bvadd .cse6 (_ bv4 32))) .cse1) (= (let ((.cse7 (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)))) (concat (select .cse3 (bvadd .cse7 (_ bv4 32))) (select .cse3 .cse7))) |main_#t~mem4|) (= ((_ extract 31 0) (bvmul .cse0 .cse0)) .cse2)))))) [2018-11-23 10:29:06,479 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 ((_ sign_extend 32) (_ bv0 32)))) (and (= main_~i~0 .cse0) (= (let ((.cse1 ((_ extract 31 0) (bvmul .cse0 .cse0)))) (concat .cse1 .cse1)) |main_#t~mem4|))) [2018-11-23 10:29:06,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2018-11-23 10:29:06,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {587#true} is VALID [2018-11-23 10:29:06,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2018-11-23 10:29:06,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #56#return; {587#true} is VALID [2018-11-23 10:29:06,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret5 := main(); {587#true} is VALID [2018-11-23 10:29:06,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {587#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {587#true} is VALID [2018-11-23 10:29:06,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {610#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:29:06,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {610#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {614#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)))) (= ((_ extract 31 0) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))))} is VALID [2018-11-23 10:29:06,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {614#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)))) (= ((_ extract 31 0) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {618#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-23 10:29:06,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {618#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {622#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-23 10:29:06,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {622#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {622#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-23 10:29:06,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {622#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {622#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-23 10:29:06,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {622#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} ~i~0 := ~sign_extendFrom32To64(0bv32); {632#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-23 10:29:06,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {632#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {636#(and (= (concat ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~mem4|) (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-23 10:29:06,660 INFO L256 TraceCheckUtils]: 14: Hoare triple {636#(and (= (concat ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~mem4|) (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))))} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {640#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:06,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {640#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {644#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:29:06,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {644#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {588#false} is VALID [2018-11-23 10:29:06,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {588#false} assume !false; {588#false} is VALID [2018-11-23 10:29:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:29:06,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:08,452 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 10:29:10,631 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 10:29:12,509 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 10:29:15,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:15,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:15,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:15,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:29:15,176 INFO L303 Elim1Store]: Index analysis took 390 ms [2018-11-23 10:29:15,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 289 [2018-11-23 10:29:15,408 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:15,409 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_4 (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:191) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 10:29:15,414 INFO L168 Benchmark]: Toolchain (without parser) took 17306.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.0 MB). Peak memory consumption was 288.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:15,415 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:29:15,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:15,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:29:15,417 INFO L168 Benchmark]: Boogie Preprocessor took 36.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:29:15,417 INFO L168 Benchmark]: RCFGBuilder took 696.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:15,418 INFO L168 Benchmark]: TraceAbstraction took 16162.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 309.4 MB). Peak memory consumption was 309.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:15,423 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 376.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 696.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16162.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 309.4 MB). Peak memory consumption was 309.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_4 (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_4 (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...