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/Problem01_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:36:06,531 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:36:06,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:36:06,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:36:06,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:36:06,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:36:06,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:36:06,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:36:06,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:36:06,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:36:06,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:36:06,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:36:06,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:36:06,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:36:06,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:36:06,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:36:06,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:36:06,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:36:06,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:36:06,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:36:06,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:36:06,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:36:06,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:36:06,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:36:06,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:36:06,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:36:06,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:36:06,604 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:36:06,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:36:06,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:36:06,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:36:06,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:36:06,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:36:06,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:36:06,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:36:06,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:36:06,612 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:36:06,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:36:06,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:36:06,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:36:06,642 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:36:06,643 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:36:06,643 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:36:06,643 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:36:06,643 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:36:06,644 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:36:06,644 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:36:06,644 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:36:06,644 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:36:06,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:36:06,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:36:06,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:36:06,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:36:06,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:36:06,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:36:06,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:36:06,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:36:06,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:36:06,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:36:06,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:36:06,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:36:06,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:36:06,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:36:06,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:36:06,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:36:06,650 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:36:06,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:36:06,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:36:06,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:36:06,651 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:36:06,651 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:36:06,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:36:06,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:36:06,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:36:06,733 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:36:06,733 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:36:06,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-10-27 00:36:06,786 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5f42604b1/ea58e1776da34054ba1ab58c58644f07/FLAG640d70bdb [2018-10-27 00:36:07,395 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:36:07,396 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-10-27 00:36:07,422 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5f42604b1/ea58e1776da34054ba1ab58c58644f07/FLAG640d70bdb [2018-10-27 00:36:07,443 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5f42604b1/ea58e1776da34054ba1ab58c58644f07 [2018-10-27 00:36:07,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:36:07,457 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:36:07,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:36:07,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:36:07,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:36:07,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:36:07" (1/1) ... [2018-10-27 00:36:07,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e73589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:07, skipping insertion in model container [2018-10-27 00:36:07,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:36:07" (1/1) ... [2018-10-27 00:36:07,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:36:07,559 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:36:08,045 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:36:08,050 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:36:08,165 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:36:08,186 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:36:08,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08 WrapperNode [2018-10-27 00:36:08,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:36:08,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:36:08,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:36:08,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:36:08,198 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:36:08" (1/1) ... [2018-10-27 00:36:08,233 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:36:08" (1/1) ... [2018-10-27 00:36:08,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:36:08,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:36:08,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:36:08,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:36:08,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (1/1) ... [2018-10-27 00:36:08,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:36:08,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:36:08,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:36:08,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:36:08,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (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:36:08,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:36:08,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:36:08,598 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:36:08,599 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:36:08,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:36:08,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:36:08,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:36:08,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:36:11,959 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:36:11,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:36:11 BoogieIcfgContainer [2018-10-27 00:36:11,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:36:11,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:36:11,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:36:11,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:36:11,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:36:07" (1/3) ... [2018-10-27 00:36:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192018a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:36:11, skipping insertion in model container [2018-10-27 00:36:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:36:08" (2/3) ... [2018-10-27 00:36:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192018a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:36:11, skipping insertion in model container [2018-10-27 00:36:11,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:36:11" (3/3) ... [2018-10-27 00:36:11,976 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label14_true-unreach-call_false-termination.c [2018-10-27 00:36:11,987 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:36:11,999 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:36:12,015 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:36:12,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:36:12,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:36:12,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:36:12,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:36:12,054 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:36:12,055 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:36:12,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:36:12,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:36:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 00:36:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-27 00:36:12,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:12,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:36:12,103 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:12,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1783775568, now seen corresponding path program 1 times [2018-10-27 00:36:12,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:12,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:12,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:12,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:12,957 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:36:12,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:36:12,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:36:12,961 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:36:12,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:36:12,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:36:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:36:12,992 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 00:36:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:36:14,838 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 00:36:14,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:36:14,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-27 00:36:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:36:14,859 INFO L225 Difference]: With dead ends: 550 [2018-10-27 00:36:14,860 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 00:36:14,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:36:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 00:36:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 00:36:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 00:36:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-10-27 00:36:14,946 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 138 [2018-10-27 00:36:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:36:14,947 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-10-27 00:36:14,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:36:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-10-27 00:36:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-27 00:36:14,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:14,955 INFO L375 BasicCegarLoop]: trace histogram [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, 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:36:14,955 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:14,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1808650351, now seen corresponding path program 1 times [2018-10-27 00:36:14,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:14,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:15,212 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:36:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:15,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:36:15,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:36:15,371 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:36:15,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:36:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:36:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:36:15,374 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-10-27 00:36:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:36:17,184 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-10-27 00:36:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:36:17,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-27 00:36:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:36:17,198 INFO L225 Difference]: With dead ends: 1075 [2018-10-27 00:36:17,198 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 00:36:17,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:36:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 00:36:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-27 00:36:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-27 00:36:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-10-27 00:36:17,272 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 149 [2018-10-27 00:36:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:36:17,273 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-10-27 00:36:17,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:36:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-10-27 00:36:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:36:17,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:17,280 INFO L375 BasicCegarLoop]: trace histogram [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, 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:36:17,281 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:17,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2122506691, now seen corresponding path program 1 times [2018-10-27 00:36:17,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:17,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:17,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:17,822 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 00:36:18,055 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 00:36:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:18,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:36:18,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:36:18,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:36:18,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:36:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:36:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:36:18,195 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-10-27 00:36:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:36:20,712 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-10-27 00:36:20,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:36:20,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-10-27 00:36:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:36:20,720 INFO L225 Difference]: With dead ends: 1578 [2018-10-27 00:36:20,720 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 00:36:20,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:36:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 00:36:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-27 00:36:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-27 00:36:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-10-27 00:36:20,776 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 150 [2018-10-27 00:36:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:36:20,776 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-10-27 00:36:20,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:36:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-10-27 00:36:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:36:20,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:20,782 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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:36:20,782 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:20,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1419468101, now seen corresponding path program 1 times [2018-10-27 00:36:20,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:20,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:20,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:36:20,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:36:20,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:36:20,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:36:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:36:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:36:20,974 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 3 states. [2018-10-27 00:36:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:36:23,050 INFO L93 Difference]: Finished difference Result 2069 states and 3084 transitions. [2018-10-27 00:36:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:36:23,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-10-27 00:36:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:36:23,064 INFO L225 Difference]: With dead ends: 2069 [2018-10-27 00:36:23,064 INFO L226 Difference]: Without dead ends: 1354 [2018-10-27 00:36:23,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:36:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-27 00:36:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1347. [2018-10-27 00:36:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-10-27 00:36:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1892 transitions. [2018-10-27 00:36:23,113 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1892 transitions. Word has length 154 [2018-10-27 00:36:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:36:23,114 INFO L481 AbstractCegarLoop]: Abstraction has 1347 states and 1892 transitions. [2018-10-27 00:36:23,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:36:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1892 transitions. [2018-10-27 00:36:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-27 00:36:23,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:23,121 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, 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:36:23,122 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:23,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1446107199, now seen corresponding path program 1 times [2018-10-27 00:36:23,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:23,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:23,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:23,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:36:23,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:36:23,364 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:36:23,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:36:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:36:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:36:23,365 INFO L87 Difference]: Start difference. First operand 1347 states and 1892 transitions. Second operand 4 states. [2018-10-27 00:36:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:36:24,400 INFO L93 Difference]: Finished difference Result 3232 states and 4626 transitions. [2018-10-27 00:36:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:36:24,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-27 00:36:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:36:24,419 INFO L225 Difference]: With dead ends: 3232 [2018-10-27 00:36:24,419 INFO L226 Difference]: Without dead ends: 1891 [2018-10-27 00:36:24,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:36:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2018-10-27 00:36:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2018-10-27 00:36:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-10-27 00:36:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2551 transitions. [2018-10-27 00:36:24,483 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2551 transitions. Word has length 173 [2018-10-27 00:36:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:36:24,484 INFO L481 AbstractCegarLoop]: Abstraction has 1891 states and 2551 transitions. [2018-10-27 00:36:24,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:36:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2551 transitions. [2018-10-27 00:36:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-27 00:36:24,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:24,493 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:36:24,494 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:24,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1915591307, now seen corresponding path program 1 times [2018-10-27 00:36:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:24,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:25,026 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:36:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 00:36:25,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:36:25,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:36:25,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-10-27 00:36:25,161 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [741], [743], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 00:36:25,252 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:36:25,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:36:34,353 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:36:34,355 INFO L272 AbstractInterpreter]: Visited 70 different actions 70 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 00:36:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:34,370 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:36:37,743 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 79.88% of their original sizes. [2018-10-27 00:36:37,744 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:36:38,844 INFO L415 sIntCurrentIteration]: We unified 199 AI predicates to 199 [2018-10-27 00:36:38,845 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:36:38,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:36:38,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-27 00:36:38,846 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:36:38,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 00:36:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 00:36:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:36:38,848 INFO L87 Difference]: Start difference. First operand 1891 states and 2551 transitions. Second operand 12 states. [2018-10-27 00:36:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:36:54,622 INFO L93 Difference]: Finished difference Result 3837 states and 5174 transitions. [2018-10-27 00:36:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:36:54,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 200 [2018-10-27 00:36:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:36:54,634 INFO L225 Difference]: With dead ends: 3837 [2018-10-27 00:36:54,635 INFO L226 Difference]: Without dead ends: 1952 [2018-10-27 00:36:54,642 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:36:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2018-10-27 00:36:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2018-10-27 00:36:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2018-10-27 00:36:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2617 transitions. [2018-10-27 00:36:54,700 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2617 transitions. Word has length 200 [2018-10-27 00:36:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:36:54,700 INFO L481 AbstractCegarLoop]: Abstraction has 1952 states and 2617 transitions. [2018-10-27 00:36:54,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 00:36:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2617 transitions. [2018-10-27 00:36:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-27 00:36:54,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:36:54,710 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:36:54,711 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:36:54,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:36:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash 191855448, now seen corresponding path program 1 times [2018-10-27 00:36:54,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:36:54,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:54,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:36:54,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:36:54,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:36:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 90 proven. 41 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:36:54,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:36:54,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:36:54,997 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-10-27 00:36:54,997 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [741], [743], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 00:36:55,011 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:36:55,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:37:20,180 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:37:20,180 INFO L272 AbstractInterpreter]: Visited 144 different actions 212 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 00:37:20,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:37:20,188 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:37:25,003 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 80.72% of their original sizes. [2018-10-27 00:37:25,004 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:37:33,488 INFO L415 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-10-27 00:37:33,488 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:37:33,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:37:33,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 21 [2018-10-27 00:37:33,489 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:37:33,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 00:37:33,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 00:37:33,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-27 00:37:33,491 INFO L87 Difference]: Start difference. First operand 1952 states and 2617 transitions. Second operand 14 states. [2018-10-27 00:37:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:37:51,080 INFO L93 Difference]: Finished difference Result 3982 states and 5330 transitions. [2018-10-27 00:37:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 00:37:51,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2018-10-27 00:37:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:37:51,089 INFO L225 Difference]: With dead ends: 3982 [2018-10-27 00:37:51,090 INFO L226 Difference]: Without dead ends: 2097 [2018-10-27 00:37:51,095 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 94 SyntacticMatches, 102 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-10-27 00:37:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2018-10-27 00:37:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2090. [2018-10-27 00:37:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-10-27 00:37:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2765 transitions. [2018-10-27 00:37:51,155 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2765 transitions. Word has length 209 [2018-10-27 00:37:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:37:51,156 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 2765 transitions. [2018-10-27 00:37:51,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 00:37:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2765 transitions. [2018-10-27 00:37:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-27 00:37:51,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:37:51,165 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:37:51,165 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:37:51,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:37:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1827509815, now seen corresponding path program 1 times [2018-10-27 00:37:51,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:37:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:37:51,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:37:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:37:51,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:37:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 00:37:51,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:37:51,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:37:51,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-10-27 00:37:51,387 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [737], [741], [743], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 00:37:51,393 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:37:51,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:38:26,388 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:38:26,388 INFO L272 AbstractInterpreter]: Visited 143 different actions 210 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 00:38:26,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:38:26,393 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:38:34,171 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 81.7% of their original sizes. [2018-10-27 00:38:34,171 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:39:42,959 INFO L415 sIntCurrentIteration]: We unified 221 AI predicates to 221 [2018-10-27 00:39:42,960 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:39:42,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:39:42,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2018-10-27 00:39:42,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:39:42,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 00:39:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 00:39:42,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-10-27 00:39:42,961 INFO L87 Difference]: Start difference. First operand 2090 states and 2765 transitions. Second operand 26 states. Received shutdown request... [2018-10-27 00:40:24,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 00:40:24,286 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 00:40:24,292 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 00:40:24,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:40:24 BoogieIcfgContainer [2018-10-27 00:40:24,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:40:24,294 INFO L168 Benchmark]: Toolchain (without parser) took 256838.13 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.1 GB). Peak memory consumption was 544.3 MB. Max. memory is 7.1 GB. [2018-10-27 00:40:24,295 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:40:24,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.63 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:40:24,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 225.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 00:40:24,297 INFO L168 Benchmark]: Boogie Preprocessor took 104.65 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 00:40:24,298 INFO L168 Benchmark]: RCFGBuilder took 3444.59 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.5 MB). Peak memory consumption was 117.5 MB. Max. memory is 7.1 GB. [2018-10-27 00:40:24,299 INFO L168 Benchmark]: TraceAbstraction took 252329.18 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. [2018-10-27 00:40:24,303 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 727.63 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 225.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.65 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3444.59 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.5 MB). Peak memory consumption was 117.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252329.18 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2090states) and FLOYD_HOARE automaton (currently 11 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (37 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 252.2s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 84.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 979 SDtfs, 2716 SDslu, 1072 SDs, 0 SdLazy, 4270 SolverSat, 765 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 689 GetRequests, 487 SyntacticMatches, 114 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 86.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 69.4s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.995081448767173 AbsIntWeakeningRatio, 0.2054140127388535 AbsIntAvgWeakeningVarsNumRemoved, 1387.5238853503186 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1395 NumberOfCodeBlocks, 1395 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1387 ConstructedInterpolants, 0 QuantifiedInterpolants, 856872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 367/438 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown