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/test11_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:10:50,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:10:50,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:10:50,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:10:50,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:10:50,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:10:50,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:10:50,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:10:50,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:10:50,999 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:10:51,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:10:51,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:10:51,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:10:51,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:10:51,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:10:51,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:10:51,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:10:51,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:10:51,021 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:10:51,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:10:51,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:10:51,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:10:51,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:10:51,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:10:51,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:10:51,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:10:51,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:10:51,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:10:51,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:10:51,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:10:51,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:10:51,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:10:51,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:10:51,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:10:51,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:10:51,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:10:51,044 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:51,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:10:51,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:10:51,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:10:51,074 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:10:51,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:10:51,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:10:51,078 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:10:51,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:10:51,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:10:51,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:10:51,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:10:51,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:10:51,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:10:51,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:10:51,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:10:51,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:10:51,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:10:51,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:10:51,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:10:51,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:10:51,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:10:51,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:10:51,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:10:51,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:10:51,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:10:51,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:10:51,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:10:51,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:10:51,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:10:51,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:10:51,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:10:51,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:10:51,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:10:51,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:10:51,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:10:51,172 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:10:51,173 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c [2018-11-14 19:10:51,240 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53139a000/3c7a5893beeb4a2db7a701a8c3b5f74e/FLAGbc8297de1 [2018-11-14 19:10:51,691 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:10:51,691 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c [2018-11-14 19:10:51,701 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53139a000/3c7a5893beeb4a2db7a701a8c3b5f74e/FLAGbc8297de1 [2018-11-14 19:10:51,722 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53139a000/3c7a5893beeb4a2db7a701a8c3b5f74e [2018-11-14 19:10:51,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:10:51,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:10:51,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:10:51,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:10:51,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:10:51,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:10:51" (1/1) ... [2018-11-14 19:10:51,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243c94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:51, skipping insertion in model container [2018-11-14 19:10:51,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:10:51" (1/1) ... [2018-11-14 19:10:51,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:10:51,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:10:52,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:10:52,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:10:52,046 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:10:52,067 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:10:52,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:52 WrapperNode [2018-11-14 19:10:52,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:10:52,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:10:52,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:10:52,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:10:52,084 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:52" (1/1) ... [2018-11-14 19:10:52,084 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:52" (1/1) ... [2018-11-14 19:10:52,094 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:52" (1/1) ... [2018-11-14 19:10:52,094 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:52" (1/1) ... [2018-11-14 19:10:52,104 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:52" (1/1) ... [2018-11-14 19:10:52,108 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:52" (1/1) ... [2018-11-14 19:10:52,109 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:52" (1/1) ... [2018-11-14 19:10:52,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:10:52,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:10:52,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:10:52,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:10:52,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:52" (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:52,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:10:52,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:10:52,247 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-14 19:10:52,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:10:52,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:10:52,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:10:52,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-14 19:10:52,248 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-14 19:10:52,248 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:10:52,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:10:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:10:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:10:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:10:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:10:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:10:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:10:52,837 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:10:52,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:10:52 BoogieIcfgContainer [2018-11-14 19:10:52,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:10:52,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:10:52,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:10:52,843 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:10:52,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:10:51" (1/3) ... [2018-11-14 19:10:52,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbed7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:10:52, skipping insertion in model container [2018-11-14 19:10:52,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:52" (2/3) ... [2018-11-14 19:10:52,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbed7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:10:52, skipping insertion in model container [2018-11-14 19:10:52,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:10:52" (3/3) ... [2018-11-14 19:10:52,847 INFO L112 eAbstractionObserver]: Analyzing ICFG test11_true-unreach-call_true-termination.c [2018-11-14 19:10:52,857 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:10:52,866 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:10:52,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:10:52,917 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:10:52,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:10:52,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:10:52,918 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:10:52,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:10:52,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:10:52,919 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:10:52,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:10:52,919 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:10:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-14 19:10:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:10:52,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:52,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:52,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:52,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash -722462527, now seen corresponding path program 1 times [2018-11-14 19:10:52,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:52,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:53,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:53,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:53,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:53,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-14 19:10:53,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4); {26#true} is VALID [2018-11-14 19:10:53,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-14 19:10:53,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2018-11-14 19:10:53,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret11 := main(); {26#true} is VALID [2018-11-14 19:10:53,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~unchecked~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4);havoc #t~nondet4; {28#(not (= 0 main_~pc~0.base))} is VALID [2018-11-14 19:10:53,310 INFO L256 TraceCheckUtils]: 6: Hoare triple {28#(not (= 0 main_~pc~0.base))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {26#true} is VALID [2018-11-14 19:10:53,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#true} assume #t~nondet0 % 256 != 0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {26#true} is VALID [2018-11-14 19:10:53,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {26#true} is VALID [2018-11-14 19:10:53,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-14 19:10:53,325 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {26#true} {28#(not (= 0 main_~pc~0.base))} #47#return; {28#(not (= 0 main_~pc~0.base))} is VALID [2018-11-14 19:10:53,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {29#(not |main_#t~short9|)} is VALID [2018-11-14 19:10:53,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#(not |main_#t~short9|)} assume #t~short9; {27#false} is VALID [2018-11-14 19:10:53,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {27#false} assume #t~short9;havoc #t~short9;havoc #t~mem6;havoc #t~short8;havoc #t~mem7; {27#false} is VALID [2018-11-14 19:10:53,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-14 19:10:53,357 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,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:53,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:10:53,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:10:53,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:53,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:10:53,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:53,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:10:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:10:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:10:53,563 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2018-11-14 19:10:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:53,845 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 19:10:53,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:10:53,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:10:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:10:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-14 19:10:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:10:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-14 19:10:53,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2018-11-14 19:10:54,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:54,142 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:10:54,143 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 19:10:54,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:10:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 19:10:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 19:10:54,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:54,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:54,280 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:54,281 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:54,285 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 19:10:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 19:10:54,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:54,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:54,286 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:54,286 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:54,290 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 19:10:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 19:10:54,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:54,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:54,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:54,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:10:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-14 19:10:54,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-14 19:10:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:54,297 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-14 19:10:54,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:10:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 19:10:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:10:54,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:54,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:54,299 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:54,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1499811687, now seen corresponding path program 1 times [2018-11-14 19:10:54,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:54,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:54,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:54,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:54,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:54,725 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-11-14 19:10:54,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {137#true} call ULTIMATE.init(); {137#true} is VALID [2018-11-14 19:10:54,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {137#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4); {137#true} is VALID [2018-11-14 19:10:54,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {137#true} assume true; {137#true} is VALID [2018-11-14 19:10:54,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {137#true} {137#true} #43#return; {137#true} is VALID [2018-11-14 19:10:54,746 INFO L256 TraceCheckUtils]: 4: Hoare triple {137#true} call #t~ret11 := main(); {137#true} is VALID [2018-11-14 19:10:54,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {137#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~unchecked~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4);havoc #t~nondet4; {137#true} is VALID [2018-11-14 19:10:54,747 INFO L256 TraceCheckUtils]: 6: Hoare triple {137#true} call #t~ret5.base, #t~ret5.offset := get_dummy(); {137#true} is VALID [2018-11-14 19:10:54,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {137#true} assume #t~nondet0 % 256 != 0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {137#true} is VALID [2018-11-14 19:10:54,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {137#true} is VALID [2018-11-14 19:10:54,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {137#true} assume true; {137#true} is VALID [2018-11-14 19:10:54,748 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {137#true} {137#true} #47#return; {137#true} is VALID [2018-11-14 19:10:54,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {137#true} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {139#(and (= main_~pa~0.offset main_~pb~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2018-11-14 19:10:54,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {139#(and (= main_~pa~0.offset main_~pb~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {140#(and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select |#memory_int| main_~pa~0.base) (select |#memory_int| main_~pb~0.base)))} is VALID [2018-11-14 19:10:54,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {140#(and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select |#memory_int| main_~pa~0.base) (select |#memory_int| main_~pb~0.base)))} assume #t~short8;call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4);call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4);#t~short8 := #t~mem6 != #t~mem7; {141#(not |main_#t~short8|)} is VALID [2018-11-14 19:10:54,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {141#(not |main_#t~short8|)} #t~short9 := #t~short8; {142#(not |main_#t~short9|)} is VALID [2018-11-14 19:10:54,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {142#(not |main_#t~short9|)} assume #t~short9;havoc #t~short9;havoc #t~mem6;havoc #t~short8;havoc #t~mem7; {138#false} is VALID [2018-11-14 19:10:54,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {138#false} assume !false; {138#false} is VALID [2018-11-14 19:10:54,767 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:54,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:54,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:10:54,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:10:54,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:54,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:10:54,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:54,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:10:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:10:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:10:54,861 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2018-11-14 19:10:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:55,408 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-14 19:10:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:10:55,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:10:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:10:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-14 19:10:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:10:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-14 19:10:55,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2018-11-14 19:10:55,469 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:55,472 INFO L225 Difference]: With dead ends: 21 [2018-11-14 19:10:55,472 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 19:10:55,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:10:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 19:10:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 19:10:55,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:55,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:55,486 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:55,487 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:55,489 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:10:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:10:55,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:55,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:55,490 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:55,491 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:10:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:55,493 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:10:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:10:55,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:55,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:55,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:55,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:10:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-14 19:10:55,497 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-11-14 19:10:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:55,497 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-14 19:10:55,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:10:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:10:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:10:55,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:55,498 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-14 19:10:55,499 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:55,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash -750476091, now seen corresponding path program 1 times [2018-11-14 19:10:55,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:55,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:55,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2018-11-14 19:10:55,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4); {242#true} is VALID [2018-11-14 19:10:55,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2018-11-14 19:10:55,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #43#return; {242#true} is VALID [2018-11-14 19:10:55,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret11 := main(); {242#true} is VALID [2018-11-14 19:10:55,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~unchecked~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4);havoc #t~nondet4; {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} is VALID [2018-11-14 19:10:55,660 INFO L256 TraceCheckUtils]: 6: Hoare triple {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {242#true} is VALID [2018-11-14 19:10:55,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {242#true} assume #t~nondet0 % 256 != 0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {242#true} is VALID [2018-11-14 19:10:55,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {242#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {242#true} is VALID [2018-11-14 19:10:55,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {242#true} assume true; {242#true} is VALID [2018-11-14 19:10:55,666 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {242#true} {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} #47#return; {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} is VALID [2018-11-14 19:10:55,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} is VALID [2018-11-14 19:10:55,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} is VALID [2018-11-14 19:10:55,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} assume #t~short8;call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4);call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4);#t~short8 := #t~mem6 != #t~mem7; {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} is VALID [2018-11-14 19:10:55,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} #t~short9 := #t~short8; {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} is VALID [2018-11-14 19:10:55,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {244#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_~#c~0.base| main_~pc~0.base))} assume !#t~short9;havoc #t~short9;havoc #t~mem6;havoc #t~short8;havoc #t~mem7;call write~int(60, ~pc~0.base, ~pc~0.offset, 4);call #t~mem10 := read~int(~#c~0.base, ~#c~0.offset, 4); {245#(= 60 |main_#t~mem10|)} is VALID [2018-11-14 19:10:55,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {245#(= 60 |main_#t~mem10|)} assume #t~mem10 != 60;havoc #t~mem10; {243#false} is VALID [2018-11-14 19:10:55,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2018-11-14 19:10:55,676 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:55,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:55,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:10:55,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:10:55,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:55,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:10:55,709 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-14 19:10:55,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:10:55,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:10:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:10:55,710 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-11-14 19:10:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:55,809 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:10:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:10:55,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:10:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:10:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-14 19:10:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:10:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-14 19:10:55,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2018-11-14 19:10:55,848 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:55,849 INFO L225 Difference]: With dead ends: 19 [2018-11-14 19:10:55,849 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:10:55,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:10:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:10:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:10:55,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:55,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:55,851 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:55,851 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:55,852 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:10:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:10:55,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:55,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:55,852 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:55,852 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:10:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:55,853 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:10:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:10:55,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:55,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:55,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:55,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:10:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:10:55,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-14 19:10:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:55,855 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:10:55,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:10:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:10:55,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:55,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:10:55,944 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:10:55,944 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:10:55,944 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:10:55,944 INFO L425 ceAbstractionStarter]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2018-11-14 19:10:55,944 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-14 19:10:55,945 INFO L428 ceAbstractionStarter]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2018-11-14 19:10:55,945 INFO L425 ceAbstractionStarter]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2018-11-14 19:10:55,945 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:10:55,945 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:10:55,945 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:10:55,945 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:10:55,945 INFO L421 ceAbstractionStarter]: At program point L25(lines 12 32) the Hoare annotation is: false [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L421 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (not (= 0 main_~pc~0.base)) (= |main_~#c~0.base| main_~pc~0.base)) [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-14 19:10:55,946 INFO L425 ceAbstractionStarter]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2018-11-14 19:10:55,947 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2018-11-14 19:10:55,948 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:10:55,948 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-14 19:10:55,949 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-14 19:10:55,950 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 19:10:55,951 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:10:55,952 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 19:10:55,952 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 19:10:55,952 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-14 19:10:55,952 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:10:55,952 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:10:55,952 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:10:55,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:10:55 BoogieIcfgContainer [2018-11-14 19:10:55,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:10:55,962 INFO L168 Benchmark]: Toolchain (without parser) took 4224.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -627.4 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:55,963 INFO L168 Benchmark]: CDTParser took 0.21 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:55,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.72 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:55,965 INFO L168 Benchmark]: Boogie Preprocessor took 43.70 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-14 19:10:55,965 INFO L168 Benchmark]: RCFGBuilder took 726.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:55,966 INFO L168 Benchmark]: TraceAbstraction took 3121.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.9 MB). Peak memory consumption was 133.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:55,970 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.21 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 327.72 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 43.70 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 726.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3121.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.9 MB). Peak memory consumption was 133.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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: 12]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 23 SDslu, 106 SDs, 0 SdLazy, 20 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 17 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 1901 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...