java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:54:10,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:54:10,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:54:10,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:54:10,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:54:10,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:54:10,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:54:10,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:54:10,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:54:10,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:54:10,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:54:10,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:54:10,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:54:10,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:54:10,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:54:10,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:54:10,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:54:10,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:54:10,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:54:10,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:54:10,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:54:10,534 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:54:10,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:54:10,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:54:10,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:54:10,538 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:54:10,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:54:10,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:54:10,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:54:10,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:54:10,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:54:10,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:54:10,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:54:10,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:54:10,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:54:10,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:54:10,545 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 00:54:10,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:54:10,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:54:10,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:54:10,562 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:54:10,563 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:54:10,563 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:54:10,563 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:54:10,563 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:54:10,563 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:54:10,564 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:54:10,564 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:54:10,564 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:54:10,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:54:10,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:54:10,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:54:10,565 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:54:10,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:54:10,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:54:10,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:54:10,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:54:10,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:54:10,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:54:10,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:54:10,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:54:10,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:54:10,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:54:10,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:54:10,568 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:54:10,568 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:54:10,568 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:54:10,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:54:10,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:54:10,568 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:54:10,569 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:54:10,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:54:10,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:54:10,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:54:10,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:54:10,631 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:54:10,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-10-27 00:54:10,697 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f27cae754/4177cd1ea7bb44db9a24b20e3f9948cd/FLAG503e909d1 [2018-10-27 00:54:11,286 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:54:11,287 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-10-27 00:54:11,302 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f27cae754/4177cd1ea7bb44db9a24b20e3f9948cd/FLAG503e909d1 [2018-10-27 00:54:11,318 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f27cae754/4177cd1ea7bb44db9a24b20e3f9948cd [2018-10-27 00:54:11,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:54:11,331 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:54:11,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:54:11,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:54:11,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:54:11,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:54:11" (1/1) ... [2018-10-27 00:54:11,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be7802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:11, skipping insertion in model container [2018-10-27 00:54:11,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:54:11" (1/1) ... [2018-10-27 00:54:11,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:54:11,408 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:54:11,892 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:54:11,901 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:54:12,029 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:54:12,048 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:54:12,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12 WrapperNode [2018-10-27 00:54:12,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:54:12,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:54:12,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:54:12,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:54:12,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:54:12,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:54:12,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:54:12,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:54:12,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... [2018-10-27 00:54:12,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:54:12,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:54:12,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:54:12,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:54:12,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 00:54:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:54:12,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:54:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:54:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:54:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:54:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:54:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:54:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:54:15,913 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:54:15,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:54:15 BoogieIcfgContainer [2018-10-27 00:54:15,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:54:15,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:54:15,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:54:15,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:54:15,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:54:11" (1/3) ... [2018-10-27 00:54:15,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:54:15, skipping insertion in model container [2018-10-27 00:54:15,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:54:12" (2/3) ... [2018-10-27 00:54:15,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2d76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:54:15, skipping insertion in model container [2018-10-27 00:54:15,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:54:15" (3/3) ... [2018-10-27 00:54:15,925 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-10-27 00:54:15,935 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:54:15,945 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:54:15,964 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:54:16,001 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:54:16,001 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:54:16,001 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:54:16,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:54:16,002 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:54:16,002 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:54:16,002 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:54:16,002 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:54:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 00:54:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-27 00:54:16,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:16,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:16,048 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:16,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1592268880, now seen corresponding path program 1 times [2018-10-27 00:54:16,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:16,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:16,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:16,694 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:54:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:16,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:54:16,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:16,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:54:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:54:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:54:16,831 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 00:54:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:18,344 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 00:54:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:54:18,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-27 00:54:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:18,368 INFO L225 Difference]: With dead ends: 621 [2018-10-27 00:54:18,368 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 00:54:18,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:54:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 00:54:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 00:54:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 00:54:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 00:54:18,459 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 118 [2018-10-27 00:54:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:18,460 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 00:54:18,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:54:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 00:54:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-27 00:54:18,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:18,469 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:18,469 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:18,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1462652163, now seen corresponding path program 1 times [2018-10-27 00:54:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:18,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:18,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:18,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:54:18,988 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:18,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:54:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:54:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:18,992 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 00:54:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:20,429 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 00:54:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:54:20,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-10-27 00:54:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:20,435 INFO L225 Difference]: With dead ends: 903 [2018-10-27 00:54:20,435 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 00:54:20,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 00:54:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 00:54:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 00:54:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 00:54:20,468 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 127 [2018-10-27 00:54:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:20,468 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 00:54:20,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:54:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 00:54:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-27 00:54:20,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:20,474 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:20,474 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:20,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1825296655, now seen corresponding path program 1 times [2018-10-27 00:54:20,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:20,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:20,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:20,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:20,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:54:20,952 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:20,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:54:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:54:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:20,954 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 00:54:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:22,971 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 00:54:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:54:22,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-27 00:54:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:22,978 INFO L225 Difference]: With dead ends: 901 [2018-10-27 00:54:22,978 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 00:54:22,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 00:54:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 00:54:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 00:54:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 00:54:23,016 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 133 [2018-10-27 00:54:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:23,017 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 00:54:23,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:54:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 00:54:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 00:54:23,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:23,020 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:23,020 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:23,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1056401542, now seen corresponding path program 1 times [2018-10-27 00:54:23,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:23,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:23,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:23,243 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:54:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:23,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:23,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:54:23,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:23,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:54:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:54:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:54:23,287 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 00:54:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:27,092 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 00:54:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:54:27,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-10-27 00:54:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:27,098 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 00:54:27,099 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 00:54:27,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:54:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 00:54:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 00:54:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 00:54:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 00:54:27,151 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 141 [2018-10-27 00:54:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:27,152 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 00:54:27,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:54:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 00:54:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 00:54:27,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:27,156 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:27,156 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:27,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2142875510, now seen corresponding path program 1 times [2018-10-27 00:54:27,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:27,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:27,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:27,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:27,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:54:27,479 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:27,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:54:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:54:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:27,480 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 00:54:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:28,707 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 00:54:28,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:54:28,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-27 00:54:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:28,718 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 00:54:28,718 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 00:54:28,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 00:54:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 00:54:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 00:54:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 00:54:28,760 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 143 [2018-10-27 00:54:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:28,761 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 00:54:28,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:54:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 00:54:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-27 00:54:28,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:28,764 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:28,765 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:28,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1822889842, now seen corresponding path program 1 times [2018-10-27 00:54:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:28,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:28,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:29,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:29,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:54:29,072 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:29,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:54:29,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:54:29,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:29,074 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 00:54:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:30,549 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 00:54:30,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:54:30,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-10-27 00:54:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:30,556 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 00:54:30,556 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 00:54:30,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:54:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 00:54:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 00:54:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 00:54:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 00:54:30,590 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 145 [2018-10-27 00:54:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:30,591 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 00:54:30,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:54:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 00:54:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-27 00:54:30,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:30,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:30,596 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:30,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2129057642, now seen corresponding path program 1 times [2018-10-27 00:54:30,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:30,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:30,813 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:54:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:31,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:54:31,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:54:31,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:54:31,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:54:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:54:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:54:31,074 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 00:54:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:54:32,246 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 00:54:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:54:32,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-27 00:54:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:54:32,267 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 00:54:32,268 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 00:54:32,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:54:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 00:54:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 00:54:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 00:54:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 00:54:32,319 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 149 [2018-10-27 00:54:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:54:32,320 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 00:54:32,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:54:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 00:54:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-27 00:54:32,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:54:32,327 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:54:32,327 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:54:32,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:54:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash -702189192, now seen corresponding path program 1 times [2018-10-27 00:54:32,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:54:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:32,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:54:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:54:32,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:54:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:54:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:54:32,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:54:32,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:54:32,723 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-10-27 00:54:32,725 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 00:54:32,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:54:32,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:55:05,329 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:55:05,330 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 00:55:05,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:05,343 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:55:12,367 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 82.35% of their original sizes. [2018-10-27 00:55:12,368 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:57:01,412 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-10-27 00:57:01,412 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:57:01,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:57:01,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2018-10-27 00:57:01,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:01,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 00:57:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 00:57:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2018-10-27 00:57:01,416 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 26 states. Received shutdown request... [2018-10-27 00:58:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 00:58:23,576 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 00:58:23,584 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 00:58:23,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:58:23 BoogieIcfgContainer [2018-10-27 00:58:23,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:58:23,585 INFO L168 Benchmark]: Toolchain (without parser) took 252255.39 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 291.7 MB. Max. memory is 7.1 GB. [2018-10-27 00:58:23,587 INFO L168 Benchmark]: CDTParser took 0.16 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-10-27 00:58:23,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.18 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 00:58:23,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 215.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 00:58:23,590 INFO L168 Benchmark]: Boogie Preprocessor took 103.63 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 00:58:23,590 INFO L168 Benchmark]: RCFGBuilder took 3546.86 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2018-10-27 00:58:23,591 INFO L168 Benchmark]: TraceAbstraction took 247667.60 ms. Allocated memory was 2.3 GB in the beginning and 3.7 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 229.3 MB. Max. memory is 7.1 GB. [2018-10-27 00:58:23,599 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 717.18 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 215.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.63 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3546.86 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247667.60 ms. Allocated memory was 2.3 GB in the beginning and 3.7 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 229.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 505]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 505). Cancelled while BasicCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 21 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (368 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 247.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 94.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 893 SDtfs, 4416 SDslu, 727 SDs, 0 SdLazy, 5495 SolverSat, 1111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 23 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 115.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 32.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9949397197024465 AbsIntWeakeningRatio, 0.18032786885245902 AbsIntAvgWeakeningVarsNumRemoved, 487.9398907103825 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1140 NumberOfCodeBlocks, 1140 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1132 ConstructedInterpolants, 0 QuantifiedInterpolants, 1153311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 201/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown