java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test14_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:34,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:34,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:34,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:34,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:34,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:34,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:34,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:34,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:34,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:34,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:34,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:34,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:34,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:34,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:34,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:34,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:34,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:34,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:34,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:34,055 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:34,056 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:34,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:34,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:34,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:34,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:34,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:34,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:34,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:34,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:34,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:34,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:34,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:34,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:34,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:34,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:34,085 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:34,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:34,107 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:34,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:34,108 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:34,108 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:34,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:34,109 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:34,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:34,109 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:34,109 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:34,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:34,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:34,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:34,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:34,110 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:34,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:34,111 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:34,111 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:34,111 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:34,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:34,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:34,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:34,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:34,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:34,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:34,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:34,113 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:34,113 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:34,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:34,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:34,114 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:34,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:34,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:34,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:34,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:34,210 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:34,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test14_true-unreach-call_true-termination.c [2018-11-23 12:54:34,272 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7010d0dc8/a61c850a29304885836e420f863a9381/FLAG5a7333170 [2018-11-23 12:54:34,749 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:34,750 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test14_true-unreach-call_true-termination.c [2018-11-23 12:54:34,756 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7010d0dc8/a61c850a29304885836e420f863a9381/FLAG5a7333170 [2018-11-23 12:54:35,088 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7010d0dc8/a61c850a29304885836e420f863a9381 [2018-11-23 12:54:35,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:35,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:35,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:35,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:35,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:35,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5c8908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35, skipping insertion in model container [2018-11-23 12:54:35,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:35,143 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:35,380 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:35,398 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:35,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:35,455 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:35,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35 WrapperNode [2018-11-23 12:54:35,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:35,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:35,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:35,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:35,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:35,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:35,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:35,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:35,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... [2018-11-23 12:54:35,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:35,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:35,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:35,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:35,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:35,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-23 12:54:35,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-23 12:54:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:35,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:35,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 12:54:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:36,229 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:36,230 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:36,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:36 BoogieIcfgContainer [2018-11-23 12:54:36,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:36,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:36,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:36,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:36,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:35" (1/3) ... [2018-11-23 12:54:36,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9ffa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:36, skipping insertion in model container [2018-11-23 12:54:36,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:35" (2/3) ... [2018-11-23 12:54:36,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9ffa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:36, skipping insertion in model container [2018-11-23 12:54:36,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:36" (3/3) ... [2018-11-23 12:54:36,239 INFO L112 eAbstractionObserver]: Analyzing ICFG test14_true-unreach-call_true-termination.c [2018-11-23 12:54:36,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:36,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:36,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:36,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:36,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:36,310 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:36,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:36,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:36,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:36,311 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:36,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:36,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 12:54:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:54:36,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:36,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:36,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:36,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash 521841741, now seen corresponding path program 1 times [2018-11-23 12:54:36,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:36,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 12:54:36,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {25#true} is VALID [2018-11-23 12:54:36,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 12:54:36,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #38#return; {25#true} is VALID [2018-11-23 12:54:36,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret9 := main(); {25#true} is VALID [2018-11-23 12:54:36,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4);call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~a~1 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~b~1 := #t~nondet3;havoc #t~nondet3;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; {27#(not (= 0 main_~pc~0.base))} is VALID [2018-11-23 12:54:36,666 INFO L256 TraceCheckUtils]: 6: Hoare triple {27#(not (= 0 main_~pc~0.base))} call #t~ret4.base, #t~ret4.offset := get_dummy(); {25#true} is VALID [2018-11-23 12:54:36,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {25#true} is VALID [2018-11-23 12:54:36,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {25#true} is VALID [2018-11-23 12:54:36,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 12:54:36,669 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {25#true} {27#(not (= 0 main_~pc~0.base))} #42#return; {27#(not (= 0 main_~pc~0.base))} is VALID [2018-11-23 12:54:36,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {28#(not |main_#t~short8|)} is VALID [2018-11-23 12:54:36,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#(not |main_#t~short8|)} assume #t~short8; {26#false} is VALID [2018-11-23 12:54:36,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {26#false} assume #t~short8;havoc #t~mem5;havoc #t~short7;havoc #t~mem6;havoc #t~short8; {26#false} is VALID [2018-11-23 12:54:36,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 12:54:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:36,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:54:36,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:54:36,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:36,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:54:36,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:36,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:54:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:54:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:54:36,858 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2018-11-23 12:54:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,223 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:54:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:37,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:54:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-23 12:54:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-23 12:54:37,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2018-11-23 12:54:37,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:37,355 INFO L225 Difference]: With dead ends: 29 [2018-11-23 12:54:37,355 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:54:37,358 INFO L631 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-23 12:54:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:54:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:54:37,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:37,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:54:37,466 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:54:37,467 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:54:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,471 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:54:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:54:37,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:37,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:37,472 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:54:37,472 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:54:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,476 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:54:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:54:37,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:37,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:37,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:37,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:54:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:54:37,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-11-23 12:54:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:37,482 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:54:37,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:54:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:54:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:54:37,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:37,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:37,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:37,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1019657549, now seen corresponding path program 1 times [2018-11-23 12:54:37,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:37,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:37,819 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-11-23 12:54:37,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2018-11-23 12:54:37,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {131#true} is VALID [2018-11-23 12:54:37,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-23 12:54:37,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #38#return; {131#true} is VALID [2018-11-23 12:54:37,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret9 := main(); {131#true} is VALID [2018-11-23 12:54:37,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#true} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4);call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~a~1 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~b~1 := #t~nondet3;havoc #t~nondet3;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; {131#true} is VALID [2018-11-23 12:54:37,852 INFO L256 TraceCheckUtils]: 6: Hoare triple {131#true} call #t~ret4.base, #t~ret4.offset := get_dummy(); {131#true} is VALID [2018-11-23 12:54:37,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {131#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {131#true} is VALID [2018-11-23 12:54:37,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {131#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {131#true} is VALID [2018-11-23 12:54:37,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-23 12:54:37,854 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {131#true} {131#true} #42#return; {131#true} is VALID [2018-11-23 12:54:37,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {131#true} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {133#(and (= main_~pa~0.offset main_~pb~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2018-11-23 12:54:37,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {133#(and (= main_~pa~0.offset main_~pb~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short8;#t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {134#(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-23 12:54:37,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {134#(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~short7;call #t~mem5 := read~int(~pa~0.base, ~pa~0.offset, 4);call #t~mem6 := read~int(~pb~0.base, ~pb~0.offset, 4);#t~short7 := #t~mem5 != #t~mem6; {135#(not |main_#t~short7|)} is VALID [2018-11-23 12:54:37,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {135#(not |main_#t~short7|)} #t~short8 := #t~short7; {136#(not |main_#t~short8|)} is VALID [2018-11-23 12:54:37,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {136#(not |main_#t~short8|)} assume #t~short8;havoc #t~mem5;havoc #t~short7;havoc #t~mem6;havoc #t~short8; {132#false} is VALID [2018-11-23 12:54:37,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {132#false} assume !false; {132#false} is VALID [2018-11-23 12:54:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:37,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:37,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:54:37,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:54:37,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:37,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:54:37,901 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-23 12:54:37,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:54:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:54:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:37,903 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 12:54:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,565 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:54:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:38,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:54:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 12:54:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 12:54:38,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 12:54:38,611 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-23 12:54:38,611 INFO L225 Difference]: With dead ends: 18 [2018-11-23 12:54:38,611 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:54:38,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:54:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:54:38,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:38,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,613 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,613 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,614 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,614 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,614 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,615 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:38,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:38,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:54:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:54:38,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 12:54:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:38,616 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:54:38,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:54:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:38,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:54:38,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:38,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,661 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2018-11-23 12:54:38,661 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-23 12:54:38,662 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2018-11-23 12:54:38,662 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2018-11-23 12:54:38,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,662 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:54:38,663 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:38,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,663 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2018-11-23 12:54:38,663 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2018-11-23 12:54:38,663 INFO L444 ceAbstractionStarter]: At program point L20(lines 12 27) the Hoare annotation is: false [2018-11-23 12:54:38,664 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 12:54:38,664 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-23 12:54:38,664 INFO L444 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2018-11-23 12:54:38,664 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2018-11-23 12:54:38,664 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-23 12:54:38,665 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2018-11-23 12:54:38,665 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2018-11-23 12:54:38,665 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-23 12:54:38,667 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:38,667 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-23 12:54:38,667 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-23 12:54:38,669 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:38,669 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 12:54:38,670 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:38,671 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:38,672 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 12:54:38,672 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:38,672 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-23 12:54:38,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:38 BoogieIcfgContainer [2018-11-23 12:54:38,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:38,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:38,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:38,678 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:38,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:36" (3/4) ... [2018-11-23 12:54:38,682 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:54:38,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:54:38,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-23 12:54:38,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:54:38,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 12:54:38,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 12:54:38,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:54:38,760 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test14_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:38,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:38,761 INFO L168 Benchmark]: Toolchain (without parser) took 3662.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -625.8 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:38,763 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:38,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.99 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-23 12:54:38,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:38,764 INFO L168 Benchmark]: Boogie Preprocessor took 40.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:38,765 INFO L168 Benchmark]: RCFGBuilder took 701.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -730.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:38,766 INFO L168 Benchmark]: TraceAbstraction took 2446.04 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 93.8 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:38,766 INFO L168 Benchmark]: Witness Printer took 82.17 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:38,771 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.99 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 Procedure Inliner took 30.26 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. * Boogie Preprocessor took 40.94 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 701.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -730.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2446.04 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 93.8 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. * Witness Printer took 82.17 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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, 22 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 17 SDslu, 74 SDs, 0 SdLazy, 13 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 10 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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...