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_Default-Const.epf -i ../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:10:48,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:10:48,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:10:48,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:10:48,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:10:48,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:10:48,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:10:48,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:10:48,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:10:48,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:10:48,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:10:48,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:10:48,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:10:48,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:10:48,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:10:48,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:10:48,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:10:48,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:10:48,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:10:48,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:10:48,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:10:48,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:10:48,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:10:48,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:10:48,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:10:48,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:10:48,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:10:48,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:10:48,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:10:48,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:10:48,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:10:48,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:10:48,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:10:48,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:10:48,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:10:48,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:10:48,917 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:10:48,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:10:48,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:10:48,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:10:48,949 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:10:48,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:10:48,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:10:48,950 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:10:48,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:10:48,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:10:48,952 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:10:48,952 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:10:48,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:10:48,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:10:48,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:10:48,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:10:48,953 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:10:48,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:10:48,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:10:48,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:10:48,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:10:48,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:10:48,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:10:48,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:10:48,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:10:48,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:10:48,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:10:48,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:10:48,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:10:48,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:10:48,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:10:48,957 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:10:49,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:10:49,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:10:49,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:10:49,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:10:49,042 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:10:49,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-14 19:10:49,103 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7218351/52bd53f33693428d8b6f73bbaf93f94b/FLAG3dc8b8021 [2018-11-14 19:10:49,629 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:10:49,630 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-14 19:10:49,639 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7218351/52bd53f33693428d8b6f73bbaf93f94b/FLAG3dc8b8021 [2018-11-14 19:10:49,660 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7218351/52bd53f33693428d8b6f73bbaf93f94b [2018-11-14 19:10:49,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:10:49,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:10:49,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:10:49,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:10:49,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:10:49,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:49,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a969f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49, skipping insertion in model container [2018-11-14 19:10:49,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:49,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:10:49,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:10:49,937 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:10:49,952 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:10:49,975 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:10:49,996 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:10:49,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49 WrapperNode [2018-11-14 19:10:49,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:10:49,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:10:49,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:10:49,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:10:50,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (1/1) ... [2018-11-14 19:10:50,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:10:50,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:10:50,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:10:50,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:10:50,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (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-14 19:10:50,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:10:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:10:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-14 19:10:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-14 19:10:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:10:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:10:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:10:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:10:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:10:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:10:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:10:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:10:50,904 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:10:50,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:10:50 BoogieIcfgContainer [2018-11-14 19:10:50,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:10:50,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:10:50,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:10:50,910 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:10:50,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:10:49" (1/3) ... [2018-11-14 19:10:50,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7307f2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:10:50, skipping insertion in model container [2018-11-14 19:10:50,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:49" (2/3) ... [2018-11-14 19:10:50,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7307f2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:10:50, skipping insertion in model container [2018-11-14 19:10:50,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:10:50" (3/3) ... [2018-11-14 19:10:50,914 INFO L112 eAbstractionObserver]: Analyzing ICFG test05_true-unreach-call_true-termination.c [2018-11-14 19:10:50,925 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:10:50,934 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:10:50,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:10:50,982 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:10:50,983 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:10:50,983 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:10:50,984 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:10:50,984 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:10:50,984 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:10:50,984 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:10:50,985 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:10:50,985 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:10:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-14 19:10:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:10:51,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:51,013 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:51,016 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:51,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1134425000, now seen corresponding path program 1 times [2018-11-14 19:10:51,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:51,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:51,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-14 19:10:51,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-14 19:10:51,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-14 19:10:51,453 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #36#return; {28#true} is VALID [2018-11-14 19:10:51,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2018-11-14 19:10:51,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {30#(= 4 |main_#t~mem4|)} is VALID [2018-11-14 19:10:51,466 INFO L256 TraceCheckUtils]: 6: Hoare triple {30#(= 4 |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {28#true} is VALID [2018-11-14 19:10:51,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {31#(= f_~a |f_#in~a|)} is VALID [2018-11-14 19:10:51,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#(= f_~a |f_#in~a|)} assume !(~a == 4);#res := 0; {32#(not (= 4 |f_#in~a|))} is VALID [2018-11-14 19:10:51,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#(not (= 4 |f_#in~a|))} assume true; {32#(not (= 4 |f_#in~a|))} is VALID [2018-11-14 19:10:51,498 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {32#(not (= 4 |f_#in~a|))} {30#(= 4 |main_#t~mem4|)} #34#return; {29#false} is VALID [2018-11-14 19:10:51,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {29#false} is VALID [2018-11-14 19:10:51,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume #t~mem6 != 1;havoc #t~mem6; {29#false} is VALID [2018-11-14 19:10:51,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-14 19:10:51,503 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-14 19:10:51,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:51,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:10:51,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 19:10:51,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:51,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:10:51,578 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-14 19:10:51,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:10:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:10:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:10:51,590 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2018-11-14 19:10:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:52,315 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-14 19:10:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:10:52,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 19:10:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:10:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-14 19:10:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:10:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-14 19:10:52,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-14 19:10:52,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:52,461 INFO L225 Difference]: With dead ends: 36 [2018-11-14 19:10:52,461 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 19:10:52,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:10:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 19:10:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 19:10:52,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:52,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:52,582 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:52,583 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:52,588 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:10:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:10:52,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:52,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:52,590 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:52,590 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:52,595 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:10:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:10:52,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:52,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:52,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:52,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:10:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 19:10:52,609 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-14 19:10:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:52,610 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 19:10:52,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:10:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:10:52,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:10:52,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:52,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:52,611 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:52,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash 131243218, now seen corresponding path program 1 times [2018-11-14 19:10:52,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:52,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:52,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:52,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:52,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:52,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2018-11-14 19:10:52,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {155#true} is VALID [2018-11-14 19:10:52,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {155#true} assume true; {155#true} is VALID [2018-11-14 19:10:52,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} #36#return; {155#true} is VALID [2018-11-14 19:10:52,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {155#true} call #t~ret9 := main(); {155#true} is VALID [2018-11-14 19:10:52,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {155#true} is VALID [2018-11-14 19:10:52,897 INFO L256 TraceCheckUtils]: 6: Hoare triple {155#true} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {155#true} is VALID [2018-11-14 19:10:52,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {155#true} is VALID [2018-11-14 19:10:52,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#true} assume ~a == 4; {155#true} is VALID [2018-11-14 19:10:52,898 INFO L256 TraceCheckUtils]: 9: Hoare triple {155#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {155#true} is VALID [2018-11-14 19:10:52,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {155#true} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {155#true} is VALID [2018-11-14 19:10:52,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {155#true} assume true; {155#true} is VALID [2018-11-14 19:10:52,899 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {155#true} {155#true} #32#return; {155#true} is VALID [2018-11-14 19:10:52,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {155#true} #res := 1; {157#(= 1 |f_#res|)} is VALID [2018-11-14 19:10:52,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {157#(= 1 |f_#res|)} assume true; {157#(= 1 |f_#res|)} is VALID [2018-11-14 19:10:52,924 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {157#(= 1 |f_#res|)} {155#true} #34#return; {158#(= 1 |main_#t~ret5|)} is VALID [2018-11-14 19:10:52,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {158#(= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {159#(= |main_#t~mem6| 1)} is VALID [2018-11-14 19:10:52,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {159#(= |main_#t~mem6| 1)} assume #t~mem6 != 1;havoc #t~mem6; {156#false} is VALID [2018-11-14 19:10:52,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {156#false} assume !false; {156#false} is VALID [2018-11-14 19:10:52,928 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-14 19:10:52,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:52,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:10:52,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:10:52,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:52,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:10:53,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:53,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:10:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:10:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:10:53,024 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2018-11-14 19:10:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:53,223 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-11-14 19:10:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:10:53,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:10:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:10:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-14 19:10:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:10:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-14 19:10:53,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2018-11-14 19:10:53,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:53,276 INFO L225 Difference]: With dead ends: 23 [2018-11-14 19:10:53,276 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 19:10:53,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:10:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 19:10:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 19:10:53,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:53,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:53,292 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:53,292 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:53,295 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-14 19:10:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-14 19:10:53,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:53,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:53,296 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:53,296 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:10:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:53,299 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-14 19:10:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-14 19:10:53,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:53,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:53,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:53,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:10:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2018-11-14 19:10:53,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 19 [2018-11-14 19:10:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:53,307 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2018-11-14 19:10:53,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:10:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-14 19:10:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:10:53,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:53,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:53,308 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:53,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash -226425686, now seen corresponding path program 1 times [2018-11-14 19:10:53,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:53,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {267#true} call ULTIMATE.init(); {267#true} is VALID [2018-11-14 19:10:53,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {267#true} is VALID [2018-11-14 19:10:53,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {267#true} assume true; {267#true} is VALID [2018-11-14 19:10:53,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {267#true} {267#true} #36#return; {267#true} is VALID [2018-11-14 19:10:53,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {267#true} call #t~ret9 := main(); {267#true} is VALID [2018-11-14 19:10:53,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {269#(not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|))} is VALID [2018-11-14 19:10:53,718 INFO L256 TraceCheckUtils]: 6: Hoare triple {269#(not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|))} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2018-11-14 19:10:53,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2018-11-14 19:10:53,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} assume ~a == 4; {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2018-11-14 19:10:53,732 INFO L256 TraceCheckUtils]: 9: Hoare triple {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2018-11-14 19:10:53,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {272#(and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|))))} is VALID [2018-11-14 19:10:53,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {272#(and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|))))} assume true; {272#(and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|))))} is VALID [2018-11-14 19:10:53,736 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {272#(and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|))))} {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {273#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2018-11-14 19:10:53,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {273#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} #res := 1; {273#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2018-11-14 19:10:53,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} assume true; {273#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2018-11-14 19:10:53,741 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {273#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} {269#(not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|))} #34#return; {274#(= 0 (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} is VALID [2018-11-14 19:10:53,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {274#(= 0 (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {275#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} is VALID [2018-11-14 19:10:53,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {275#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} assume !(#t~mem6 != 1);havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {276#(= |main_#t~mem8| 0)} is VALID [2018-11-14 19:10:53,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {276#(= |main_#t~mem8| 0)} assume #t~mem8 != 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset; {268#false} is VALID [2018-11-14 19:10:53,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {268#false} assume !false; {268#false} is VALID [2018-11-14 19:10:53,753 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-14 19:10:53,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:53,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 19:10:53,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 19:10:53,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:53,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:10:53,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:53,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:10:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:10:53,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:10:53,807 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 10 states. [2018-11-14 19:10:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:54,349 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-14 19:10:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:10:54,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 19:10:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:10:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-11-14 19:10:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:10:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-11-14 19:10:54,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2018-11-14 19:10:54,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:54,422 INFO L225 Difference]: With dead ends: 21 [2018-11-14 19:10:54,422 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:10:54,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:10:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:10:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:10:54,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:54,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:54,424 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:54,424 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:54,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:10:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:10:54,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:54,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:54,425 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:54,425 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:54,426 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:10:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:10:54,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:54,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:54,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:54,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:10:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:10:54,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-14 19:10:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:54,427 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:10:54,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:10:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:10:54,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:54,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:10:54,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:10:54,568 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:10:54,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:10:54,569 INFO L421 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (= f_~a |f_#in~a|) (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|)) [2018-11-14 19:10:54,569 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 17) no Hoare annotation was computed. [2018-11-14 19:10:54,569 INFO L425 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-14 19:10:54,569 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-14 19:10:54,569 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 11 18) the Hoare annotation is: (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) [2018-11-14 19:10:54,569 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-14 19:10:54,570 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-14 19:10:54,570 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 4 9) no Hoare annotation was computed. [2018-11-14 19:10:54,570 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 4 9) the Hoare annotation is: (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) [2018-11-14 19:10:54,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:10:54,570 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:10:54,570 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:10:54,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:10:54,571 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (= 4 |main_#t~mem4|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|))) [2018-11-14 19:10:54,571 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-14 19:10:54,571 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 20 46) the Hoare annotation is: (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) [2018-11-14 19:10:54,571 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2018-11-14 19:10:54,571 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-11-14 19:10:54,571 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2018-11-14 19:10:54,572 INFO L421 ceAbstractionStarter]: At program point L39(lines 20 46) the Hoare annotation is: false [2018-11-14 19:10:54,572 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-14 19:10:54,572 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-14 19:10:54,574 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:10:54,574 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 19:10:54,574 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-14 19:10:54,576 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:10:54,576 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 19:10:54,576 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 19:10:54,577 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-14 19:10:54,577 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:10:54,577 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 19:10:54,579 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:10:54,579 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:10:54,581 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-14 19:10:54,581 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2018-11-14 19:10:54,581 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:10:54,581 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 19:10:54,581 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:10:54,582 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-14 19:10:54,582 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-14 19:10:54,582 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-14 19:10:54,582 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 19:10:54,582 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:10:54,583 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 19:10:54,583 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 19:10:54,583 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:10:54,583 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:10:54,583 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:10:54,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:10:54 BoogieIcfgContainer [2018-11-14 19:10:54,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:10:54,591 INFO L168 Benchmark]: Toolchain (without parser) took 4917.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -529.2 MB). Peak memory consumption was 203.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:54,593 INFO L168 Benchmark]: CDTParser took 0.26 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-14 19:10:54,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.80 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-14 19:10:54,595 INFO L168 Benchmark]: Boogie Preprocessor took 76.81 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:54,596 INFO L168 Benchmark]: RCFGBuilder took 830.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:54,597 INFO L168 Benchmark]: TraceAbstraction took 3683.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 227.0 MB). Peak memory consumption was 227.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:54,601 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.26 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 320.80 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 76.81 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3683.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 227.0 MB). Peak memory consumption was 227.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 20]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 10 SDslu, 150 SDs, 0 SdLazy, 99 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 44 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 5099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...