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/heap-data/running_example_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:19:51,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:19:51,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:19:51,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:19:51,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:19:51,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:19:51,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:19:51,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:19:51,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:19:51,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:19:51,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:19:51,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:19:51,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:19:51,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:19:51,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:19:51,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:19:51,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:19:51,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:19:51,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:19:51,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:19:51,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:19:51,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:19:51,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:19:51,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:19:51,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:19:51,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:19:51,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:19:51,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:19:51,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:19:51,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:19:51,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:19:51,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:19:51,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:19:51,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:19:51,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:19:51,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:19:51,366 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 11:19:51,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:19:51,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:19:51,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:19:51,382 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:19:51,383 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:19:51,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:19:51,383 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:19:51,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:19:51,384 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:19:51,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:19:51,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:19:51,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:19:51,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:19:51,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:19:51,385 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:19:51,385 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:19:51,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:19:51,385 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:19:51,386 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:19:51,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:19:51,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:19:51,386 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:19:51,386 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:19:51,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:19:51,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:19:51,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:19:51,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:19:51,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:19:51,388 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:19:51,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:19:51,388 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:19:51,388 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:19:51,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:19:51,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:19:51,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:19:51,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:19:51,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:19:51,453 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:19:51,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i [2018-11-23 11:19:51,515 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3036cd684/4c267ae705c44b8b9ebf255aabe9f556/FLAGab4597824 [2018-11-23 11:19:52,095 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:19:52,096 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i [2018-11-23 11:19:52,108 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3036cd684/4c267ae705c44b8b9ebf255aabe9f556/FLAGab4597824 [2018-11-23 11:19:52,354 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3036cd684/4c267ae705c44b8b9ebf255aabe9f556 [2018-11-23 11:19:52,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:19:52,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:19:52,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:52,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:19:52,373 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:19:52,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:52" (1/1) ... [2018-11-23 11:19:52,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4aca20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:52, skipping insertion in model container [2018-11-23 11:19:52,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:52" (1/1) ... [2018-11-23 11:19:52,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:19:52,447 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:19:52,848 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:52,865 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:19:52,925 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:53,066 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:19:53,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53 WrapperNode [2018-11-23 11:19:53,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:53,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:53,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:19:53,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:19:53,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:53,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:19:53,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:19:53,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:19:53,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (1/1) ... [2018-11-23 11:19:53,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:19:53,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:19:53,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:19:53,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:19:53,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (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 11:19:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:19:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:19:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:19:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:19:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:19:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:19:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:19:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:19:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:19:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:19:53,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:19:54,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:19:54,010 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:19:54,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:54 BoogieIcfgContainer [2018-11-23 11:19:54,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:19:54,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:19:54,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:19:54,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:19:54,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:19:52" (1/3) ... [2018-11-23 11:19:54,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da033f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:54, skipping insertion in model container [2018-11-23 11:19:54,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:53" (2/3) ... [2018-11-23 11:19:54,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da033f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:54, skipping insertion in model container [2018-11-23 11:19:54,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:54" (3/3) ... [2018-11-23 11:19:54,019 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example_true-unreach-call.i [2018-11-23 11:19:54,030 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:19:54,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:19:54,058 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:19:54,085 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:19:54,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:19:54,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:19:54,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:19:54,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:19:54,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:19:54,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:19:54,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:19:54,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:19:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 11:19:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:19:54,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:54,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:54,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:54,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:54,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2047748461, now seen corresponding path program 1 times [2018-11-23 11:19:54,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:54,130 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 11:19:54,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:54,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:54,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 11:19:54,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {25#true} is VALID [2018-11-23 11:19:54,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 11:19:54,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #69#return; {25#true} is VALID [2018-11-23 11:19:54,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret14 := main(); {25#true} is VALID [2018-11-23 11:19:54,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {25#true} is VALID [2018-11-23 11:19:54,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 11:19:54,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {26#false} is VALID [2018-11-23 11:19:54,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {26#false} is VALID [2018-11-23 11:19:54,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {26#false} is VALID [2018-11-23 11:19:54,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {26#false} is VALID [2018-11-23 11:19:54,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 11:19:54,475 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 11:19:54,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:19:54,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:54,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:19:54,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:19:54,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:54,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:19:54,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:54,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:19:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:19:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:19:54,567 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 11:19:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:54,719 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2018-11-23 11:19:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:19:54,719 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:19:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 11:19:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 11:19:54,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 11:19:54,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:54,930 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:19:54,937 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:19:54,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 11:19:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:19:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:19:55,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:55,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:19:55,039 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:19:55,039 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:19:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:55,044 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 11:19:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-11-23 11:19:55,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:55,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:55,045 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:19:55,045 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:19:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:55,049 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 11:19:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-11-23 11:19:55,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:55,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:55,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:55,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:19:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-11-23 11:19:55,054 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2018-11-23 11:19:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:55,055 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-23 11:19:55,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:19:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-11-23 11:19:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:19:55,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:55,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:55,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:55,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash 767742559, now seen corresponding path program 1 times [2018-11-23 11:19:55,057 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:55,058 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 11:19:55,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:55,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:55,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-23 11:19:55,464 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 8 treesize of output 7 [2018-11-23 11:19:55,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:55,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:55,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:55,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:19:55,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {162#true} is VALID [2018-11-23 11:19:55,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {162#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {162#true} is VALID [2018-11-23 11:19:55,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2018-11-23 11:19:55,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #69#return; {162#true} is VALID [2018-11-23 11:19:55,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret14 := main(); {162#true} is VALID [2018-11-23 11:19:55,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {162#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {182#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:19:55,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {182#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} goto; {182#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:19:55,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {182#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {182#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:19:55,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {182#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {192#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:19:55,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {192#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {192#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:19:55,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {192#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {199#|main_#t~short9|} is VALID [2018-11-23 11:19:55,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {199#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {163#false} is VALID [2018-11-23 11:19:55,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {163#false} assume !false; {163#false} is VALID [2018-11-23 11:19:55,890 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 11:19:55,890 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:55,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:55,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:19:55,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:19:55,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:55,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:19:56,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:19:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:19:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:56,070 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 5 states. [2018-11-23 11:19:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:57,656 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2018-11-23 11:19:57,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:19:57,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:19:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:19:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 11:19:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:19:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 11:19:57,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2018-11-23 11:19:57,823 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 11:19:57,826 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:19:57,826 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:19:57,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:19:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:19:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 11:19:57,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:57,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 25 states. [2018-11-23 11:19:57,873 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 25 states. [2018-11-23 11:19:57,873 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 25 states. [2018-11-23 11:19:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:57,877 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2018-11-23 11:19:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-23 11:19:57,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:57,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:57,878 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 28 states. [2018-11-23 11:19:57,878 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 28 states. [2018-11-23 11:19:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:57,881 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2018-11-23 11:19:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-23 11:19:57,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:57,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:57,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:57,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:19:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 11:19:57,886 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2018-11-23 11:19:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:57,886 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 11:19:57,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:19:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-11-23 11:19:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:19:57,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:57,888 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:57,888 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:57,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1007267375, now seen corresponding path program 1 times [2018-11-23 11:19:57,889 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:57,889 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 11:19:57,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:58,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:58,061 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 6 treesize of output 5 [2018-11-23 11:19:58,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-23 11:19:58,126 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 8 treesize of output 7 [2018-11-23 11:19:58,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,160 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-11-23 11:19:58,176 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:58,176 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, |v_#valid_11|]. (and (= |#valid| (store |v_#valid_11| main_~list~0.base (_ bv1 1))) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= (store |v_#memory_int_21| main_~list~0.base (store (select |v_#memory_int_21| main_~list~0.base) main_~list~0.offset (_ bv10 32))) |#memory_int|) (= main_~list~0.offset main_~tail~0.offset)) [2018-11-23 11:19:58,176 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv10 32)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset)) [2018-11-23 11:19:58,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:58,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:58,341 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:19:58,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:19:58,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:58,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:19:58,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,647 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 27 treesize of output 28 [2018-11-23 11:19:58,671 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 16 treesize of output 1 [2018-11-23 11:19:58,695 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,778 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 19 treesize of output 20 [2018-11-23 11:19:58,787 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 8 treesize of output 7 [2018-11-23 11:19:58,788 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,802 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:58,821 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:70, output treesize:11 [2018-11-23 11:19:58,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:58,875 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, |main_#t~malloc5.base|, main_~p~0.offset, main_~x~0, |v_#valid_12|, |v_#memory_int_22|, |v_#memory_int_24|]. (let ((.cse1 (select |v_#memory_int_23| |main_#t~malloc5.base|)) (.cse2 (select |v_#memory_int_24| main_~list~0.base))) (and (= (_ bv0 1) (select |v_#valid_12| |main_#t~malloc5.base|)) (= (store |v_#memory_int_22| |main_#t~malloc5.base| (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |v_#memory_int_22| |main_#t~malloc5.base|) .cse0 (select .cse1 .cse0)))) |v_#memory_int_23|) (= (select |v_#valid_12| main_~list~0.base) (_ bv1 1)) (= (_ bv10 32) (select .cse2 main_~list~0.offset)) (= (store |v_#memory_int_23| |main_#t~malloc5.base| (store .cse1 main_~p~0.offset main_~x~0)) |#memory_int|) (= |v_#memory_int_22| (store |v_#memory_int_24| main_~list~0.base (let ((.cse3 (bvadd main_~list~0.offset (_ bv4 32)))) (store .cse2 .cse3 (select (select |v_#memory_int_22| main_~list~0.base) .cse3))))) (= main_~list~0.offset (_ bv0 32)))) [2018-11-23 11:19:58,876 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32))) [2018-11-23 11:19:59,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2018-11-23 11:19:59,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {348#true} is VALID [2018-11-23 11:19:59,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2018-11-23 11:19:59,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #69#return; {348#true} is VALID [2018-11-23 11:19:59,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret14 := main(); {348#true} is VALID [2018-11-23 11:19:59,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {368#(and (= (bvadd (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} is VALID [2018-11-23 11:19:59,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {368#(and (= (bvadd (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} goto; {368#(and (= (bvadd (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} is VALID [2018-11-23 11:19:59,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {368#(and (= (bvadd (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3;~x~0 := #t~nondet4;havoc #t~nondet4; {368#(and (= (bvadd (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} is VALID [2018-11-23 11:19:59,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(and (= (bvadd (select (select |#memory_int| main_~list~0.base) main_~tail~0.offset) (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} assume !(~bvslt32(~x~0, 10bv32) || ~bvsgt32(~x~0, 20bv32));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, ~bvadd32(4bv32, ~tail~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~x~0, ~p~0.base, ~p~0.offset, 4bv32);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {378#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:19:59,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {378#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} goto; {378#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:19:59,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {378#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:19:59,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {378#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {388#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:19:59,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {388#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:19:59,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {395#|main_#t~short9|} is VALID [2018-11-23 11:19:59,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {395#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {349#false} is VALID [2018-11-23 11:19:59,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {349#false} assume !false; {349#false} is VALID [2018-11-23 11:19:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:59,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:59,448 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:19:59,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:59,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:59,689 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:59,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:59,724 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-11-23 11:19:59,842 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:62, output treesize:145 [2018-11-23 11:19:59,889 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:59,890 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_23|, v_main_~p~0.base_13, v_main_~p~0.offset_13, main_~x~0, |v_#memory_int_22|]. (let ((.cse1 (select |v_#memory_int_23| v_main_~p~0.base_13))) (or (not (= |v_#memory_int_23| (store |v_#memory_int_22| v_main_~p~0.base_13 (let ((.cse0 (bvadd v_main_~p~0.offset_13 (_ bv4 32)))) (store (select |v_#memory_int_22| v_main_~p~0.base_13) .cse0 (select .cse1 .cse0)))))) (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store |v_#memory_int_23| v_main_~p~0.base_13 (store .cse1 v_main_~p~0.offset_13 main_~x~0)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (not (= (store |#memory_int| main_~tail~0.base (let ((.cse2 (bvadd main_~tail~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~tail~0.base) .cse2 (select (select |v_#memory_int_22| main_~tail~0.base) .cse2)))) |v_#memory_int_22|)))) [2018-11-23 11:19:59,890 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_2, v_main_~p~0.base_13, v_main_~p~0.offset_13, v_DerPreprocessor_4, v_prenex_6, v_prenex_7, v_prenex_8, v_prenex_5, v_prenex_2, v_prenex_3, v_prenex_4, v_prenex_1]. (let ((.cse1 (select |#memory_int| main_~tail~0.base)) (.cse2 (bvadd main_~tail~0.offset (_ bv4 32)))) (and (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (= v_main_~p~0.base_13 main_~list~0.base) (bvsge (select (select (let ((.cse0 (store |#memory_int| main_~tail~0.base (store .cse1 .cse2 v_DerPreprocessor_2)))) (store .cse0 v_main_~p~0.base_13 (store (select .cse0 v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4))) main_~list~0.base) main_~list~0.offset) (_ bv10 32))) (not (= (_ bv0 1) (select |#valid| main_~list~0.base))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (bvsge (select (select (let ((.cse3 (store |#memory_int| main_~tail~0.base (store .cse1 .cse2 v_prenex_6)))) (store .cse3 v_prenex_7 (store (select .cse3 v_prenex_7) (bvadd v_prenex_8 (_ bv4 32)) v_prenex_5))) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= main_~list~0.offset v_prenex_8)) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (let ((.cse4 (store |#memory_int| main_~tail~0.base (store .cse1 .cse2 v_prenex_2)))) (store .cse4 v_prenex_3 (store (select .cse4 v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1))) main_~list~0.base) main_~list~0.offset) (_ bv10 32))))) [2018-11-23 11:20:16,842 WARN L180 SmtUtils]: Spent 14.78 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-11-23 11:20:17,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {349#false} assume !false; {349#false} is VALID [2018-11-23 11:20:17,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {395#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {349#false} is VALID [2018-11-23 11:20:17,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#(bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {395#|main_#t~short9|} is VALID [2018-11-23 11:20:17,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#(bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {408#(bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))} is VALID [2018-11-23 11:20:17,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {415#(bvsge (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv10 32))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {408#(bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))} is VALID [2018-11-23 11:20:17,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#(bvsge (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv10 32))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {415#(bvsge (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv10 32))} is VALID [2018-11-23 11:20:17,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {415#(bvsge (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv10 32))} goto; {415#(bvsge (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv10 32))} is VALID [2018-11-23 11:20:18,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~p~0.base_13 (_ BitVec 32)) (v_main_~p~0.offset_13 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= v_main_~p~0.base_13 main_~list~0.base))) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)))))} assume !(~bvslt32(~x~0, 10bv32) || ~bvsgt32(~x~0, 20bv32));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, ~bvadd32(4bv32, ~tail~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~x~0, ~p~0.base, ~p~0.offset, 4bv32);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {415#(bvsge (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv10 32))} is VALID [2018-11-23 11:20:18,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#(and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~p~0.base_13 (_ BitVec 32)) (v_main_~p~0.offset_13 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= v_main_~p~0.base_13 main_~list~0.base))) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)))))} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3;~x~0 := #t~nondet4;havoc #t~nondet4; {425#(and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~p~0.base_13 (_ BitVec 32)) (v_main_~p~0.offset_13 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= v_main_~p~0.base_13 main_~list~0.base))) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)))))} is VALID [2018-11-23 11:20:18,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {425#(and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~p~0.base_13 (_ BitVec 32)) (v_main_~p~0.offset_13 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= v_main_~p~0.base_13 main_~list~0.base))) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)))))} goto; {425#(and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~p~0.base_13 (_ BitVec 32)) (v_main_~p~0.offset_13 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= v_main_~p~0.base_13 main_~list~0.base))) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)))))} is VALID [2018-11-23 11:20:18,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {425#(and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~p~0.base_13 (_ BitVec 32)) (v_main_~p~0.offset_13 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_13) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_DerPreprocessor_2)) v_main_~p~0.base_13) (bvadd v_main_~p~0.offset_13 (_ bv4 32)) v_DerPreprocessor_4)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)) (= v_main_~p~0.base_13 main_~list~0.base))) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_3) (_ bv0 1))) (bvsge (select (select (store (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3 (store (select (store |#memory_int| main_~tail~0.base (store (select |#memory_int| main_~tail~0.base) (bvadd main_~tail~0.offset (_ bv4 32)) v_prenex_2)) v_prenex_3) (bvadd v_prenex_4 (_ bv4 32)) v_prenex_1)) main_~list~0.base) main_~list~0.offset) (_ bv10 32)))))} is VALID [2018-11-23 11:20:18,109 INFO L256 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret14 := main(); {348#true} is VALID [2018-11-23 11:20:18,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #69#return; {348#true} is VALID [2018-11-23 11:20:18,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2018-11-23 11:20:18,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {348#true} is VALID [2018-11-23 11:20:18,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2018-11-23 11:20:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:18,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:18,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:20:18,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 11:20:18,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:18,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:20:20,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:20,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:20:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:20:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:20:20,218 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 9 states. [2018-11-23 11:20:25,772 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:20:29,829 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:20:42,216 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 11:20:48,878 WARN L180 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:20:57,279 WARN L180 SmtUtils]: Spent 5.44 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:21:11,962 WARN L180 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:21:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:16,863 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2018-11-23 11:21:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:21:16,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 11:21:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:21:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 132 transitions. [2018-11-23 11:21:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:21:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 132 transitions. [2018-11-23 11:21:16,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 132 transitions. [2018-11-23 11:21:17,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:17,944 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:21:17,944 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:21:17,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=154, Invalid=308, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:21:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:21:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2018-11-23 11:21:18,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:18,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 39 states. [2018-11-23 11:21:18,028 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 39 states. [2018-11-23 11:21:18,029 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 39 states. [2018-11-23 11:21:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:18,036 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2018-11-23 11:21:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2018-11-23 11:21:18,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:18,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:18,038 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 85 states. [2018-11-23 11:21:18,038 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 85 states. [2018-11-23 11:21:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:18,044 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2018-11-23 11:21:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2018-11-23 11:21:18,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:18,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:18,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:18,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:21:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2018-11-23 11:21:18,048 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 16 [2018-11-23 11:21:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:18,049 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2018-11-23 11:21:18,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:21:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2018-11-23 11:21:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:21:18,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:18,050 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:18,051 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:18,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash -583010872, now seen corresponding path program 1 times [2018-11-23 11:21:18,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:18,052 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 11:21:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:18,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:18,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 20 treesize of output 17 [2018-11-23 11:21:18,235 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 17 treesize of output 20 [2018-11-23 11:21:18,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:18,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:21:18,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 20 treesize of output 17 [2018-11-23 11:21:18,331 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 17 treesize of output 20 [2018-11-23 11:21:18,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:18,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:21:18,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,353 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:18,373 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:44, output treesize:22 [2018-11-23 11:21:26,501 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:26,502 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_17|]. (let ((.cse0 (bvadd main_~list~0.offset (_ bv4 32)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_17| main_~list~0.base (store (store (select |v_#memory_$Pointer$.base_17| main_~list~0.base) .cse0 (_ bv0 32)) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_17| main_~list~0.base (store (store (select |v_#memory_$Pointer$.offset_17| main_~list~0.base) .cse0 (_ bv0 32)) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~list~0.offset (_ bv0 32)))) [2018-11-23 11:21:26,502 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~list~0.offset (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse0) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse0) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))) [2018-11-23 11:21:26,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 20 [2018-11-23 11:21:26,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:26,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:21:26,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 20 [2018-11-23 11:21:26,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:26,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:21:26,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:22 [2018-11-23 11:21:26,784 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 15 treesize of output 11 [2018-11-23 11:21:26,789 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 11:21:26,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,810 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 15 treesize of output 11 [2018-11-23 11:21:26,819 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 11:21:26,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:21:26,836 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:26,837 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~p~0.base_15, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_15) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_15) (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (= .cse1 (_ bv0 32)) (= main_~p~0.offset .cse0) (= .cse1 main_~p~0.base))) [2018-11-23 11:21:26,837 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:21:26,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {818#true} call ULTIMATE.init(); {818#true} is VALID [2018-11-23 11:21:26,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {818#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {818#true} is VALID [2018-11-23 11:21:26,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {818#true} assume true; {818#true} is VALID [2018-11-23 11:21:26,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {818#true} {818#true} #69#return; {818#true} is VALID [2018-11-23 11:21:26,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {818#true} call #t~ret14 := main(); {818#true} is VALID [2018-11-23 11:21:26,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {818#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {838#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:26,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {838#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))} goto; {838#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:26,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {838#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {838#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:26,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {838#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:26,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:26,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:26,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:26,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:26,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume ~bvslt32(#t~mem10, 20bv32);havoc #t~mem10;call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~post12 := #t~mem11;call write~intINTTYPE4(~bvadd32(1bv32, #t~post12), ~p~0.base, ~p~0.offset, 4bv32);havoc #t~post12;havoc #t~mem11; {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:26,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {848#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {867#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:21:26,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {819#false} is VALID [2018-11-23 11:21:26,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {819#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {819#false} is VALID [2018-11-23 11:21:26,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {819#false} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {819#false} is VALID [2018-11-23 11:21:26,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {819#false} assume !false; {819#false} is VALID [2018-11-23 11:21:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:26,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:21:27,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:27,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:27,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:27,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:27,409 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:27,415 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:27,459 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:27,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:27,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:21:27,480 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:85, output treesize:25 [2018-11-23 11:21:27,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {819#false} assume !false; {819#false} is VALID [2018-11-23 11:21:27,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {819#false} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {819#false} is VALID [2018-11-23 11:21:27,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {819#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {819#false} is VALID [2018-11-23 11:21:27,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {819#false} is VALID [2018-11-23 11:21:27,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {867#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:21:27,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume ~bvslt32(#t~mem10, 20bv32);havoc #t~mem10;call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~post12 := #t~mem11;call write~intINTTYPE4(~bvadd32(1bv32, #t~post12), ~p~0.base, ~p~0.offset, 4bv32);havoc #t~post12;havoc #t~mem11; {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {911#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {892#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {911#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {911#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {911#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)))} goto; {911#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {818#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {911#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:21:27,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {818#true} call #t~ret14 := main(); {818#true} is VALID [2018-11-23 11:21:27,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {818#true} {818#true} #69#return; {818#true} is VALID [2018-11-23 11:21:27,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {818#true} assume true; {818#true} is VALID [2018-11-23 11:21:27,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {818#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {818#true} is VALID [2018-11-23 11:21:27,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {818#true} call ULTIMATE.init(); {818#true} is VALID [2018-11-23 11:21:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:21:27,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 11:21:27,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:21:27,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:27,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:21:28,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:28,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:21:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:21:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:21:28,060 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 7 states. [2018-11-23 11:21:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:31,835 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 11:21:31,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:21:31,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:21:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:21:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-23 11:21:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:21:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-23 11:21:31,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2018-11-23 11:21:32,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:32,066 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:21:32,066 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:21:32,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:21:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:21:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2018-11-23 11:21:32,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:32,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 59 states. [2018-11-23 11:21:32,293 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 59 states. [2018-11-23 11:21:32,293 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 59 states. [2018-11-23 11:21:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:32,296 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 11:21:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2018-11-23 11:21:32,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:32,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:32,297 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 66 states. [2018-11-23 11:21:32,298 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 66 states. [2018-11-23 11:21:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:32,301 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 11:21:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2018-11-23 11:21:32,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:32,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:32,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:32,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:21:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2018-11-23 11:21:32,306 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 19 [2018-11-23 11:21:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:32,306 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2018-11-23 11:21:32,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:21:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2018-11-23 11:21:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:21:32,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:32,308 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:32,308 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:32,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1995387964, now seen corresponding path program 1 times [2018-11-23 11:21:32,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:32,309 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:32,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:32,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:32,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-23 11:21:32,427 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 8 treesize of output 7 [2018-11-23 11:21:32,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:32,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:32,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:32,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:21:32,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:32,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 11:21:32,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:32,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 11:21:32,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:32,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:32,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:32,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2018-11-23 11:21:34,699 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:34,700 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|]. (let ((.cse1 (select |v_#memory_int_30| main_~list~0.base))) (let ((.cse0 (select .cse1 main_~list~0.offset))) (and (= (_ bv10 32) .cse0) (= (store |v_#memory_int_30| main_~list~0.base (store .cse1 main_~list~0.offset (bvadd .cse0 (_ bv1 32)))) |#memory_int|) (= main_~list~0.offset (_ bv0 32))))) [2018-11-23 11:21:34,700 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32))) [2018-11-23 11:21:34,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1253#true} is VALID [2018-11-23 11:21:34,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {1253#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1253#true} is VALID [2018-11-23 11:21:34,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {1253#true} assume true; {1253#true} is VALID [2018-11-23 11:21:34,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} #69#return; {1253#true} is VALID [2018-11-23 11:21:34,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {1253#true} call #t~ret14 := main(); {1253#true} is VALID [2018-11-23 11:21:34,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {1253#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {1273#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {1273#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} goto; {1273#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {1273#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1273#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {1273#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1283#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {1283#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {1287#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {1287#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {1287#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !!#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {1283#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {1283#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1283#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {1283#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume ~bvslt32(#t~mem10, 20bv32);havoc #t~mem10;call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~post12 := #t~mem11;call write~intINTTYPE4(~bvadd32(1bv32, #t~post12), ~p~0.base, ~p~0.offset, 4bv32);havoc #t~post12;havoc #t~mem11; {1300#(and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {1300#(and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1300#(and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {1300#(and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {1300#(and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:34,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {1300#(and (= (_ bv11 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1310#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv11 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:21:34,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {1310#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv11 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {1314#|main_#t~short9|} is VALID [2018-11-23 11:21:34,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {1314#|main_#t~short9|} assume !#t~short9; {1254#false} is VALID [2018-11-23 11:21:34,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {1254#false} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {1254#false} is VALID [2018-11-23 11:21:34,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2018-11-23 11:21:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:34,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:21:35,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2018-11-23 11:21:35,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {1254#false} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {1254#false} is VALID [2018-11-23 11:21:35,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {1314#|main_#t~short9|} assume !#t~short9; {1254#false} is VALID [2018-11-23 11:21:35,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {1333#(bvsle (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {1314#|main_#t~short9|} is VALID [2018-11-23 11:21:35,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {1337#(bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1333#(bvsle (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))} is VALID [2018-11-23 11:21:35,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {1337#(bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {1337#(bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))} is VALID [2018-11-23 11:21:35,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {1337#(bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1337#(bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))} is VALID [2018-11-23 11:21:35,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {1347#(bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32))} assume ~bvslt32(#t~mem10, 20bv32);havoc #t~mem10;call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~post12 := #t~mem11;call write~intINTTYPE4(~bvadd32(1bv32, #t~post12), ~p~0.base, ~p~0.offset, 4bv32);havoc #t~post12;havoc #t~mem11; {1337#(bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))} is VALID [2018-11-23 11:21:35,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {1347#(bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32))} call #t~mem10 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1347#(bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32))} is VALID [2018-11-23 11:21:35,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {1354#(or (not |main_#t~short9|) (bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32)))} assume !!#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {1347#(bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32))} is VALID [2018-11-23 11:21:35,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {1358#(or (not |main_#t~short9|) (not (bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {1354#(or (not |main_#t~short9|) (bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32)))} is VALID [2018-11-23 11:21:35,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {1362#(or (not (bvsle (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))) (not (bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {1358#(or (not |main_#t~short9|) (not (bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32)))} is VALID [2018-11-23 11:21:35,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {1366#(or (not (bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))) (bvsle (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv1 32)) (_ bv20 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1362#(or (not (bvsle (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))) (not (bvsge (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (bvsle (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)))) main_~list~0.base) main_~list~0.offset) (_ bv20 32)))} is VALID [2018-11-23 11:21:35,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {1366#(or (not (bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))) (bvsle (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv1 32)) (_ bv20 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1366#(or (not (bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))) (bvsle (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv1 32)) (_ bv20 32)))} is VALID [2018-11-23 11:21:35,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {1366#(or (not (bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))) (bvsle (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv1 32)) (_ bv20 32)))} goto; {1366#(or (not (bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))) (bvsle (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv1 32)) (_ bv20 32)))} is VALID [2018-11-23 11:21:35,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {1253#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {1366#(or (not (bvsle (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv20 32))) (bvsle (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (_ bv1 32)) (_ bv20 32)))} is VALID [2018-11-23 11:21:35,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {1253#true} call #t~ret14 := main(); {1253#true} is VALID [2018-11-23 11:21:35,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} #69#return; {1253#true} is VALID [2018-11-23 11:21:35,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {1253#true} assume true; {1253#true} is VALID [2018-11-23 11:21:35,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {1253#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1253#true} is VALID [2018-11-23 11:21:35,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1253#true} is VALID [2018-11-23 11:21:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:35,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:21:35,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-11-23 11:21:35,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:21:35,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:35,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:21:35,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:35,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:21:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:21:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:21:35,691 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 15 states. [2018-11-23 11:21:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:53,956 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2018-11-23 11:21:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:21:53,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:21:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:21:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 112 transitions. [2018-11-23 11:21:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:21:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 112 transitions. [2018-11-23 11:21:53,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 112 transitions. [2018-11-23 11:21:54,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:54,519 INFO L225 Difference]: With dead ends: 133 [2018-11-23 11:21:54,519 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 11:21:54,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:21:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 11:21:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2018-11-23 11:21:54,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:54,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 95 states. [2018-11-23 11:21:54,738 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 95 states. [2018-11-23 11:21:54,738 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 95 states. [2018-11-23 11:21:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:54,742 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-11-23 11:21:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2018-11-23 11:21:54,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:54,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:54,744 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 116 states. [2018-11-23 11:21:54,744 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 116 states. [2018-11-23 11:21:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:54,748 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-11-23 11:21:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2018-11-23 11:21:54,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:54,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:54,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:54,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 11:21:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2018-11-23 11:21:54,754 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 21 [2018-11-23 11:21:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:54,754 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2018-11-23 11:21:54,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:21:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2018-11-23 11:21:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:21:54,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:54,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:54,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:54,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1490230784, now seen corresponding path program 1 times [2018-11-23 11:21:54,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:54,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:54,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:54,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-23 11:21:54,871 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 8 treesize of output 7 [2018-11-23 11:21:54,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:54,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:54,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:54,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:21:55,126 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 17 treesize of output 13 [2018-11-23 11:21:55,130 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 11:21:55,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:55,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:55,135 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 11:21:55,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:21:55,139 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:55,139 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_#t~mem10| .cse0))) [2018-11-23 11:21:55,139 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem10| (_ bv4294967286 32)) (_ bv0 32)) [2018-11-23 11:21:55,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {1930#true} call ULTIMATE.init(); {1930#true} is VALID [2018-11-23 11:21:55,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {1930#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1930#true} is VALID [2018-11-23 11:21:55,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {1930#true} assume true; {1930#true} is VALID [2018-11-23 11:21:55,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} #69#return; {1930#true} is VALID [2018-11-23 11:21:55,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {1930#true} call #t~ret14 := main(); {1930#true} is VALID [2018-11-23 11:21:55,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {1930#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {1950#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:55,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {1950#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} goto; {1950#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:55,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {1950#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1950#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:21:55,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {1950#(and (= (_ bv10 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1960#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:21:55,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {1960#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {1964#(and (= main_~p~0.offset (_ bv0 32)) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:21:55,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {1964#(and (= main_~p~0.offset (_ bv0 32)) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {1964#(and (= main_~p~0.offset (_ bv0 32)) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:21:55,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {1964#(and (= main_~p~0.offset (_ bv0 32)) |main_#t~short9| (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {1960#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:21:55,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {1960#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem10 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1974#(= (bvadd |main_#t~mem10| (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:55,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {1974#(= (bvadd |main_#t~mem10| (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(#t~mem10, 20bv32);havoc #t~mem10;call #t~mem13 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);call write~intINTTYPE4(~bvsdiv32(#t~mem13, 2bv32), ~p~0.base, ~p~0.offset, 4bv32);havoc #t~mem13; {1931#false} is VALID [2018-11-23 11:21:55,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {1931#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1931#false} is VALID [2018-11-23 11:21:55,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {1931#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {1931#false} is VALID [2018-11-23 11:21:55,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {1931#false} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1931#false} is VALID [2018-11-23 11:21:55,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {1931#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {1931#false} is VALID [2018-11-23 11:21:55,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {1931#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {1931#false} is VALID [2018-11-23 11:21:55,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {1931#false} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {1931#false} is VALID [2018-11-23 11:21:55,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {1931#false} assume !false; {1931#false} is VALID [2018-11-23 11:21:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:21:55,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:55,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:55,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:21:55,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:21:55,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:55,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:21:55,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:55,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:21:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:21:55,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:21:55,219 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand 6 states. [2018-11-23 11:21:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:56,918 INFO L93 Difference]: Finished difference Result 125 states and 177 transitions. [2018-11-23 11:21:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:21:56,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:21:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:21:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 11:21:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:21:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 11:21:56,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 11:21:57,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:57,050 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:21:57,050 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 11:21:57,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:21:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 11:21:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 11:21:57,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:57,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 11:21:57,350 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 11:21:57,350 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 11:21:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:57,354 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2018-11-23 11:21:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2018-11-23 11:21:57,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:57,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:57,355 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 11:21:57,355 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 11:21:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:57,360 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2018-11-23 11:21:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2018-11-23 11:21:57,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:57,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:57,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:57,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 11:21:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2018-11-23 11:21:57,365 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 21 [2018-11-23 11:21:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:57,365 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2018-11-23 11:21:57,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:21:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2018-11-23 11:21:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:21:57,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:57,366 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:57,367 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:57,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2028038214, now seen corresponding path program 1 times [2018-11-23 11:21:57,368 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:57,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:57,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:57,547 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 6 treesize of output 5 [2018-11-23 11:21:57,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:57,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:57,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 11:21:57,572 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:57,573 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_26|]. (and (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_26| main_~list~0.base (_ bv1 1))) (= main_~list~0.offset main_~tail~0.offset)) [2018-11-23 11:21:57,573 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset)) [2018-11-23 11:21:57,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:57,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:57,818 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-11-23 11:21:57,819 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:21:57,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:58,701 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-23 11:21:58,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 11:21:58,732 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 10 treesize of output 9 [2018-11-23 11:21:58,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,020 INFO L303 Elim1Store]: Index analysis took 163 ms [2018-11-23 11:21:59,021 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 30 treesize of output 31 [2018-11-23 11:21:59,036 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 17 treesize of output 20 [2018-11-23 11:21:59,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:59,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 33 [2018-11-23 11:21:59,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,139 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:21:59,531 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 8 treesize of output 13 [2018-11-23 11:21:59,537 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,550 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-23 11:21:59,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-23 11:21:59,683 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,738 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 30 treesize of output 31 [2018-11-23 11:21:59,747 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 17 treesize of output 20 [2018-11-23 11:21:59,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:59,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 33 [2018-11-23 11:21:59,805 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,821 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,842 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,856 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:59,928 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:113, output treesize:96 [2018-11-23 11:22:00,509 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:00,510 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_23|, |main_#t~malloc5.base|, main_~p~0.offset, |v_#memory_int_34|, main_~x~0, |v_#valid_27|, |v_#memory_$Pointer$.offset_23|]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~list~0.offset (_ bv4 32)))) (and (= (store |v_#memory_int_34| |main_#t~malloc5.base| (store (select |v_#memory_int_34| |main_#t~malloc5.base|) main_~p~0.offset main_~x~0)) |#memory_int|) (= (_ bv0 1) (select |v_#valid_27| |main_#t~malloc5.base|)) (= |#memory_$Pointer$.base| (let ((.cse0 (store |v_#memory_$Pointer$.base_23| main_~list~0.base (store (select |v_#memory_$Pointer$.base_23| main_~list~0.base) .cse2 |main_#t~malloc5.base|)))) (store .cse0 |main_#t~malloc5.base| (store (store (select .cse0 |main_#t~malloc5.base|) .cse1 (_ bv0 32)) main_~p~0.offset (select (select |#memory_$Pointer$.base| |main_#t~malloc5.base|) main_~p~0.offset))))) (= (_ bv1 1) (select |v_#valid_27| main_~list~0.base)) (not (bvsgt main_~x~0 (_ bv20 32))) (not (bvslt main_~x~0 (_ bv10 32))) (= main_~list~0.offset (_ bv0 32)) (= (let ((.cse3 (store |v_#memory_$Pointer$.offset_23| main_~list~0.base (store (select |v_#memory_$Pointer$.offset_23| main_~list~0.base) .cse2 main_~p~0.offset)))) (store .cse3 |main_#t~malloc5.base| (store (store (select .cse3 |main_#t~malloc5.base|) .cse1 (_ bv0 32)) main_~p~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~malloc5.base|) main_~p~0.offset)))) |#memory_$Pointer$.offset|))) [2018-11-23 11:22:00,510 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse4 (bvadd main_~list~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse4)) (.cse3 (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse4))) (let ((.cse1 (select (select |#memory_int| .cse0) .cse3)) (.cse2 (bvadd .cse3 (_ bv4 32)))) (and (not (= .cse0 main_~list~0.base)) (not (bvsgt .cse1 (_ bv20 32))) (not (bvslt .cse1 (_ bv10 32))) (= (select (select |#memory_$Pointer$.base| .cse0) .cse2) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= main_~list~0.offset (_ bv0 32)))))) [2018-11-23 11:22:00,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:00,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-11-23 11:22:00,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:00,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 11:22:00,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:00,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,127 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 98 treesize of output 97 [2018-11-23 11:22:01,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 89 [2018-11-23 11:22:01,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,300 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2018-11-23 11:22:01,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:01,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 99 [2018-11-23 11:22:01,321 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,392 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:143, output treesize:96 [2018-11-23 11:22:01,586 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:01,587 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_24|, |v_#memory_int_35|, |v_#memory_$Pointer$.offset_24|]. (let ((.cse3 (select |v_#memory_$Pointer$.offset_24| main_~p~0.base)) (.cse2 (select |v_#memory_$Pointer$.base_24| main_~p~0.base)) (.cse7 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse7)) (.cse6 (select .cse3 .cse7))) (let ((.cse1 (bvadd .cse6 (_ bv4 32))) (.cse4 (select (select |v_#memory_int_35| .cse0) .cse6))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |v_#memory_$Pointer$.base_24| .cse0) .cse1) (_ bv0 32)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_24| main_~p~0.base (store .cse2 main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset)))) (= (store |v_#memory_$Pointer$.offset_24| main_~p~0.base (store .cse3 main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_24| .cse0) .cse1)) (not (bvsgt .cse4 (_ bv20 32))) (not (bvslt .cse4 (_ bv10 32))) (= (store |v_#memory_int_35| main_~p~0.base (let ((.cse5 (select |v_#memory_int_35| main_~p~0.base))) (store .cse5 main_~p~0.offset (bvadd (select .cse5 main_~p~0.offset) (_ bv1 32))))) |#memory_int|) (not (= .cse0 main_~p~0.base)))))) [2018-11-23 11:22:01,587 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse4 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse4)) (.cse3 (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse4))) (let ((.cse0 (select (select |#memory_int| .cse1) .cse3)) (.cse2 (bvadd .cse3 (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt .cse0 (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse1) .cse2)) (not (bvslt .cse0 (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) .cse2)) (not (= .cse1 main_~p~0.base)))))) [2018-11-23 11:22:01,615 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 74 treesize of output 66 [2018-11-23 11:22:01,623 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 9 treesize of output 1 [2018-11-23 11:22:01,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,664 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 49 treesize of output 38 [2018-11-23 11:22:01,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,728 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 53 treesize of output 39 [2018-11-23 11:22:01,736 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 7 treesize of output 1 [2018-11-23 11:22:01,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,761 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 32 treesize of output 21 [2018-11-23 11:22:01,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,793 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:89, output treesize:17 [2018-11-23 11:22:01,804 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:01,804 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_23, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_23) (_ bv4 32))) (.cse2 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_23) (_ bv4 32)))) (let ((.cse1 (select (select |#memory_int| .cse0) .cse2)) (.cse3 (bvadd .cse2 (_ bv4 32)))) (and (= .cse0 main_~p~0.base) (not (bvslt .cse1 (_ bv10 32))) (= main_~p~0.offset .cse2) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) .cse3)) (not (= .cse0 v_main_~p~0.base_23)) (not (bvsgt .cse1 (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse3))))) [2018-11-23 11:22:01,804 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (not (bvslt .cse0 (_ bv10 32))) (not (bvsgt .cse0 (_ bv20 32))))) [2018-11-23 11:22:01,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {2476#true} call ULTIMATE.init(); {2476#true} is VALID [2018-11-23 11:22:01,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {2476#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2476#true} is VALID [2018-11-23 11:22:01,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {2476#true} assume true; {2476#true} is VALID [2018-11-23 11:22:01,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2476#true} {2476#true} #69#return; {2476#true} is VALID [2018-11-23 11:22:01,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {2476#true} call #t~ret14 := main(); {2476#true} is VALID [2018-11-23 11:22:01,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {2476#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(10bv32, ~list~0.base, ~list~0.offset, 4bv32); {2496#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} is VALID [2018-11-23 11:22:01,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {2496#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} goto; {2496#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} is VALID [2018-11-23 11:22:01,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {2496#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3;~x~0 := #t~nondet4;havoc #t~nondet4; {2496#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} is VALID [2018-11-23 11:22:01,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {2496#(and (= (_ bv1 1) (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~tail~0.base) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset main_~tail~0.offset))} assume !(~bvslt32(~x~0, 10bv32) || ~bvsgt32(~x~0, 20bv32));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, ~bvadd32(4bv32, ~tail~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~x~0, ~p~0.base, ~p~0.offset, 4bv32);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {2506#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv20 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:22:01,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {2506#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv20 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} goto; {2506#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv20 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:22:01,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {2506#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv20 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2506#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv20 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:22:01,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {2506#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base)) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (_ bv20 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:22:01,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:22:01,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:22:01,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !!#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:22:01,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} call #t~mem10 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:22:02,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume ~bvslt32(#t~mem10, 20bv32);havoc #t~mem10;call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~post12 := #t~mem11;call write~intINTTYPE4(~bvadd32(1bv32, #t~post12), ~p~0.base, ~p~0.offset, 4bv32);havoc #t~post12;havoc #t~mem11; {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:22:02,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {2516#(and (= main_~p~0.offset (_ bv0 32)) (not (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv20 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv10 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2535#(and (not (bvslt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))))} is VALID [2018-11-23 11:22:02,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {2535#(and (not (bvslt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsle32(#t~mem7, 20bv32); {2535#(and (not (bvslt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))))} is VALID [2018-11-23 11:22:02,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {2535#(and (not (bvslt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv10 32))) (not (bvsgt (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv20 32))))} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32);#t~short9 := ~bvsge32(#t~mem8, 10bv32); {2542#|main_#t~short9|} is VALID [2018-11-23 11:22:02,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {2542#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~mem8; {2477#false} is VALID [2018-11-23 11:22:02,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2477#false} assume !false; {2477#false} is VALID [2018-11-23 11:22:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:02,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:02,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:02,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:02,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:02,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:02,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:02,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:39 [2018-11-23 11:22:08,505 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2018-11-23 11:22:09,139 INFO L303 Elim1Store]: Index analysis took 628 ms [2018-11-23 11:22:09,220 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 59 treesize of output 69 [2018-11-23 11:22:09,612 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 11:22:09,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 52 [2018-11-23 11:22:09,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 52 [2018-11-23 11:22:09,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 51 treesize of output 50 [2018-11-23 11:22:09,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:09,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 50 treesize of output 49 [2018-11-23 11:22:09,777 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:12,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 54 treesize of output 53 [2018-11-23 11:22:12,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:13,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 54 treesize of output 53 [2018-11-23 11:22:13,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:13,047 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:13,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-11-23 11:22:13,058 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:16,160 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-11-23 11:22:16,177 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 50 treesize of output 52 [2018-11-23 11:22:16,226 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-23 11:22:16,235 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:16,990 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:16,990 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:16,992 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 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-23 11:22:16,998 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:17,549 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:17,821 INFO L303 Elim1Store]: Index analysis took 270 ms [2018-11-23 11:22:17,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 62 [2018-11-23 11:22:18,197 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:22:18,228 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:22:18,228 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:18,258 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2018-11-23 11:22:18,263 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:19,798 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 48 treesize of output 42 [2018-11-23 11:22:19,800 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:21,296 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 11:22:21,303 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:23,053 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:23,563 INFO L303 Elim1Store]: Index analysis took 508 ms [2018-11-23 11:22:23,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 79 [2018-11-23 11:22:24,139 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-23 11:22:24,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-11-23 11:22:24,206 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:27,974 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 46 treesize of output 40 [2018-11-23 11:22:27,976 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:32,502 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:32,503 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:32,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-23 11:22:32,511 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:35,066 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:35,067 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:35,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-11-23 11:22:35,072 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:37,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 11:22:37,736 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:39,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-23 11:22:39,507 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:41,908 INFO L267 ElimStorePlain]: Start of recursive call 18: 9 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:22:43,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:43,793 INFO L303 Elim1Store]: Index analysis took 425 ms [2018-11-23 11:22:43,881 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 107 treesize of output 101 [2018-11-23 11:22:44,305 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-23 11:22:44,350 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 50 treesize of output 49 [2018-11-23 11:22:44,381 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:44,404 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:22:44,428 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:44,469 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 50 treesize of output 49 [2018-11-23 11:22:44,494 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:44,513 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:22:44,515 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:46,582 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 51 treesize of output 50 [2018-11-23 11:22:46,586 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:46,778 INFO L303 Elim1Store]: Index analysis took 191 ms [2018-11-23 11:22:46,779 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 51 treesize of output 50 [2018-11-23 11:22:46,794 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:48,795 INFO L303 Elim1Store]: Index analysis took 253 ms [2018-11-23 11:22:48,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 76 [2018-11-23 11:22:49,304 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:22:49,333 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:49,334 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:49,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-11-23 11:22:49,340 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:52,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 11:22:52,409 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:53,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 11:22:54,027 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:55,695 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 45 treesize of output 39 [2018-11-23 11:22:55,698 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:57,040 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:57,044 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:57,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-23 11:22:57,057 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:58,265 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:58,266 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:22:58,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-11-23 11:22:58,272 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:02,160 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 11:23:02,163 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:02,887 INFO L267 ElimStorePlain]: Start of recursive call 32: 9 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:03,092 INFO L303 Elim1Store]: Index analysis took 202 ms [2018-11-23 11:23:03,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-11-23 11:23:03,343 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:23:03,369 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:03,370 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:03,372 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 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-23 11:23:03,375 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:04,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 11:23:04,934 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:05,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 11:23:05,848 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,629 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 45 treesize of output 39 [2018-11-23 11:23:06,633 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:07,649 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 11:23:07,653 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,186 INFO L267 ElimStorePlain]: Start of recursive call 40: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:10,996 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:11,265 INFO L303 Elim1Store]: Index analysis took 265 ms [2018-11-23 11:23:11,266 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-11-23 11:23:11,382 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 9 treesize of output 8 [2018-11-23 11:23:11,383 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:12,629 INFO L303 Elim1Store]: Index analysis took 367 ms [2018-11-23 11:23:12,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 65 [2018-11-23 11:23:12,714 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 55 treesize of output 49 [2018-11-23 11:23:12,721 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:14,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-11-23 11:23:14,715 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,338 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 40 treesize of output 34 [2018-11-23 11:23:16,341 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:17,664 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-23 11:23:17,668 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,667 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-11-23 11:23:18,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 38 [2018-11-23 11:23:18,694 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:19,639 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:19,640 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:19,642 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 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:23:19,655 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:20,435 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 11:23:20,440 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,414 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,417 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,453 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,457 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,459 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-23 11:23:21,475 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 1 case distinctions, treesize of input 28 treesize of output 47 [2018-11-23 11:23:21,486 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 11:23:23,067 INFO L267 ElimStorePlain]: Start of recursive call 48: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:23,131 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 44 treesize of output 43 [2018-11-23 11:23:23,177 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 6 treesize of output 1 [2018-11-23 11:23:23,177 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,433 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 11:23:23,436 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,543 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,686 INFO L303 Elim1Store]: Index analysis took 142 ms [2018-11-23 11:23:23,721 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 1 case distinctions, treesize of input 46 treesize of output 50 [2018-11-23 11:23:23,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2018-11-23 11:23:23,769 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:24,234 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 31 treesize of output 25 [2018-11-23 11:23:24,237 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:24,604 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:24,605 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:24,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-23 11:23:24,611 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:25,038 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:25,157 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-23 11:23:25,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2018-11-23 11:23:25,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2018-11-23 11:23:25,241 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:25,895 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:25,896 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:25,898 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 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-23 11:23:25,905 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:26,392 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 31 treesize of output 25 [2018-11-23 11:23:26,398 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,913 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:27,358 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:28,201 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,223 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,240 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:28,273 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:23:28,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-11-23 11:23:28,669 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 11 treesize of output 10 [2018-11-23 11:23:28,671 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,831 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 46 [2018-11-23 11:23:28,853 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 32 treesize of output 35 [2018-11-23 11:23:28,869 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:28,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 11:23:28,883 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,930 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,224 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2018-11-23 11:23:29,289 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:29,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2018-11-23 11:23:29,505 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:29,638 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:29,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-11-23 11:23:29,648 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,778 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:29,910 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:30,013 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:30,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2018-11-23 11:23:30,760 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-23 11:23:30,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 35 [2018-11-23 11:23:30,856 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 3 xjuncts. [2018-11-23 11:23:33,792 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 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 11:23:33,796 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-23 11:23:34,087 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,333 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 30 treesize of output 22 [2018-11-23 11:23:34,334 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-11-23 11:23:34,599 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:34,891 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 22 treesize of output 14 [2018-11-23 11:23:34,893 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-23 11:23:35,136 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:35,329 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 11:23:35,331 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,336 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:23:35,338 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,774 INFO L267 ElimStorePlain]: Start of recursive call 80: 13 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:23:35,802 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 33 treesize of output 37 [2018-11-23 11:23:35,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-23 11:23:35,895 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,962 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 22 treesize of output 14 [2018-11-23 11:23:35,964 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts.