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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test18_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:50:44,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:50:44,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:50:44,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:50:44,794 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:50:44,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:50:44,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:50:44,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:50:44,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:50:44,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:50:44,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:50:44,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:50:44,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:50:44,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:50:44,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:50:44,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:50:44,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:50:44,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:50:44,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:50:44,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:50:44,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:50:44,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:50:44,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:50:44,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:50:44,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:50:44,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:50:44,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:50:44,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:50:44,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:50:44,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:50:44,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:50:44,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:50:44,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:50:44,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:50:44,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:50:44,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:50:44,829 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-18 21:50:44,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:50:44,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:50:44,846 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:50:44,846 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:50:44,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:50:44,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:50:44,847 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:50:44,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:50:44,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:50:44,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:50:44,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:50:44,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:50:44,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:50:44,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:50:44,849 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:50:44,849 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:50:44,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:50:44,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:50:44,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:50:44,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:50:44,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:50:44,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:50:44,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:50:44,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:50:44,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:50:44,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:50:44,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:50:44,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:50:44,852 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:50:44,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:50:44,853 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:50:44,853 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:50:44,853 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:50:44,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:50:44,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:50:44,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:50:44,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:50:44,917 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:50:44,918 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test18_true-unreach-call_true-termination.c [2018-11-18 21:50:44,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622c756a1/5f0948e056534275a5bc547e7f610740/FLAGd3ac3e8b6 [2018-11-18 21:50:45,462 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:50:45,463 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test18_true-unreach-call_true-termination.c [2018-11-18 21:50:45,469 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622c756a1/5f0948e056534275a5bc547e7f610740/FLAGd3ac3e8b6 [2018-11-18 21:50:45,812 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622c756a1/5f0948e056534275a5bc547e7f610740 [2018-11-18 21:50:45,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:50:45,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:50:45,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:45,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:50:45,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:50:45,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:45" (1/1) ... [2018-11-18 21:50:45,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b820903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:45, skipping insertion in model container [2018-11-18 21:50:45,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:45" (1/1) ... [2018-11-18 21:50:45,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:50:45,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:50:46,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:46,104 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:50:46,127 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:46,154 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:50:46,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46 WrapperNode [2018-11-18 21:50:46,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:46,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:50:46,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:50:46,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:50:46,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (1/1) ... [2018-11-18 21:50:46,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:50:46,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:50:46,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:50:46,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:50:46,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (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-18 21:50:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:50:46,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:50:46,338 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-18 21:50:46,338 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 21:50:46,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:50:46,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:50:46,338 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-18 21:50:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:50:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:50:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 21:50:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:50:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:50:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:50:46,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:50:46,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:50:46,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:50:46,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:50:46,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:50:46,865 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:50:46,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:46 BoogieIcfgContainer [2018-11-18 21:50:46,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:50:46,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:50:46,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:50:46,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:50:46,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:50:45" (1/3) ... [2018-11-18 21:50:46,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd110f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:46, skipping insertion in model container [2018-11-18 21:50:46,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:46" (2/3) ... [2018-11-18 21:50:46,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd110f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:46, skipping insertion in model container [2018-11-18 21:50:46,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:46" (3/3) ... [2018-11-18 21:50:46,875 INFO L112 eAbstractionObserver]: Analyzing ICFG test18_true-unreach-call_true-termination.c [2018-11-18 21:50:46,886 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:50:46,896 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:50:46,911 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:50:46,945 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:50:46,946 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:50:46,946 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:50:46,946 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:50:46,946 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:50:46,947 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:50:46,947 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:50:46,947 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:50:46,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:50:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 21:50:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:50:46,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:46,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:46,978 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:46,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1791314138, now seen corresponding path program 1 times [2018-11-18 21:50:46,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:46,992 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-18 21:50:47,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:47,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:47,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:50:47,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:50:47,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:47,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 21:50:47,909 INFO L477 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 20 treesize of output 19 [2018-11-18 21:50:47,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:48,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-18 21:50:48,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:48,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:50:48,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:50:48,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:50:48,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:50:48,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:48,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 21:50:48,836 INFO L477 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 20 treesize of output 19 [2018-11-18 21:50:48,871 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:49,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-18 21:50:49,027 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:49,231 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:50:49,314 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:50:49,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 21:50:49,492 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:61, output treesize:94 [2018-11-18 21:50:51,510 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:50:51,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-18 21:50:51,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-18 21:50:51,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:51,978 INFO L477 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 20 treesize of output 19 [2018-11-18 21:50:51,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-18 21:50:52,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-18 21:50:52,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,270 INFO L477 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 20 treesize of output 19 [2018-11-18 21:50:52,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,359 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-18 21:50:52,359 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-11-18 21:50:52,606 INFO L477 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 23 treesize of output 16 [2018-11-18 21:50:52,635 INFO L477 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 15 [2018-11-18 21:50:52,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-18 21:50:52,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-18 21:50:52,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,792 INFO L477 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 11 [2018-11-18 21:50:52,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-11-18 21:50:52,866 INFO L477 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 26 treesize of output 19 [2018-11-18 21:50:52,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,904 INFO L477 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 12 [2018-11-18 21:50:52,907 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 21:50:52,938 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,956 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:52,961 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:60, output treesize:7 [2018-11-18 21:50:52,973 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:50:53,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 21:50:53,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 21:50:53,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:53,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:53,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:53,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 21:50:53,207 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:50:53,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-18 21:50:53,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-18 21:50:53,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-18 21:50:53,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #27#return; {26#true} is VALID [2018-11-18 21:50:53,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2018-11-18 21:50:53,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32); {46#(= |main_~#b~0.offset| (_ bv0 32))} is VALID [2018-11-18 21:50:53,246 INFO L256 TraceCheckUtils]: 6: Hoare triple {46#(= |main_~#b~0.offset| (_ bv0 32))} call f(~#a~0.base, ~#a~0.offset, ~#b~0.base, ~#b~0.offset); {26#true} is VALID [2018-11-18 21:50:53,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#true} call ~#pa.base, ~#pa.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#in~pa.base, #in~pa.offset, ~#pa.base, ~#pa.offset, 4bv32);call ~#pb.base, ~#pb.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#in~pb.base, #in~pb.offset, ~#pb.base, ~#pb.offset, 4bv32); {53#(and (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) |f_~#pb.offset|) |f_#in~pb.base|) (= (_ bv0 32) |f_~#pb.offset|) (= (_ bv0 32) |f_~#pa.offset|) (= |f_#in~pb.offset| (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) |f_~#pb.offset|)))} is VALID [2018-11-18 21:50:53,251 INFO L256 TraceCheckUtils]: 8: Hoare triple {53#(and (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) |f_~#pb.offset|) |f_#in~pb.base|) (= (_ bv0 32) |f_~#pb.offset|) (= (_ bv0 32) |f_~#pa.offset|) (= |f_#in~pb.offset| (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) |f_~#pb.offset|)))} call g(~#pa.base, ~#pa.offset, ~#pb.base, ~#pb.offset); {57#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 21:50:53,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {57#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~ppa.base, ~ppa.offset := #in~ppa.base, #in~ppa.offset;~ppb.base, ~ppb.offset := #in~ppb.base, #in~ppb.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~ppb.base, ~ppb.offset, 4bv32);call write~$Pointer$(#t~mem0.base, #t~mem0.offset, ~ppa.base, ~ppa.offset, 4bv32);havoc #t~mem0.base, #t~mem0.offset; {61#(and (= (store |old(#memory_$Pointer$.base)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.offset)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.offset)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.offset|))} is VALID [2018-11-18 21:50:53,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#(and (= (store |old(#memory_$Pointer$.base)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.offset)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.offset)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.offset|))} assume true; {61#(and (= (store |old(#memory_$Pointer$.base)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.offset)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.offset)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.offset|))} is VALID [2018-11-18 21:50:53,259 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {61#(and (= (store |old(#memory_$Pointer$.base)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |g_#in~ppa.base| (store (select |old(#memory_$Pointer$.offset)| |g_#in~ppa.base|) |g_#in~ppa.offset| (select (select |old(#memory_$Pointer$.offset)| |g_#in~ppb.base|) |g_#in~ppb.offset|))) |#memory_$Pointer$.offset|))} {53#(and (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) |f_~#pb.offset|) |f_#in~pb.base|) (= (_ bv0 32) |f_~#pb.offset|) (= (_ bv0 32) |f_~#pa.offset|) (= |f_#in~pb.offset| (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) |f_~#pb.offset|)))} #23#return; {68#(and (exists ((|f_~#pb.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) (_ bv0 32)) |f_#in~pb.base|) (= (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |f_~#pa.base|) |f_~#pa.offset|)) (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |f_~#pa.base|) |f_~#pa.offset|)) (= (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) (_ bv0 32)) |f_#in~pb.offset|))) (= (_ bv0 32) |f_~#pa.offset|))} is VALID [2018-11-18 21:50:53,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {68#(and (exists ((|f_~#pb.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) (_ bv0 32)) |f_#in~pb.base|) (= (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |f_~#pa.base|) |f_~#pa.offset|)) (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |f_~#pa.base|) |f_~#pa.offset|)) (= (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) (_ bv0 32)) |f_#in~pb.offset|))) (= (_ bv0 32) |f_~#pa.offset|))} call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~#pa.base, ~#pa.offset, 4bv32);call write~intINTTYPE4(0bv32, #t~mem1.base, #t~mem1.offset, 4bv32);havoc #t~mem1.base, #t~mem1.offset;call ULTIMATE.dealloc(~#pa.base, ~#pa.offset);havoc ~#pa.base, ~#pa.offset;call ULTIMATE.dealloc(~#pb.base, ~#pb.offset);havoc ~#pb.base, ~#pb.offset; {72#(= (select (select |#memory_int| |f_#in~pb.base|) |f_#in~pb.offset|) (_ bv0 32))} is VALID [2018-11-18 21:50:53,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {72#(= (select (select |#memory_int| |f_#in~pb.base|) |f_#in~pb.offset|) (_ bv0 32))} assume true; {72#(= (select (select |#memory_int| |f_#in~pb.base|) |f_#in~pb.offset|) (_ bv0 32))} is VALID [2018-11-18 21:50:53,265 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {72#(= (select (select |#memory_int| |f_#in~pb.base|) |f_#in~pb.offset|) (_ bv0 32))} {46#(= |main_~#b~0.offset| (_ bv0 32))} #25#return; {79#(and (= |main_~#b~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (_ bv0 32)))} is VALID [2018-11-18 21:50:53,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {79#(and (= |main_~#b~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (_ bv0 32)))} call #t~mem2 := read~intINTTYPE4(~#b~0.base, ~#b~0.offset, 4bv32); {83#(= (_ bv0 32) |main_#t~mem2|)} is VALID [2018-11-18 21:50:53,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {83#(= (_ bv0 32) |main_#t~mem2|)} assume 0bv32 != #t~mem2;havoc #t~mem2; {27#false} is VALID [2018-11-18 21:50:53,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-18 21:50:53,274 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-18 21:50:53,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:53,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:53,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 21:50:53,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-18 21:50:53,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:53,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 21:50:53,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:53,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 21:50:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 21:50:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-18 21:50:53,386 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 10 states. [2018-11-18 21:50:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:54,677 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-18 21:50:54,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 21:50:54,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-18 21:50:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 21:50:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-11-18 21:50:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 21:50:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-11-18 21:50:54,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2018-11-18 21:50:54,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:54,791 INFO L225 Difference]: With dead ends: 27 [2018-11-18 21:50:54,791 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 21:50:54,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-18 21:50:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 21:50:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 21:50:54,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:54,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:54,818 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:54,818 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:54,819 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:54,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:54,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:54,819 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:54,820 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:54,820 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:54,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:54,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:54,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:54,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 21:50:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 21:50:54,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-18 21:50:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:54,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 21:50:54,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 21:50:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:54,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:54,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 21:50:55,102 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:55,102 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:55,103 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:55,103 INFO L421 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |f_~#pb.base|) |f_~#pb.offset|) |f_#in~pb.base|) (= (_ bv0 32) |f_~#pb.offset|) (= (_ bv0 32) |f_~#pa.offset|) (= |f_#in~pb.offset| (select (select |#memory_$Pointer$.offset| |f_~#pb.base|) |f_~#pb.offset|))) [2018-11-18 21:50:55,103 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-18 21:50:55,103 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 8 11) no Hoare annotation was computed. [2018-11-18 21:50:55,103 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 8 11) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 21:50:55,103 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 8 11) no Hoare annotation was computed. [2018-11-18 21:50:55,104 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 4 6) no Hoare annotation was computed. [2018-11-18 21:50:55,104 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 4 6) no Hoare annotation was computed. [2018-11-18 21:50:55,104 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 4 6) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 21:50:55,104 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:55,104 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 21:50:55,104 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:55,104 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:55,105 INFO L421 ceAbstractionStarter]: At program point L17(lines 13 24) the Hoare annotation is: false [2018-11-18 21:50:55,105 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-11-18 21:50:55,105 INFO L421 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: (and (= |main_~#b~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 21:50:55,105 INFO L425 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-11-18 21:50:55,105 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 22) no Hoare annotation was computed. [2018-11-18 21:50:55,106 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 13 24) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 21:50:55,106 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 24) no Hoare annotation was computed. [2018-11-18 21:50:55,106 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 24) no Hoare annotation was computed. [2018-11-18 21:50:55,109 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:55,114 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-18 21:50:55,116 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:55,116 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:55,117 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-18 21:50:55,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:55,119 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 21:50:55,121 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 21:50:55,121 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:55,121 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2018-11-18 21:50:55,121 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:55,122 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 21:50:55,122 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-18 21:50:55,122 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-18 21:50:55,122 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-18 21:50:55,122 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-18 21:50:55,123 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 21:50:55,123 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:55,123 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:55,123 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 21:50:55,124 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 21:50:55,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:50:55 BoogieIcfgContainer [2018-11-18 21:50:55,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 21:50:55,132 INFO L168 Benchmark]: Toolchain (without parser) took 9307.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -462.1 MB). Peak memory consumption was 266.1 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:55,134 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:55,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:55,135 INFO L168 Benchmark]: Boogie Preprocessor took 53.68 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-18 21:50:55,135 INFO L168 Benchmark]: RCFGBuilder took 656.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.4 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:55,136 INFO L168 Benchmark]: TraceAbstraction took 8262.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 287.7 MB). Peak memory consumption was 287.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:55,140 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 656.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.4 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8262.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 287.7 MB). Peak memory consumption was 287.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 5 SDslu, 56 SDs, 0 SdLazy, 74 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 56 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 1 QuantifiedInterpolants, 2890 SizeOfPredicates, 14 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...