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/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:09:46,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:09:46,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:09:46,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:09:46,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:09:46,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:09:46,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:09:46,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:09:46,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:09:46,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:09:46,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:09:46,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:09:46,933 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:09:46,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:09:46,935 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:09:46,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:09:46,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:09:46,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:09:46,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:09:46,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:09:46,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:09:46,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:09:46,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:09:46,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:09:46,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:09:46,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:09:46,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:09:46,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:09:46,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:09:46,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:09:46,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:09:46,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:09:46,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:09:46,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:09:46,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:09:46,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:09:46,957 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:09:46,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:09:46,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:09:46,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:09:46,990 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:09:46,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:09:46,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:09:46,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:09:46,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:09:46,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:09:46,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:09:46,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:09:46,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:09:46,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:09:46,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:09:46,994 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:09:46,994 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:09:46,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:09:46,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:09:46,994 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:09:46,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:09:46,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:09:46,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:09:46,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:09:46,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:09:46,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:09:46,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:09:46,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:09:46,997 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:09:46,998 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:09:46,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:09:46,998 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:09:46,998 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:09:46,998 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:09:47,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:09:47,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:09:47,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:09:47,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:09:47,067 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:09:47,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:09:47,128 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e544df1/81e52e8828c647e79dfdc4e7d3230f82/FLAG0b05061bd [2018-11-23 11:09:47,730 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:09:47,731 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:09:47,743 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e544df1/81e52e8828c647e79dfdc4e7d3230f82/FLAG0b05061bd [2018-11-23 11:09:47,967 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e544df1/81e52e8828c647e79dfdc4e7d3230f82 [2018-11-23 11:09:47,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:09:47,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:09:47,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:47,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:09:47,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:09:47,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:47,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b6fda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:47, skipping insertion in model container [2018-11-23 11:09:47,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:47" (1/1) ... [2018-11-23 11:09:48,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:09:48,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:09:48,550 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:48,579 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:09:48,652 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:48,800 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:09:48,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48 WrapperNode [2018-11-23 11:09:48,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:48,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:48,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:09:48,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:09:48,812 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:09:48" (1/1) ... [2018-11-23 11:09:48,844 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:09:48" (1/1) ... [2018-11-23 11:09:48,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:48,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:09:48,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:09:48,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:09:48,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (1/1) ... [2018-11-23 11:09:48,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:09:48,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:09:48,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:09:48,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:09:48,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (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:09:48,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:09:48,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:09:48,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:09:48,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:09:48,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:09:48,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:09:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:09:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:09:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:09:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:09:48,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:09:48,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:09:50,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:09:50,228 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:09:50,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:50 BoogieIcfgContainer [2018-11-23 11:09:50,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:09:50,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:09:50,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:09:50,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:09:50,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:09:47" (1/3) ... [2018-11-23 11:09:50,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb50013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:50, skipping insertion in model container [2018-11-23 11:09:50,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:48" (2/3) ... [2018-11-23 11:09:50,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb50013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:50, skipping insertion in model container [2018-11-23 11:09:50,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:50" (3/3) ... [2018-11-23 11:09:50,239 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:09:50,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:09:50,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:09:50,281 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:09:50,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:09:50,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:09:50,319 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:09:50,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:09:50,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:09:50,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:09:50,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:09:50,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:09:50,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:09:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 11:09:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:09:50,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:50,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:50,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:50,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1695376401, now seen corresponding path program 1 times [2018-11-23 11:09:50,360 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:50,360 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:09:50,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:50,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:50,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 11:09:50,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 11:09:50,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 11:09:50,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2018-11-23 11:09:50,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret19 := main(); {33#true} is VALID [2018-11-23 11:09:50,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {33#true} is VALID [2018-11-23 11:09:50,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 11:09:50,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {34#false} is VALID [2018-11-23 11:09:50,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {34#false} is VALID [2018-11-23 11:09:50,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-23 11:09:50,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {34#false} is VALID [2018-11-23 11:09:50,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem16 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {34#false} is VALID [2018-11-23 11:09:50,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume 1bv32 == #t~mem16;havoc #t~mem16; {34#false} is VALID [2018-11-23 11:09:50,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 11:09:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:09:50,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:09:50,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:50,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:09:50,584 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:09:50,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:50,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:09:50,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:50,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:09:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:09:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:09:50,713 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 11:09:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:51,613 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-23 11:09:51,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:09:51,614 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:09:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2018-11-23 11:09:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2018-11-23 11:09:51,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 81 transitions. [2018-11-23 11:09:52,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:52,066 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:09:52,066 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:09:52,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:09:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:09:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:09:52,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:52,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:09:52,223 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:09:52,223 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:09:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:52,227 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-23 11:09:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 11:09:52,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:52,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:52,229 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:09:52,229 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:09:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:52,234 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-23 11:09:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 11:09:52,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:52,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:52,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:52,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:09:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 11:09:52,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2018-11-23 11:09:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:52,246 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 11:09:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:09:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 11:09:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:09:52,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:52,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:52,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:52,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -549272152, now seen corresponding path program 1 times [2018-11-23 11:09:52,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:52,252 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:09:52,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:52,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:52,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 6 treesize of output 5 [2018-11-23 11:09:52,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:52,536 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 13 treesize of output 10 [2018-11-23 11:09:52,548 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:09:52,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:52,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:52,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:52,577 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-23 11:09:52,594 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:52,595 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, |v_#valid_17|]. (and (= (store |v_#valid_17| main_~head~0.base (_ bv1 1)) |#valid|) (= |#memory_int| (store |v_#memory_int_32| main_~head~0.base (store (select |v_#memory_int_32| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)) (_ bv0 32)))) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:09:52,595 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (select |#valid| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:09:52,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:52,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:52,859 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 13 treesize of output 4 [2018-11-23 11:09:52,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:53,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:09:53,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:09:53,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 11:09:53,647 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 11 treesize of output 14 [2018-11-23 11:09:53,670 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 14 treesize of output 15 [2018-11-23 11:09:53,673 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:53,733 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:53,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:53,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:53,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-11-23 11:09:54,025 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 38 treesize of output 37 [2018-11-23 11:09:54,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 11:09:54,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-11-23 11:09:54,157 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,177 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,198 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,301 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 14 treesize of output 11 [2018-11-23 11:09:54,317 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 11 treesize of output 14 [2018-11-23 11:09:54,331 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 14 treesize of output 15 [2018-11-23 11:09:54,337 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,350 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,362 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,407 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:84, output treesize:43 [2018-11-23 11:09:54,520 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:54,520 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_32|, v_main_~head~0.base_8, |v_#memory_int_33|, |v_#memory_$Pointer$.offset_32|, |v_#memory_int_34|, |v_#valid_18|]. (let ((.cse0 (select |v_#memory_int_33| main_~head~0.base))) (and (= (store |v_#memory_int_33| main_~head~0.base (store .cse0 (_ bv4 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32)))) |#memory_int|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_32| main_~head~0.base (store (store (select |v_#memory_$Pointer$.base_32| main_~head~0.base) (_ bv0 32) v_main_~head~0.base_8) (_ bv4 32) (_ bv0 32)))) (= (store |v_#memory_$Pointer$.offset_32| main_~head~0.base (store (store (select |v_#memory_$Pointer$.offset_32| main_~head~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (select (select |v_#memory_int_34| v_main_~head~0.base_8) (_ bv8 32)) (_ bv0 32)) (= |v_#memory_int_33| (store |v_#memory_int_34| main_~head~0.base (store (store (select |v_#memory_int_34| main_~head~0.base) (_ bv8 32) (_ bv1 32)) (_ bv0 32) (select .cse0 (_ bv0 32))))) (= (bvadd (select |v_#valid_18| v_main_~head~0.base_8) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (select |v_#valid_18| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:09:54,521 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_$Pointer$.offset| main_~head~0.base)) (.cse0 (select |#memory_$Pointer$.base| main_~head~0.base))) (and (= (_ bv0 32) (select (select |#memory_int| (select .cse0 (_ bv0 32))) (_ bv8 32))) (= (_ bv0 32) (select .cse1 (_ bv0 32))) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv8 32))) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:09:54,801 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 22 treesize of output 16 [2018-11-23 11:09:54,831 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 16 treesize of output 3 [2018-11-23 11:09:54,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,862 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 20 [2018-11-23 11:09:54,883 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 20 treesize of output 7 [2018-11-23 11:09:54,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:54,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:09:54,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:18 [2018-11-23 11:09:54,930 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:54,930 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~x~0.base_25, |#memory_$Pointer$.base|]. (let ((.cse0 (select |#memory_$Pointer$.base| v_main_~x~0.base_25)) (.cse3 (select |#memory_$Pointer$.offset| v_main_~x~0.base_25))) (let ((.cse1 (select .cse3 (_ bv0 32))) (.cse2 (select .cse0 (_ bv0 32)))) (and (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= main_~x~0.offset .cse1) (= (_ bv1 32) (select (select |#memory_int| v_main_~x~0.base_25) (_ bv8 32))) (= (_ bv0 32) .cse1) (= (_ bv0 32) (select (select |#memory_int| .cse2) (_ bv8 32))) (= .cse2 main_~x~0.base) (= (_ bv0 32) (select .cse3 (_ bv4 32)))))) [2018-11-23 11:09:54,931 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~x~0.base_25]. (and (= (_ bv1 32) (select (select |#memory_int| v_main_~x~0.base_25) (_ bv8 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32)))) [2018-11-23 11:09:55,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:55,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:55,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 11:09:55,264 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:09:55,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:09:55,294 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:09:55,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:55,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:55,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:55,311 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-23 11:09:55,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:55,316 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, v_main_~x~0.base_25]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv8 32)))) (and (= (_ bv1 32) (select (select |#memory_int| v_main_~x~0.base_25) (_ bv8 32))) (= (_ bv0 32) .cse0) (= |main_#t~mem16| .cse0))) [2018-11-23 11:09:55,316 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem16| (_ bv0 32)) [2018-11-23 11:09:55,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2018-11-23 11:09:55,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {218#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {218#true} is VALID [2018-11-23 11:09:55,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2018-11-23 11:09:55,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #115#return; {218#true} is VALID [2018-11-23 11:09:55,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret19 := main(); {218#true} is VALID [2018-11-23 11:09:55,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {218#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {238#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:09:55,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {238#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {238#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:09:55,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {238#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {245#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv8 32))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:09:55,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {245#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv8 32))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {249#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:09:55,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {249#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))))} call #t~mem13 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {249#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:09:55,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {249#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))))} assume !(1bv32 != #t~mem13);havoc #t~mem13; {249#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:09:55,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {249#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {259#(and (exists ((v_main_~x~0.base_25 (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| v_main_~x~0.base_25) (_ bv8 32)))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:09:55,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {259#(and (exists ((v_main_~x~0.base_25 (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| v_main_~x~0.base_25) (_ bv8 32)))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem16 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {263#(= |main_#t~mem16| (_ bv0 32))} is VALID [2018-11-23 11:09:55,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#(= |main_#t~mem16| (_ bv0 32))} assume 1bv32 == #t~mem16;havoc #t~mem16; {219#false} is VALID [2018-11-23 11:09:55,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {219#false} assume !false; {219#false} is VALID [2018-11-23 11:09:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:09:55,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:09:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:09:55,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 11:09:55,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:55,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:09:55,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:55,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:09:55,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:09:55,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:09:55,439 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 7 states. [2018-11-23 11:10:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:02,129 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2018-11-23 11:10:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:10:02,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 11:10:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:10:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-23 11:10:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:10:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-23 11:10:02,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-23 11:10:02,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:02,479 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:10:02,479 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:10:02,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:10:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:10:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2018-11-23 11:10:02,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:02,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 30 states. [2018-11-23 11:10:02,537 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 30 states. [2018-11-23 11:10:02,538 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 30 states. [2018-11-23 11:10:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:02,542 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 11:10:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 11:10:02,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:02,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:02,544 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 46 states. [2018-11-23 11:10:02,544 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 46 states. [2018-11-23 11:10:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:02,549 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 11:10:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 11:10:02,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:02,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:02,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:02,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:10:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-11-23 11:10:02,557 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 15 [2018-11-23 11:10:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:02,558 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-23 11:10:02,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:10:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2018-11-23 11:10:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:10:02,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:02,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:02,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:02,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -454160642, now seen corresponding path program 1 times [2018-11-23 11:10:02,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:02,564 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:10:02,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:02,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:02,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:10:02,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,783 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 13 treesize of output 10 [2018-11-23 11:10:02,788 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:10:02,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,812 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 11:10:02,831 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:02,832 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, |v_#valid_19|]. (and (= |#valid| (store |v_#valid_19| main_~head~0.base (_ bv1 1))) (= main_~head~0.base main_~x~0.base) (= |#memory_int| (store |v_#memory_int_35| main_~head~0.base (store (select |v_#memory_int_35| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)) (_ bv0 32)))) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) [2018-11-23 11:10:02,832 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) [2018-11-23 11:10:02,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:02,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:02,948 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 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-23 11:10:02,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:03,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:03,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 71 [2018-11-23 11:10:03,560 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:10:03,562 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-23 11:10:03,659 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 32 treesize of output 20 [2018-11-23 11:10:03,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,707 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-11-23 11:10:03,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:03,986 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 16 treesize of output 23 [2018-11-23 11:10:03,992 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,108 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 36 treesize of output 37 [2018-11-23 11:10:04,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 11:10:04,124 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,145 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,167 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,248 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 37 treesize of output 38 [2018-11-23 11:10:04,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:10:04,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:10:04,281 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,293 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,315 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,360 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:175, output treesize:38 [2018-11-23 11:10:06,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:06,413 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_34|, |main_#t~malloc2.base|, |main_#t~malloc2.offset|, |v_#memory_int_37|, main_~x~0.offset, |v_#valid_20|, |v_#memory_int_36|, |v_#memory_int_39|]. (let ((.cse3 (bvadd |main_#t~malloc2.offset| (_ bv4 32))) (.cse0 (select |v_#memory_int_39| main_~head~0.base))) (and (= |#valid| (store |v_#valid_20| |main_#t~malloc2.base| (_ bv1 1))) (= |v_#memory_int_36| (store |v_#memory_int_39| main_~head~0.base (store .cse0 main_~head~0.offset (select (select |v_#memory_int_36| main_~head~0.base) main_~head~0.offset)))) (= (bvadd (select |v_#valid_20| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (select |v_#valid_20| |main_#t~malloc2.base|)) (= |#memory_int| (let ((.cse1 (select (select (let ((.cse2 (store |v_#memory_$Pointer$.base_34| main_~head~0.base (store (select |v_#memory_$Pointer$.base_34| main_~head~0.base) main_~head~0.offset |main_#t~malloc2.base|)))) (store .cse2 |main_#t~malloc2.base| (store (select .cse2 |main_#t~malloc2.base|) .cse3 main_~head~0.base))) main_~head~0.base) main_~head~0.offset))) (store |v_#memory_int_37| .cse1 (store (store (select |v_#memory_int_37| .cse1) (bvadd main_~x~0.offset (_ bv8 32)) (_ bv0 32)) main_~x~0.offset (select (select |#memory_int| .cse1) main_~x~0.offset))))) (= |v_#memory_int_37| (store |v_#memory_int_36| |main_#t~malloc2.base| (store (select |v_#memory_int_36| |main_#t~malloc2.base|) .cse3 (select (select |v_#memory_int_37| |main_#t~malloc2.base|) .cse3)))) (= (select .cse0 (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:10:06,414 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, main_~x~0.offset]. (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (= (_ bv0 1) (bvadd (select |#valid| main_~head~0.base) (_ bv1 1))) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:06,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:10:06,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 11:10:07,070 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 11 treesize of output 14 [2018-11-23 11:10:07,088 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 14 treesize of output 15 [2018-11-23 11:10:07,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 11:10:07,483 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 11:10:07,505 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 14 treesize of output 15 [2018-11-23 11:10:07,513 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,546 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,581 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:07,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 68 [2018-11-23 11:10:07,834 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 36 treesize of output 35 [2018-11-23 11:10:07,870 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 35 treesize of output 20 [2018-11-23 11:10:07,889 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,910 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:07,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:08,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:08,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:08,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 85 [2018-11-23 11:10:08,215 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 43 [2018-11-23 11:10:08,247 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:08,295 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:08,364 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:100, output treesize:64 [2018-11-23 11:10:08,556 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:08,557 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_33|, v_main_~head~0.base_9, |v_#memory_int_38|, |v_#memory_int_40|, |main_#t~malloc2.base|, main_~x~0.offset, |v_#valid_21|, |v_#memory_$Pointer$.offset_33|]. (let ((.cse0 (select |v_#memory_int_38| main_~head~0.base))) (and (= (store |v_#memory_int_38| main_~head~0.base (store .cse0 (_ bv4 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32)))) |#memory_int|) (= (store |v_#memory_int_40| main_~head~0.base (store (store (select |v_#memory_int_40| main_~head~0.base) (_ bv8 32) (_ bv1 32)) (_ bv0 32) (select .cse0 (_ bv0 32)))) |v_#memory_int_38|) (= (_ bv0 32) (select (select |v_#memory_int_40| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32)))) (= (select |v_#valid_21| v_main_~head~0.base_9) (_ bv1 1)) (= (_ bv0 32) (select (select |v_#memory_int_40| v_main_~head~0.base_9) (_ bv8 32))) (= (_ bv0 1) (select |v_#valid_21| main_~head~0.base)) (= (_ bv1 1) (select |v_#valid_21| |main_#t~malloc2.base|)) (= (store |v_#memory_$Pointer$.offset_33| main_~head~0.base (store (store (select |v_#memory_$Pointer$.offset_33| main_~head~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (not (= |main_#t~malloc2.base| v_main_~head~0.base_9)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_33| main_~head~0.base (store (store (select |v_#memory_$Pointer$.base_33| main_~head~0.base) (_ bv0 32) v_main_~head~0.base_9) (_ bv4 32) (_ bv0 32)))) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:10:08,557 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, main_~x~0.offset]. (let ((.cse2 (select |#memory_$Pointer$.base| main_~head~0.base))) (let ((.cse1 (select |#memory_$Pointer$.offset| main_~head~0.base)) (.cse0 (select .cse2 (_ bv0 32)))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| .cse0) (_ bv8 32))) (= (_ bv0 32) (select .cse1 (_ bv0 32))) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (_ bv0 32) (select .cse2 (_ bv4 32))) (not (= |main_#t~malloc2.base| .cse0)) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv8 32))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)))) [2018-11-23 11:10:08,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:10:08,954 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 16 treesize of output 3 [2018-11-23 11:10:08,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 11:10:09,073 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 26 treesize of output 12 [2018-11-23 11:10:09,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:09,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:35 [2018-11-23 11:10:09,141 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:09,141 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_#t~malloc2.base|, v_prenex_1, v_main_~x~0.base_27, |#memory_$Pointer$.offset|, |#memory_$Pointer$.base|]. (let ((.cse1 (select |#memory_$Pointer$.base| v_main_~x~0.base_27)) (.cse3 (select |#memory_$Pointer$.offset| v_main_~x~0.base_27))) (let ((.cse0 (select .cse3 (_ bv0 32))) (.cse2 (select .cse1 (_ bv0 32)))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_27)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_int| v_main_~x~0.base_27) (_ bv8 32)) (_ bv1 32)) (= (_ bv0 32) .cse0) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (select (select |#memory_int| .cse2) (_ bv8 32)) (_ bv0 32)) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| .cse2)) (= main_~x~0.offset .cse0) (= .cse2 main_~x~0.base)))) [2018-11-23 11:10:09,142 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, v_prenex_1, v_main_~x~0.base_27]. (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_27)) (= (select (select |#memory_int| v_main_~x~0.base_27) (_ bv8 32)) (_ bv1 32)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (not (= |main_#t~malloc2.base| main_~x~0.base))) [2018-11-23 11:10:09,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:09,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:09,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-23 11:10:09,390 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:10:09,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:09,436 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:10:09,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,454 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:10:09,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:09,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-11-23 11:10:09,489 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:09,490 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_#t~malloc2.base|, v_prenex_1, v_main_~x~0.base_27, main_~x~0.base]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv8 32)))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_27)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) .cse0) (= |main_#t~mem16| .cse0) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_27) (_ bv8 32)) (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:10:09,490 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem16| (_ bv0 32)) [2018-11-23 11:10:09,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-23 11:10:09,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {475#true} is VALID [2018-11-23 11:10:09,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-23 11:10:09,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #115#return; {475#true} is VALID [2018-11-23 11:10:09,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret19 := main(); {475#true} is VALID [2018-11-23 11:10:09,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {475#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {495#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:09,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {495#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {499#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)))) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:09,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {499#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)))) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {499#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)))) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:09,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {499#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)))) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {506#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv4 32))) (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~head~0.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv8 32))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:09,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {506#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv4 32))) (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~head~0.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv8 32))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {510#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))) (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))))} is VALID [2018-11-23 11:10:09,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {510#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))) (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))))} call #t~mem13 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {510#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))) (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))))} is VALID [2018-11-23 11:10:09,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {510#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))) (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))))} assume !(1bv32 != #t~mem13);havoc #t~mem13; {510#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))) (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))))} is VALID [2018-11-23 11:10:09,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {510#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv8 32))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32))) (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {520#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (exists ((v_main_~x~0.base_27 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_27)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_27) (_ bv8 32)) (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:10:09,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {520#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv8 32))) (exists ((v_main_~x~0.base_27 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_27)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv8 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_27) (_ bv8 32)) (_ bv4294967295 32)) (_ bv0 32)))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem16 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {524#(= |main_#t~mem16| (_ bv0 32))} is VALID [2018-11-23 11:10:09,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {524#(= |main_#t~mem16| (_ bv0 32))} assume 1bv32 == #t~mem16;havoc #t~mem16; {476#false} is VALID [2018-11-23 11:10:09,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-23 11:10:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:09,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:11,186 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 30 treesize of output 28 [2018-11-23 11:10:11,195 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 28 treesize of output 32 [2018-11-23 11:10:11,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:10:11,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:11,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:11,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:11,358 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 22 treesize of output 20 [2018-11-23 11:10:11,367 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 20 treesize of output 24 [2018-11-23 11:10:11,393 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 19 treesize of output 10 [2018-11-23 11:10:11,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:11,409 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:11,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:11,504 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:11,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:11,902 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:11,903 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:10:11,907 INFO L168 Benchmark]: Toolchain (without parser) took 23930.27 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 856.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -897.6 MB). Peak memory consumption was 595.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:11,908 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:11,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.45 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:11,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.88 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:11,910 INFO L168 Benchmark]: Boogie Preprocessor took 66.85 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:11,910 INFO L168 Benchmark]: RCFGBuilder took 1306.95 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:11,911 INFO L168 Benchmark]: TraceAbstraction took 21675.49 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 135.3 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -166.0 MB). Peak memory consumption was 605.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:11,921 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.45 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.88 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.85 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1306.95 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21675.49 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 135.3 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -166.0 MB). Peak memory consumption was 605.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...