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/ldv-sets/test_add_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:11:35,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:11:35,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:11:35,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:11:35,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:11:35,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:11:35,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:11:35,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:11:35,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:11:35,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:11:35,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:11:35,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:11:35,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:11:35,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:11:35,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:11:35,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:11:35,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:11:35,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:11:35,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:11:35,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:11:35,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:11:35,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:11:35,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:11:35,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:11:35,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:11:35,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:11:35,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:11:35,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:11:35,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:11:35,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:11:35,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:11:35,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:11:35,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:11:35,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:11:35,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:11:35,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:11:35,146 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:11:35,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:11:35,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:11:35,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:11:35,176 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:11:35,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:11:35,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:11:35,179 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:11:35,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:11:35,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:11:35,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:11:35,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:11:35,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:11:35,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:11:35,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:11:35,181 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:11:35,181 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:11:35,181 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:11:35,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:11:35,181 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:11:35,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:11:35,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:11:35,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:11:35,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:11:35,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:11:35,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:11:35,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:11:35,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:11:35,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:11:35,184 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:11:35,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:11:35,184 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:11:35,184 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:11:35,184 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:11:35,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:11:35,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:11:35,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:11:35,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:11:35,262 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:11:35,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_add_true-unreach-call_true-termination.i [2018-11-23 11:11:35,322 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67bd2929/cd384f7ad6b44696b9e3d4e0d7c0c4d2/FLAGb581723dd [2018-11-23 11:11:35,820 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:11:35,821 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_add_true-unreach-call_true-termination.i [2018-11-23 11:11:35,839 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67bd2929/cd384f7ad6b44696b9e3d4e0d7c0c4d2/FLAGb581723dd [2018-11-23 11:11:36,088 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67bd2929/cd384f7ad6b44696b9e3d4e0d7c0c4d2 [2018-11-23 11:11:36,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:11:36,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:11:36,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:11:36,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:11:36,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:11:36,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:36,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b651c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36, skipping insertion in model container [2018-11-23 11:11:36,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:36,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:11:36,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:11:36,692 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:11:36,712 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:11:36,902 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:11:36,989 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:11:36,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36 WrapperNode [2018-11-23 11:11:36,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:11:36,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:11:36,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:11:36,991 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:11:37,001 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:11:36" (1/1) ... [2018-11-23 11:11:37,032 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:11:36" (1/1) ... [2018-11-23 11:11:37,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:11:37,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:11:37,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:11:37,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:11:37,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (1/1) ... [2018-11-23 11:11:37,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:11:37,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:11:37,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:11:37,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:11:37,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (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:11:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:11:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:11:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-11-23 11:11:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-11-23 11:11:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-11-23 11:11:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-11-23 11:11:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:11:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:11:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:11:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:11:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:11:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2018-11-23 11:11:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2018-11-23 11:11:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2018-11-23 11:11:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2018-11-23 11:11:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:11:37,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:11:37,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:11:37,192 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 11:11:37,192 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 11:11:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2018-11-23 11:11:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2018-11-23 11:11:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:11:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:11:38,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:11:38,195 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:11:38,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:11:38 BoogieIcfgContainer [2018-11-23 11:11:38,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:11:38,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:11:38,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:11:38,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:11:38,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:11:36" (1/3) ... [2018-11-23 11:11:38,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6420422e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:11:38, skipping insertion in model container [2018-11-23 11:11:38,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:36" (2/3) ... [2018-11-23 11:11:38,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6420422e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:11:38, skipping insertion in model container [2018-11-23 11:11:38,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:11:38" (3/3) ... [2018-11-23 11:11:38,204 INFO L112 eAbstractionObserver]: Analyzing ICFG test_add_true-unreach-call_true-termination.i [2018-11-23 11:11:38,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:11:38,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:11:38,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:11:38,269 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:11:38,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:11:38,270 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:11:38,270 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:11:38,270 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:11:38,270 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:11:38,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:11:38,271 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:11:38,271 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:11:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-23 11:11:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:11:38,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:38,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:38,299 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:38,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1941476234, now seen corresponding path program 1 times [2018-11-23 11:11:38,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:38,311 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:11:38,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:38,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:38,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-23 11:11:38,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32); {48#true} is VALID [2018-11-23 11:11:38,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-23 11:11:38,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #75#return; {48#true} is VALID [2018-11-23 11:11:38,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret29 := main(); {48#true} is VALID [2018-11-23 11:11:38,622 INFO L256 TraceCheckUtils]: 5: Hoare triple {48#true} call foo(); {48#true} is VALID [2018-11-23 11:11:38,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} ~j~0 := #t~nondet27;havoc #t~nondet27; {48#true} is VALID [2018-11-23 11:11:38,622 INFO L256 TraceCheckUtils]: 7: Hoare triple {48#true} call ldv_set_add(~j~0, ~#s1~0.base, ~#s1~0.offset); {48#true} is VALID [2018-11-23 11:11:38,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#true} ~new := #in~new;~s.base, ~s.offset := #in~s.base, #in~s.offset; {48#true} is VALID [2018-11-23 11:11:38,623 INFO L256 TraceCheckUtils]: 9: Hoare triple {48#true} call #t~ret17 := ldv_is_in_set(~new, ~s.base, ~s.offset); {48#true} is VALID [2018-11-23 11:11:38,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {48#true} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {48#true} is VALID [2018-11-23 11:11:38,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {48#true} assume !!(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset);call #t~mem25 := read~intINTTYPE4(~m~1.base, ~m~1.offset, 4bv32); {48#true} is VALID [2018-11-23 11:11:38,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {48#true} assume #t~mem25 == ~e;havoc #t~mem25;#res := 1bv32; {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:38,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} assume true; {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:38,649 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} {48#true} #69#return; {48#true} is VALID [2018-11-23 11:11:38,649 INFO L273 TraceCheckUtils]: 15: Hoare triple {48#true} assume !(0bv32 == #t~ret17);havoc #t~ret17; {48#true} is VALID [2018-11-23 11:11:38,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-23 11:11:38,650 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {48#true} {48#true} #63#return; {48#true} is VALID [2018-11-23 11:11:38,650 INFO L256 TraceCheckUtils]: 18: Hoare triple {48#true} call #t~ret28 := ldv_is_in_set(~j~0, ~#s1~0.base, ~#s1~0.offset); {48#true} is VALID [2018-11-23 11:11:38,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {48#true} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {48#true} is VALID [2018-11-23 11:11:38,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {48#true} assume !!(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset);call #t~mem25 := read~intINTTYPE4(~m~1.base, ~m~1.offset, 4bv32); {48#true} is VALID [2018-11-23 11:11:38,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {48#true} assume #t~mem25 == ~e;havoc #t~mem25;#res := 1bv32; {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:38,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} assume true; {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:38,691 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {89#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} {48#true} #65#return; {123#(= (_ bv1 32) |foo_#t~ret28|)} is VALID [2018-11-23 11:11:38,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {123#(= (_ bv1 32) |foo_#t~ret28|)} assume 0bv32 == #t~ret28;havoc #t~ret28; {49#false} is VALID [2018-11-23 11:11:38,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-23 11:11:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:11:38,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:11:38,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 11:11:38,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:38,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:11:38,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:38,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:11:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:11:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:11:38,888 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-11-23 11:11:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:40,275 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-11-23 11:11:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:11:40,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 11:11:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:11:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 11:11:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:11:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 11:11:40,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2018-11-23 11:11:40,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:40,666 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:11:40,666 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:11:40,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:11:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:11:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:11:40,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:40,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:11:40,721 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:11:40,722 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:11:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:40,729 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 11:11:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:11:40,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:40,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:40,730 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:11:40,731 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:11:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:40,736 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 11:11:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:11:40,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:40,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:40,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:40,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:11:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-23 11:11:40,744 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 26 [2018-11-23 11:11:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:40,745 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-23 11:11:40,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:11:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:11:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:11:40,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:40,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:40,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1992269889, now seen corresponding path program 1 times [2018-11-23 11:11:40,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:40,749 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:11:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:40,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:41,117 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 7 treesize of output 5 [2018-11-23 11:11:41,128 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 5 treesize of output 1 [2018-11-23 11:11:41,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:41,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:41,187 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:11:41,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:41,242 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:11:41,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:41,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:41,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:41,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-11-23 11:11:41,274 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:41,274 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_3|, |v_#memory_$Pointer$.offset_BEFORE_CALL_3|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_BEFORE_CALL_3| |~#s1~0.base|))) (and (= (select .cse0 |~#s1~0.offset|) |~#s1~0.base|) (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_3| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |~#s1~0.base| (select .cse0 (bvadd |~#s1~0.offset| (_ bv4 32)))))) [2018-11-23 11:11:41,275 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 11:11:41,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2018-11-23 11:11:41,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {375#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32); {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} is VALID [2018-11-23 11:11:41,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} assume true; {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} is VALID [2018-11-23 11:11:41,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} {375#true} #75#return; {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} is VALID [2018-11-23 11:11:41,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} call #t~ret29 := main(); {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} is VALID [2018-11-23 11:11:41,771 INFO L256 TraceCheckUtils]: 5: Hoare triple {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} call foo(); {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} is VALID [2018-11-23 11:11:41,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} ~j~0 := #t~nondet27;havoc #t~nondet27; {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} is VALID [2018-11-23 11:11:41,773 INFO L256 TraceCheckUtils]: 7: Hoare triple {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} call ldv_set_add(~j~0, ~#s1~0.base, ~#s1~0.offset); {402#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:11:41,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {402#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~new := #in~new;~s.base, ~s.offset := #in~s.base, #in~s.offset; {406#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} is VALID [2018-11-23 11:11:41,777 INFO L256 TraceCheckUtils]: 9: Hoare triple {406#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} call #t~ret17 := ldv_is_in_set(~new, ~s.base, ~s.offset); {410#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:11:41,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {410#(= |~#s1~0.offset| (_ bv0 32))} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {414#(and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset) ldv_is_in_set_~m~1.base) (= (bvadd ldv_is_in_set_~m~1.offset (_ bv4 32)) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|))} is VALID [2018-11-23 11:11:41,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {414#(and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset) ldv_is_in_set_~m~1.base) (= (bvadd ldv_is_in_set_~m~1.offset (_ bv4 32)) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|))} assume !!(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset);call #t~mem25 := read~intINTTYPE4(~m~1.base, ~m~1.offset, 4bv32); {418#(and (= |~#s1~0.offset| (_ bv0 32)) (or (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:11:41,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {418#(and (= |~#s1~0.offset| (_ bv0 32)) (or (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|))))} assume #t~mem25 == ~e;havoc #t~mem25;#res := 1bv32; {418#(and (= |~#s1~0.offset| (_ bv0 32)) (or (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:11:41,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {418#(and (= |~#s1~0.offset| (_ bv0 32)) (or (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|))))} assume true; {418#(and (= |~#s1~0.offset| (_ bv0 32)) (or (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:11:41,814 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {418#(and (= |~#s1~0.offset| (_ bv0 32)) (or (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|))))} {406#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} #69#return; {428#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 11:11:41,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {428#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} assume !(0bv32 == #t~ret17);havoc #t~ret17; {428#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 11:11:41,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {428#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} assume true; {428#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 11:11:41,818 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {428#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} {383#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|))} #63#return; {376#false} is VALID [2018-11-23 11:11:41,819 INFO L256 TraceCheckUtils]: 18: Hoare triple {376#false} call #t~ret28 := ldv_is_in_set(~j~0, ~#s1~0.base, ~#s1~0.offset); {376#false} is VALID [2018-11-23 11:11:41,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {376#false} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {376#false} is VALID [2018-11-23 11:11:41,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {376#false} assume !(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset); {376#false} is VALID [2018-11-23 11:11:41,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {376#false} #res := 0bv32; {376#false} is VALID [2018-11-23 11:11:41,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {376#false} assume true; {376#false} is VALID [2018-11-23 11:11:41,821 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {376#false} {376#false} #65#return; {376#false} is VALID [2018-11-23 11:11:41,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {376#false} assume 0bv32 == #t~ret28;havoc #t~ret28; {376#false} is VALID [2018-11-23 11:11:41,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2018-11-23 11:11:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:41,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:41,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:11:41,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:11:41,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:41,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:11:41,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:41,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:11:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:11:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:11:41,913 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 9 states. [2018-11-23 11:11:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:46,473 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 11:11:46,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:11:46,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:11:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:11:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2018-11-23 11:11:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:11:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2018-11-23 11:11:46,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 94 transitions. [2018-11-23 11:11:46,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:46,814 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:11:46,814 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:11:46,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:11:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:11:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-23 11:11:46,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:46,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 53 states. [2018-11-23 11:11:46,950 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 53 states. [2018-11-23 11:11:46,950 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 53 states. [2018-11-23 11:11:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:46,957 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-11-23 11:11:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 11:11:46,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:46,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:46,959 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 70 states. [2018-11-23 11:11:46,959 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 70 states. [2018-11-23 11:11:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:46,965 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-11-23 11:11:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 11:11:46,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:46,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:46,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:46,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:11:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-23 11:11:46,970 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 26 [2018-11-23 11:11:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:46,971 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-23 11:11:46,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:11:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 11:11:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:11:46,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:46,973 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:46,973 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:46,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash 43650710, now seen corresponding path program 1 times [2018-11-23 11:11:46,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:46,974 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:11:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:47,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:47,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-23 11:11:47,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32); {808#true} is VALID [2018-11-23 11:11:47,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 11:11:47,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #75#return; {808#true} is VALID [2018-11-23 11:11:47,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret29 := main(); {808#true} is VALID [2018-11-23 11:11:47,109 INFO L256 TraceCheckUtils]: 5: Hoare triple {808#true} call foo(); {808#true} is VALID [2018-11-23 11:11:47,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {808#true} ~j~0 := #t~nondet27;havoc #t~nondet27; {808#true} is VALID [2018-11-23 11:11:47,109 INFO L256 TraceCheckUtils]: 7: Hoare triple {808#true} call ldv_set_add(~j~0, ~#s1~0.base, ~#s1~0.offset); {808#true} is VALID [2018-11-23 11:11:47,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {808#true} ~new := #in~new;~s.base, ~s.offset := #in~s.base, #in~s.offset; {808#true} is VALID [2018-11-23 11:11:47,110 INFO L256 TraceCheckUtils]: 9: Hoare triple {808#true} call #t~ret17 := ldv_is_in_set(~new, ~s.base, ~s.offset); {808#true} is VALID [2018-11-23 11:11:47,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {808#true} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {808#true} is VALID [2018-11-23 11:11:47,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {808#true} assume !(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset); {808#true} is VALID [2018-11-23 11:11:47,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#true} #res := 0bv32; {849#(= |ldv_is_in_set_#res| (_ bv0 32))} is VALID [2018-11-23 11:11:47,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {849#(= |ldv_is_in_set_#res| (_ bv0 32))} assume true; {849#(= |ldv_is_in_set_#res| (_ bv0 32))} is VALID [2018-11-23 11:11:47,123 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {849#(= |ldv_is_in_set_#res| (_ bv0 32))} {808#true} #69#return; {856#(= |ldv_set_add_#t~ret17| (_ bv0 32))} is VALID [2018-11-23 11:11:47,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {856#(= |ldv_set_add_#t~ret17| (_ bv0 32))} assume !(0bv32 == #t~ret17);havoc #t~ret17; {809#false} is VALID [2018-11-23 11:11:47,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {809#false} assume true; {809#false} is VALID [2018-11-23 11:11:47,124 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {809#false} {808#true} #63#return; {809#false} is VALID [2018-11-23 11:11:47,124 INFO L256 TraceCheckUtils]: 18: Hoare triple {809#false} call #t~ret28 := ldv_is_in_set(~j~0, ~#s1~0.base, ~#s1~0.offset); {809#false} is VALID [2018-11-23 11:11:47,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {809#false} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {809#false} is VALID [2018-11-23 11:11:47,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {809#false} assume !(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset); {809#false} is VALID [2018-11-23 11:11:47,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {809#false} #res := 0bv32; {809#false} is VALID [2018-11-23 11:11:47,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {809#false} assume true; {809#false} is VALID [2018-11-23 11:11:47,125 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {809#false} {809#false} #65#return; {809#false} is VALID [2018-11-23 11:11:47,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {809#false} assume 0bv32 == #t~ret28;havoc #t~ret28; {809#false} is VALID [2018-11-23 11:11:47,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-23 11:11:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:47,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:47,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:47,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:11:47,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 11:11:47,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:47,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:11:47,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:47,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:11:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:11:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:11:47,174 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-11-23 11:11:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:48,017 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-23 11:11:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:11:48,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 11:11:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:11:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 11:11:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:11:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 11:11:48,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 11:11:48,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:48,120 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:11:48,121 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:11:48,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:11:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:11:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2018-11-23 11:11:48,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:48,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 45 states. [2018-11-23 11:11:48,195 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 45 states. [2018-11-23 11:11:48,196 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 45 states. [2018-11-23 11:11:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:48,200 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:11:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:11:48,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:48,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:48,201 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 53 states. [2018-11-23 11:11:48,201 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 53 states. [2018-11-23 11:11:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:48,205 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:11:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:11:48,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:48,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:48,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:48,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:11:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-23 11:11:48,212 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2018-11-23 11:11:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:48,212 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-23 11:11:48,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:11:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 11:11:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:11:48,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:48,214 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:48,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:48,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1877696277, now seen corresponding path program 1 times [2018-11-23 11:11:48,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:48,216 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:11:48,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:48,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:48,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {1153#true} call ULTIMATE.init(); {1153#true} is VALID [2018-11-23 11:11:48,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {1153#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32); {1153#true} is VALID [2018-11-23 11:11:48,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2018-11-23 11:11:48,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1153#true} #75#return; {1153#true} is VALID [2018-11-23 11:11:48,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {1153#true} call #t~ret29 := main(); {1153#true} is VALID [2018-11-23 11:11:48,477 INFO L256 TraceCheckUtils]: 5: Hoare triple {1153#true} call foo(); {1153#true} is VALID [2018-11-23 11:11:48,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {1153#true} ~j~0 := #t~nondet27;havoc #t~nondet27; {1153#true} is VALID [2018-11-23 11:11:48,477 INFO L256 TraceCheckUtils]: 7: Hoare triple {1153#true} call ldv_set_add(~j~0, ~#s1~0.base, ~#s1~0.offset); {1153#true} is VALID [2018-11-23 11:11:48,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {1153#true} ~new := #in~new;~s.base, ~s.offset := #in~s.base, #in~s.offset; {1153#true} is VALID [2018-11-23 11:11:48,478 INFO L256 TraceCheckUtils]: 9: Hoare triple {1153#true} call #t~ret17 := ldv_is_in_set(~new, ~s.base, ~s.offset); {1153#true} is VALID [2018-11-23 11:11:48,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {1153#true} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {1153#true} is VALID [2018-11-23 11:11:48,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {1153#true} assume !!(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset);call #t~mem25 := read~intINTTYPE4(~m~1.base, ~m~1.offset, 4bv32); {1153#true} is VALID [2018-11-23 11:11:48,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {1153#true} assume #t~mem25 == ~e;havoc #t~mem25;#res := 1bv32; {1194#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:48,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} assume true; {1194#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:48,484 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1194#(= (bvadd |ldv_is_in_set_#res| (_ bv4294967295 32)) (_ bv0 32))} {1153#true} #69#return; {1201#(= (bvadd |ldv_set_add_#t~ret17| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:48,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {1201#(= (bvadd |ldv_set_add_#t~ret17| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == #t~ret17;havoc #t~ret17;havoc ~le~0.base, ~le~0.offset; {1154#false} is VALID [2018-11-23 11:11:48,485 INFO L256 TraceCheckUtils]: 16: Hoare triple {1154#false} call #t~ret18.base, #t~ret18.offset := ldv_successful_malloc(12bv32); {1154#false} is VALID [2018-11-23 11:11:48,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {1154#false} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0bv32 != (if ~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32 then 1bv32 else 0bv32);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1154#false} is VALID [2018-11-23 11:11:48,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {1154#false} assume true; {1154#false} is VALID [2018-11-23 11:11:48,486 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1154#false} {1154#false} #71#return; {1154#false} is VALID [2018-11-23 11:11:48,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {1154#false} ~le~0.base, ~le~0.offset := #t~ret18.base, #t~ret18.offset;havoc #t~ret18.base, #t~ret18.offset;call write~intINTTYPE4(~new, ~le~0.base, ~le~0.offset, 4bv32); {1154#false} is VALID [2018-11-23 11:11:48,487 INFO L256 TraceCheckUtils]: 21: Hoare triple {1154#false} call ldv_list_add(~le~0.base, ~bvadd32(4bv32, ~le~0.offset), ~s.base, ~s.offset); {1154#false} is VALID [2018-11-23 11:11:48,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {1154#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1154#false} is VALID [2018-11-23 11:11:48,487 INFO L256 TraceCheckUtils]: 23: Hoare triple {1154#false} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem6.base, #t~mem6.offset); {1154#false} is VALID [2018-11-23 11:11:48,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {1154#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32);call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); {1154#false} is VALID [2018-11-23 11:11:48,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {1154#false} assume true; {1154#false} is VALID [2018-11-23 11:11:48,488 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1154#false} {1154#false} #61#return; {1154#false} is VALID [2018-11-23 11:11:48,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {1154#false} havoc #t~mem6.base, #t~mem6.offset; {1154#false} is VALID [2018-11-23 11:11:48,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {1154#false} assume true; {1154#false} is VALID [2018-11-23 11:11:48,489 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1154#false} {1154#false} #73#return; {1154#false} is VALID [2018-11-23 11:11:48,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {1154#false} assume true; {1154#false} is VALID [2018-11-23 11:11:48,490 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1154#false} {1153#true} #63#return; {1154#false} is VALID [2018-11-23 11:11:48,490 INFO L256 TraceCheckUtils]: 32: Hoare triple {1154#false} call #t~ret28 := ldv_is_in_set(~j~0, ~#s1~0.base, ~#s1~0.offset); {1154#false} is VALID [2018-11-23 11:11:48,490 INFO L273 TraceCheckUtils]: 33: Hoare triple {1154#false} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {1154#false} is VALID [2018-11-23 11:11:48,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {1154#false} assume !(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset); {1154#false} is VALID [2018-11-23 11:11:48,491 INFO L273 TraceCheckUtils]: 35: Hoare triple {1154#false} #res := 0bv32; {1154#false} is VALID [2018-11-23 11:11:48,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {1154#false} assume true; {1154#false} is VALID [2018-11-23 11:11:48,491 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1154#false} {1154#false} #65#return; {1154#false} is VALID [2018-11-23 11:11:48,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {1154#false} assume 0bv32 == #t~ret28;havoc #t~ret28; {1154#false} is VALID [2018-11-23 11:11:48,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2018-11-23 11:11:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:48,494 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:48,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:48,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:11:48,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:11:48,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:48,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:11:48,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:11:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:11:48,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:11:48,566 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2018-11-23 11:11:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:49,287 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 11:11:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:11:49,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:11:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:11:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 11:11:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:11:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 11:11:49,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 11:11:49,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:49,477 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:11:49,478 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:11:49,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:11:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:11:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 11:11:49,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:49,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 11:11:49,629 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 11:11:49,629 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 11:11:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:49,631 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 11:11:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 11:11:49,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:49,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:49,632 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 11:11:49,632 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 11:11:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:49,635 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 11:11:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 11:11:49,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:49,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:49,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:49,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:11:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 11:11:49,638 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-11-23 11:11:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:49,638 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 11:11:49,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:11:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 11:11:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:11:49,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:49,640 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:49,640 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:49,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash -752088190, now seen corresponding path program 1 times [2018-11-23 11:11:49,641 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:49,641 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:11:49,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:49,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:49,806 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 9 treesize of output 12 [2018-11-23 11:11:49,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:49,836 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 11:11:49,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:49,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:49,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:49,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:45 [2018-11-23 11:11:49,883 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:49,884 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_16|]. (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= |#valid| (store (store |v_#valid_16| (_ bv0 32) (_ bv0 1)) |~#s1~0.base| (_ bv1 1)))) [2018-11-23 11:11:49,884 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|)) (.cse2 (= (_ bv1 1) (select |#valid| |~#s1~0.base|)))) (or (and .cse0 .cse1 .cse2 (= (select |#valid| (_ bv0 32)) (_ bv0 1))) (and .cse0 .cse1 (= |~#s1~0.base| (_ bv0 32)) .cse2))) [2018-11-23 11:11:50,100 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 21 treesize of output 19 [2018-11-23 11:11:50,151 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:11:50,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,208 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 23 treesize of output 21 [2018-11-23 11:11:50,213 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:11:50,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:50,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2018-11-23 11:11:50,246 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:50,246 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_prenex_1]. (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (bvadd |~#s1~0.offset| (_ bv4 32))) (.cse2 (= (_ bv1 1) (select |#valid| |~#s1~0.base|)))) (or (and .cse0 (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) .cse1) |~#s1~0.base|) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) .cse2) (and .cse0 (= (select (select v_prenex_1 |~#s1~0.base|) .cse1) |~#s1~0.base|) (= |~#s1~0.base| (_ bv0 32)) .cse2))) [2018-11-23 11:11:50,247 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= (_ bv1 1) (select |#valid| |~#s1~0.base|)))) (or (and .cse0 (= |~#s1~0.base| (_ bv0 32)) .cse1) (and .cse0 (= (select |#valid| (_ bv0 32)) (_ bv0 1)) .cse1))) [2018-11-23 11:11:50,310 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 15 treesize of output 10 [2018-11-23 11:11:50,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:50,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:50,340 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 17 treesize of output 11 [2018-11-23 11:11:50,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:7 [2018-11-23 11:11:50,361 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:50,362 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_3|, v_prenex_2]. (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= |#valid| |old(#valid)|))) (or (and .cse0 (= (select |v_#valid_BEFORE_CALL_3| |~#s1~0.base|) (_ bv1 1)) .cse1 (= |~#s1~0.base| (_ bv0 32))) (and .cse0 .cse1 (= (select v_prenex_2 (_ bv0 32)) (_ bv0 1)) (= (select v_prenex_2 |~#s1~0.base|) (_ bv1 1))))) [2018-11-23 11:11:50,362 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|)) [2018-11-23 11:11:50,676 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 77 treesize of output 48 [2018-11-23 11:11:50,885 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:11:50,917 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:11:50,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:51,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-11-23 11:11:51,188 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 0 case distinctions, treesize of input 39 treesize of output 41 [2018-11-23 11:11:51,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 44 [2018-11-23 11:11:51,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:51,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:52,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2018-11-23 11:11:52,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,062 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 16 treesize of output 23 [2018-11-23 11:11:52,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:52,108 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 57 [2018-11-23 11:11:53,126 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 43 treesize of output 44 [2018-11-23 11:11:53,143 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 42 treesize of output 41 [2018-11-23 11:11:53,298 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,362 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 50 [2018-11-23 11:11:53,913 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 41 treesize of output 40 [2018-11-23 11:11:53,916 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:54,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2018-11-23 11:11:54,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:54,248 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 44 treesize of output 53 [2018-11-23 11:11:54,251 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:54,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:54,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 [2018-11-23 11:11:54,434 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:54,661 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:11:54,929 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:11:55,336 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 42 treesize of output 39 [2018-11-23 11:11:55,344 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 8 treesize of output 7 [2018-11-23 11:11:55,345 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:55,376 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:55,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:55,566 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 45 treesize of output 58 [2018-11-23 11:11:55,619 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 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-23 11:11:55,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:55,657 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:55,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-11-23 11:11:55,661 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:55,730 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:56,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-23 11:11:56,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:56,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:56,512 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 30 treesize of output 42 [2018-11-23 11:11:56,515 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:56,575 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,148 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 48 treesize of output 43 [2018-11-23 11:11:57,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 47 [2018-11-23 11:11:57,221 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:57,324 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:58,018 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 43 treesize of output 34 [2018-11-23 11:11:58,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:58,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-11-23 11:11:58,059 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,100 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,449 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:58,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:11:58,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 11:11:58,823 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:81, output treesize:99 [2018-11-23 11:12:00,835 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:00,836 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_22|, __ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.offset]. (and (= |~#s1~0.offset| (_ bv0 32)) (= (let ((.cse0 (let ((.cse1 (store |v_#memory_$Pointer$.base_22| __ldv_list_add_~next.base (store (select |v_#memory_$Pointer$.base_22| __ldv_list_add_~next.base) (bvadd __ldv_list_add_~next.offset (_ bv4 32)) |__ldv_list_add_#in~new.base|)))) (store .cse1 |__ldv_list_add_#in~new.base| (store (store (select .cse1 |__ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset __ldv_list_add_~next.base) (bvadd __ldv_list_add_~new.offset (_ bv4 32)) |__ldv_list_add_#in~prev.base|))))) (store .cse0 |__ldv_list_add_#in~prev.base| (store (select .cse0 |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset| |__ldv_list_add_#in~new.base|))) |#memory_$Pointer$.base|)) [2018-11-23 11:12:00,836 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [__ldv_list_add_~new.offset, v_prenex_13, __ldv_list_add_~next.offset, __ldv_list_add_~next.base, v_prenex_12]. (let ((.cse2 (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))) (.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|))) (or (and .cse0 (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select .cse1 __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) .cse2 (= (select .cse1 (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|)) (and .cse0 (= (select .cse1 (bvadd __ldv_list_add_~next.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|) .cse2 (= |__ldv_list_add_#in~new.base| (select .cse1 __ldv_list_add_~next.offset))) (let ((.cse3 (select (select |#memory_$Pointer$.base| __ldv_list_add_~next.base) (bvadd v_prenex_12 (_ bv4 32))))) (and .cse0 (= .cse3 |__ldv_list_add_#in~prev.base|) (= |__ldv_list_add_#in~new.base| (select .cse1 |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.base| (select .cse1 (bvadd |__ldv_list_add_#in~prev.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| .cse3))))) [2018-11-23 11:12:17,183 WARN L180 SmtUtils]: Spent 16.22 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-11-23 11:12:25,511 WARN L180 SmtUtils]: Spent 8.18 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 11:12:33,891 WARN L180 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:12:33,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:33,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:33,986 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 55 treesize of output 49 [2018-11-23 11:12:33,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,180 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 49 treesize of output 43 [2018-11-23 11:12:34,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-11-23 11:12:34,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 11:12:34,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-23 11:12:34,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:213, output treesize:187 [2018-11-23 11:12:34,785 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:34,786 WARN L384 uantifierElimination]: Input elimination task: ∃ [__ldv_list_add_~new.offset, v_prenex_13, |v_old(#valid)_AFTER_CALL_12|, v_prenex_19, v_prenex_15, __ldv_list_add_~next.offset, v_prenex_14, v_prenex_17, v_prenex_18, v_prenex_16]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (let ((.cse3 (= |~#s1~0.base| (_ bv0 32))) (.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse2 (select |#memory_$Pointer$.base| .cse1))) (or (and .cse0 (= .cse1 (select .cse2 v_prenex_19)) (= (select v_prenex_15 (_ bv0 32)) (_ bv0 1)) (= (select v_prenex_15 |~#s1~0.base|) (_ bv1 1)) (= (_ bv0 1) (select v_prenex_15 .cse1)) (= |~#s1~0.base| (select .cse2 (bvadd v_prenex_19 (_ bv4 32))))) (and .cse0 (= (select |v_old(#valid)_AFTER_CALL_12| |~#s1~0.base|) (_ bv1 1)) .cse3 (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_12| .cse1)) (= (select (select |#memory_$Pointer$.base| (select .cse2 __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32))) .cse1) (= |~#s1~0.base| (select .cse2 (bvadd __ldv_list_add_~new.offset (_ bv4 32))))) (and .cse0 (= |~#s1~0.base| (select .cse2 (bvadd __ldv_list_add_~next.offset (_ bv4 32)))) (= .cse1 (select .cse2 __ldv_list_add_~next.offset)) (= (select v_prenex_14 |~#s1~0.base|) (_ bv1 1)) .cse3 (= (_ bv0 1) (select v_prenex_14 .cse1))) (and .cse0 (= (select v_prenex_16 (_ bv0 32)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select .cse2 v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) .cse1) (= (select v_prenex_16 |~#s1~0.base|) (_ bv1 1)) (= |~#s1~0.base| (select .cse2 (bvadd v_prenex_17 (_ bv4 32)))) (= (_ bv0 1) (select v_prenex_16 .cse1)))))) [2018-11-23 11:12:34,786 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [__ldv_list_add_~new.offset, v_prenex_13, __ldv_list_add_~next.offset, v_prenex_17, v_prenex_18, v_prenex_19]. (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (.cse4 (= |~#s1~0.base| (_ bv0 32)))) (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse5 (not .cse4)) (.cse3 (not (= |~#s1~0.base| .cse2))) (.cse1 (select |#memory_$Pointer$.base| .cse2))) (or (and .cse0 (= |~#s1~0.base| (select .cse1 (bvadd __ldv_list_add_~next.offset (_ bv4 32)))) (= .cse2 (select .cse1 __ldv_list_add_~next.offset)) .cse3 .cse4) (and .cse0 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| (select .cse1 __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32))) .cse2) (= |~#s1~0.base| (select .cse1 (bvadd __ldv_list_add_~new.offset (_ bv4 32))))) (and .cse0 .cse5 .cse3 (= (select (select |#memory_$Pointer$.base| (select .cse1 v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) .cse2) (= |~#s1~0.base| (select .cse1 (bvadd v_prenex_17 (_ bv4 32))))) (and .cse0 (= .cse2 (select .cse1 v_prenex_19)) .cse5 .cse3 (= |~#s1~0.base| (select .cse1 (bvadd v_prenex_19 (_ bv4 32)))))))) [2018-11-23 11:12:39,052 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-11-23 11:12:43,425 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:12:45,689 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:12:45,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {1533#true} call ULTIMATE.init(); {1533#true} is VALID [2018-11-23 11:12:45,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {1533#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32); {1541#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} is VALID [2018-11-23 11:12:45,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {1541#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} assume true; {1541#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} is VALID [2018-11-23 11:12:45,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1541#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} {1533#true} #75#return; {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} is VALID [2018-11-23 11:12:45,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} call #t~ret29 := main(); {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} is VALID [2018-11-23 11:12:45,855 INFO L256 TraceCheckUtils]: 5: Hoare triple {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} call foo(); {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} is VALID [2018-11-23 11:12:45,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} ~j~0 := #t~nondet27;havoc #t~nondet27; {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} is VALID [2018-11-23 11:12:45,884 INFO L256 TraceCheckUtils]: 7: Hoare triple {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} call ldv_set_add(~j~0, ~#s1~0.base, ~#s1~0.offset); {1561#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|))} is VALID [2018-11-23 11:12:45,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {1561#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|))} ~new := #in~new;~s.base, ~s.offset := #in~s.base, #in~s.offset; {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} is VALID [2018-11-23 11:12:45,906 INFO L256 TraceCheckUtils]: 9: Hoare triple {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} call #t~ret17 := ldv_is_in_set(~new, ~s.base, ~s.offset); {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:45,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {1569#(= |~#s1~0.offset| (_ bv0 32))} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:45,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {1569#(= |~#s1~0.offset| (_ bv0 32))} assume !(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset); {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:45,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {1569#(= |~#s1~0.offset| (_ bv0 32))} #res := 0bv32; {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:45,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {1569#(= |~#s1~0.offset| (_ bv0 32))} assume true; {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:45,929 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1569#(= |~#s1~0.offset| (_ bv0 32))} {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} #69#return; {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} is VALID [2018-11-23 11:12:45,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} assume 0bv32 == #t~ret17;havoc #t~ret17;havoc ~le~0.base, ~le~0.offset; {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} is VALID [2018-11-23 11:12:45,930 INFO L256 TraceCheckUtils]: 16: Hoare triple {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} call #t~ret18.base, #t~ret18.offset := ldv_successful_malloc(12bv32); {1561#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|))} is VALID [2018-11-23 11:12:45,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {1561#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|))} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0bv32 != (if ~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32 then 1bv32 else 0bv32);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1594#(and (= |~#s1~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_successful_malloc_#res.base|)))} is VALID [2018-11-23 11:12:45,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {1594#(and (= |~#s1~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_successful_malloc_#res.base|)))} assume true; {1594#(and (= |~#s1~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_successful_malloc_#res.base|)))} is VALID [2018-11-23 11:12:45,933 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1594#(and (= |~#s1~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_successful_malloc_#res.base|)))} {1565#(and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} #71#return; {1601#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| |ldv_set_add_#t~ret18.base|) (_ bv0 1)) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} is VALID [2018-11-23 11:12:45,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {1601#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| |ldv_set_add_#t~ret18.base|) (_ bv0 1)) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} ~le~0.base, ~le~0.offset := #t~ret18.base, #t~ret18.offset;havoc #t~ret18.base, #t~ret18.offset;call write~intINTTYPE4(~new, ~le~0.base, ~le~0.offset, 4bv32); {1605#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| ldv_set_add_~le~0.base) (_ bv0 1)) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} is VALID [2018-11-23 11:12:45,937 INFO L256 TraceCheckUtils]: 21: Hoare triple {1605#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| ldv_set_add_~le~0.base) (_ bv0 1)) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} call ldv_list_add(~le~0.base, ~bvadd32(4bv32, ~le~0.offset), ~s.base, ~s.offset); {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:45,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {1569#(= |~#s1~0.offset| (_ bv0 32))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1612#(and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_list_add_#in~new.base| ldv_list_add_~new.base) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |ldv_list_add_#in~head.offset| ldv_list_add_~head.offset))} is VALID [2018-11-23 11:12:45,939 INFO L256 TraceCheckUtils]: 23: Hoare triple {1612#(and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_list_add_#in~new.base| ldv_list_add_~new.base) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |ldv_list_add_#in~head.offset| ldv_list_add_~head.offset))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem6.base, #t~mem6.offset); {1569#(= |~#s1~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:47,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {1569#(= |~#s1~0.offset| (_ bv0 32))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32);call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); {1619#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|)))))} is UNKNOWN [2018-11-23 11:12:47,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {1619#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|)))))} assume true; {1619#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|)))))} is VALID [2018-11-23 11:12:47,955 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1619#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |__ldv_list_add_#in~prev.base|)))))} {1612#(and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_list_add_#in~new.base| ldv_list_add_~new.base) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |ldv_list_add_#in~head.offset| ldv_list_add_~head.offset))} #61#return; {1626#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))))} is VALID [2018-11-23 11:12:47,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {1626#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))))} havoc #t~mem6.base, #t~mem6.offset; {1626#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))))} is VALID [2018-11-23 11:12:47,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {1626#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))))} assume true; {1626#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))))} is VALID [2018-11-23 11:12:47,978 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1626#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32)))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~new.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) __ldv_list_add_~next.offset)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))))) (= |ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))))} {1605#(and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| ldv_set_add_~le~0.base) (_ bv0 1)) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= |ldv_set_add_#in~s.offset| ldv_set_add_~s.offset))} #73#return; {1636#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |ldv_set_add_#in~s.base|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~next.offset) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1))))} is VALID [2018-11-23 11:12:47,979 INFO L273 TraceCheckUtils]: 30: Hoare triple {1636#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |ldv_set_add_#in~s.base|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~next.offset) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1))))} assume true; {1636#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |ldv_set_add_#in~s.base|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~next.offset) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1))))} is VALID [2018-11-23 11:12:47,983 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1636#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1)) (exists ((__ldv_list_add_~new.offset (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~new.offset)) (bvadd v_prenex_13 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~new.offset (_ bv4 32))) |ldv_set_add_#in~s.base|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (and (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (bvadd __ldv_list_add_~next.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) __ldv_list_add_~next.offset) (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|)) (_ bv0 1))))} {1548#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |~#s1~0.base| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| |~#s1~0.base|))))} #63#return; {1643#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))))} is VALID [2018-11-23 11:12:47,984 INFO L256 TraceCheckUtils]: 32: Hoare triple {1643#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))))} call #t~ret28 := ldv_is_in_set(~j~0, ~#s1~0.base, ~#s1~0.offset); {1643#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))))} is VALID [2018-11-23 11:12:47,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {1643#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))))} ~e := #in~e;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4bv32);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~bvsub32(~__mptr~3.offset, 4bv32); {1650#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:12:47,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {1650#(or (and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) |ldv_is_in_set_#in~s.offset|))))} assume !(~m~1.base != ~s.base || ~bvadd32(4bv32, ~m~1.offset) != ~s.offset); {1654#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:12:47,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {1654#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))))} #res := 0bv32; {1654#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:12:47,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {1654#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))))} assume true; {1654#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))))} is VALID [2018-11-23 11:12:47,999 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1654#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))))} {1643#(or (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_19 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_19)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_19 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))) (and (= |~#s1~0.offset| (_ bv0 32)) (exists ((v_prenex_17 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) v_prenex_17)) (bvadd v_prenex_18 (_ bv4 32))) (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (bvadd v_prenex_17 (_ bv4 32)))))) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)))))} #65#return; {1534#false} is VALID [2018-11-23 11:12:47,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {1534#false} assume 0bv32 == #t~ret28;havoc #t~ret28; {1534#false} is VALID [2018-11-23 11:12:47,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {1534#false} assume !false; {1534#false} is VALID [2018-11-23 11:12:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:12:48,013 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:48,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:48,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-23 11:12:48,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 11:12:48,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:48,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:12:50,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:50,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:12:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:12:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:12:50,314 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-11-23 11:12:51,124 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-11-23 11:12:52,910 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-11-23 11:13:13,140 WARN L180 SmtUtils]: Spent 16.22 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 11:13:25,897 WARN L180 SmtUtils]: Spent 12.33 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-23 11:13:38,752 WARN L180 SmtUtils]: Spent 12.40 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-23 11:13:43,330 WARN L180 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:13:47,777 WARN L180 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 11:14:06,651 WARN L180 SmtUtils]: Spent 18.36 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-23 11:14:31,560 WARN L180 SmtUtils]: Spent 24.41 s on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-23 11:14:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:32,934 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 11:14:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:14:32,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 11:14:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:14:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2018-11-23 11:14:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:14:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2018-11-23 11:14:32,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 55 transitions. [2018-11-23 11:14:34,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:34,988 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:14:34,988 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:14:34,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 137.7s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:14:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:14:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 11:14:35,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:35,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-23 11:14:35,113 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-23 11:14:35,114 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-23 11:14:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:35,117 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 11:14:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 11:14:35,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:35,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:35,117 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-23 11:14:35,118 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-23 11:14:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:35,119 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 11:14:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 11:14:35,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:35,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:35,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:35,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:14:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 11:14:35,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-11-23 11:14:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:35,122 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 11:14:35,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:14:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 11:14:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:14:35,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:35,123 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:14:35,123 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:35,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -441484042, now seen corresponding path program 1 times [2018-11-23 11:14:35,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:35,124 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:14:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:35,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:35,359 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 9 treesize of output 12 [2018-11-23 11:14:35,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:35,400 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 11:14:35,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:14:35,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:14:35,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:14:35,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:73 [2018-11-23 11:14:35,484 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:35,485 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_18|]. (let ((.cse0 (select |#memory_$Pointer$.base| |~#s1~0.base|))) (and (= |~#s1~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| (select .cse0 |~#s1~0.offset|)) (= (select .cse0 (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|) (= (store (store |v_#valid_18| (_ bv0 32) (_ bv0 1)) |~#s1~0.base| (_ bv1 1)) |#valid|))) [2018-11-23 11:14:35,485 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (select |#memory_$Pointer$.base| |~#s1~0.base|))) (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|)) (.cse2 (= |~#s1~0.base| (select .cse5 |~#s1~0.offset|))) (.cse3 (= (select .cse5 (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|)) (.cse4 (= (_ bv1 1) (select |#valid| |~#s1~0.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= |~#s1~0.base| (_ bv0 32)) .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select |#valid| (_ bv0 32)) (_ bv0 1)))))) [2018-11-23 11:14:35,642 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 35 treesize of output 33 [2018-11-23 11:14:35,647 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 5 treesize of output 1 [2018-11-23 11:14:35,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:35,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:35,716 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 37 treesize of output 35 [2018-11-23 11:14:35,722 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 5 treesize of output 1 [2018-11-23 11:14:35,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:35,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:35,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:14:35,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:59 [2018-11-23 11:14:35,800 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:35,800 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_prenex_20]. (let ((.cse4 (select |#memory_$Pointer$.base| |~#s1~0.base|))) (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= |~#s1~0.base| (select .cse4 |~#s1~0.offset|))) (.cse2 (= (select .cse4 (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|)) (.cse3 (= (_ bv1 1) (select |#valid| |~#s1~0.base|)))) (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) .cse1 .cse2 (= |~#s1~0.base| (_ bv0 32)) .cse3) (and .cse0 (= (select (select v_prenex_20 |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) .cse1 .cse2 (= (select |#valid| (_ bv0 32)) (_ bv0 1)) .cse3)))) [2018-11-23 11:14:35,800 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse4 (select |#memory_$Pointer$.base| |~#s1~0.base|))) (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= |~#s1~0.base| (select .cse4 |~#s1~0.offset|))) (.cse2 (= (select .cse4 (bvadd |~#s1~0.offset| (_ bv4 32))) |~#s1~0.base|)) (.cse3 (= (_ bv1 1) (select |#valid| |~#s1~0.base|)))) (or (and .cse0 .cse1 .cse2 (= |~#s1~0.base| (_ bv0 32)) .cse3) (and .cse0 .cse1 .cse2 (= (select |#valid| (_ bv0 32)) (_ bv0 1)) .cse3)))) [2018-11-23 11:14:35,932 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 34 treesize of output 29 [2018-11-23 11:14:35,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:35,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:35,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:35,998 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 36 treesize of output 30 [2018-11-23 11:14:36,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,062 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 29 treesize of output 25 [2018-11-23 11:14:36,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:36,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:14:36,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,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 26 treesize of output 22 [2018-11-23 11:14:36,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:36,174 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:14:36,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,243 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:10 [2018-11-23 11:14:36,249 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:36,250 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_7|, |v_#valid_BEFORE_CALL_9|, v_prenex_22, v_prenex_21]. (let ((.cse0 (= |~#s1~0.offset| (_ bv0 32))) (.cse1 (= |#valid| |old(#valid)|)) (.cse3 (bvadd |~#s1~0.offset| (_ bv4 32))) (.cse4 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (let ((.cse2 (select |v_#memory_$Pointer$.base_BEFORE_CALL_7| |~#s1~0.base|))) (and .cse0 .cse1 (= (_ bv0 1) (select |v_#valid_BEFORE_CALL_9| (_ bv0 32))) (= (select .cse2 .cse3) |~#s1~0.base|) .cse4 (= (select |v_#valid_BEFORE_CALL_9| |~#s1~0.base|) (_ bv1 1)) (= |~#s1~0.base| (select .cse2 |~#s1~0.offset|)))) (let ((.cse5 (select v_prenex_22 |~#s1~0.base|))) (and .cse0 (= |~#s1~0.base| (select .cse5 |~#s1~0.offset|)) .cse1 (= (select v_prenex_21 |~#s1~0.base|) (_ bv1 1)) (= (select .cse5 .cse3) |~#s1~0.base|) (= |~#s1~0.base| (_ bv0 32)) .cse4)))) [2018-11-23 11:14:36,250 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |~#s1~0.offset| (_ bv0 32)) (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 11:14:36,501 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:14:36,507 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:14:36,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:36,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-23 11:14:36,832 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:14:37,535 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:14:41,530 INFO L303 Elim1Store]: Index analysis took 510 ms [2018-11-23 11:14:41,531 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 77 treesize of output 48 [2018-11-23 11:14:41,812 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:14:41,952 INFO L303 Elim1Store]: Index analysis took 138 ms [2018-11-23 11:14:41,952 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:14:41,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:47,197 INFO L303 Elim1Store]: Index analysis took 2606 ms [2018-11-23 11:14:47,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-11-23 11:14:47,313 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 42 treesize of output 50 [2018-11-23 11:14:47,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:47,643 INFO L303 Elim1Store]: Index analysis took 323 ms [2018-11-23 11:14:47,644 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 35 [2018-11-23 11:14:47,646 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:50,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:00,924 INFO L303 Elim1Store]: Index analysis took 252 ms [2018-11-23 11:15:01,255 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 39 treesize of output 47 [2018-11-23 11:15:01,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:01,610 INFO L303 Elim1Store]: Index analysis took 328 ms [2018-11-23 11:15:01,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 11:15:01,613 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:08,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:08,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:08,699 INFO L303 Elim1Store]: Index analysis took 896 ms [2018-11-23 11:15:08,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 [2018-11-23 11:15:08,926 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:18,166 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts.