java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 17:46:35,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 17:46:35,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 17:46:35,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 17:46:35,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 17:46:35,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 17:46:35,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 17:46:35,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 17:46:35,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 17:46:35,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 17:46:35,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 17:46:35,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 17:46:35,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 17:46:35,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 17:46:35,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 17:46:35,727 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 17:46:35,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 17:46:35,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 17:46:35,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 17:46:35,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 17:46:35,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 17:46:35,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 17:46:35,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 17:46:35,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 17:46:35,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 17:46:35,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 17:46:35,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 17:46:35,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 17:46:35,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 17:46:35,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 17:46:35,749 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 17:46:35,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 17:46:35,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 17:46:35,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 17:46:35,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 17:46:35,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 17:46:35,758 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 17:46:35,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 17:46:35,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 17:46:35,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 17:46:35,790 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 17:46:35,790 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 17:46:35,790 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 17:46:35,790 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 17:46:35,794 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 17:46:35,794 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 17:46:35,794 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 17:46:35,794 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 17:46:35,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 17:46:35,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 17:46:35,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 17:46:35,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 17:46:35,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 17:46:35,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 17:46:35,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 17:46:35,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 17:46:35,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 17:46:35,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 17:46:35,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 17:46:35,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 17:46:35,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:46:35,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 17:46:35,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 17:46:35,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 17:46:35,801 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 17:46:35,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 17:46:35,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 17:46:35,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 17:46:35,801 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 17:46:35,802 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 17:46:35,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 17:46:35,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 17:46:35,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 17:46:35,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 17:46:35,890 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 17:46:35,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label27_true-unreach-call.c [2018-09-14 17:46:36,227 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914284aac/993c8cfb70894d8683693a7621a3a0bf/FLAGf4661d5dd [2018-09-14 17:46:36,566 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 17:46:36,567 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label27_true-unreach-call.c [2018-09-14 17:46:36,586 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914284aac/993c8cfb70894d8683693a7621a3a0bf/FLAGf4661d5dd [2018-09-14 17:46:36,601 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914284aac/993c8cfb70894d8683693a7621a3a0bf [2018-09-14 17:46:36,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 17:46:36,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 17:46:36,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 17:46:36,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 17:46:36,626 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 17:46:36,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:46:36" (1/1) ... [2018-09-14 17:46:36,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f9d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:36, skipping insertion in model container [2018-09-14 17:46:36,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:46:36" (1/1) ... [2018-09-14 17:46:36,643 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 17:46:37,510 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:46:37,529 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 17:46:37,821 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:46:37,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37 WrapperNode [2018-09-14 17:46:37,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 17:46:37,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 17:46:37,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 17:46:37,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 17:46:37,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 17:46:38,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 17:46:38,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 17:46:38,186 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 17:46:38,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... [2018-09-14 17:46:38,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 17:46:38,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 17:46:38,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 17:46:38,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 17:46:38,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:46:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 17:46:38,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 17:46:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-14 17:46:38,881 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-14 17:46:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 17:46:38,881 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 17:46:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 17:46:38,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 17:46:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 17:46:38,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 17:46:45,951 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 17:46:45,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:46:45 BoogieIcfgContainer [2018-09-14 17:46:45,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 17:46:45,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 17:46:45,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 17:46:45,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 17:46:45,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 05:46:36" (1/3) ... [2018-09-14 17:46:45,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56763a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:46:45, skipping insertion in model container [2018-09-14 17:46:45,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:46:37" (2/3) ... [2018-09-14 17:46:45,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56763a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:46:45, skipping insertion in model container [2018-09-14 17:46:45,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:46:45" (3/3) ... [2018-09-14 17:46:45,962 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label27_true-unreach-call.c [2018-09-14 17:46:45,970 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 17:46:45,978 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 17:46:46,033 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 17:46:46,033 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 17:46:46,034 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 17:46:46,034 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 17:46:46,034 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 17:46:46,034 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 17:46:46,034 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 17:46:46,034 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 17:46:46,035 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 17:46:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-09-14 17:46:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-14 17:46:46,078 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:46:46,079 INFO L376 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] [2018-09-14 17:46:46,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:46:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash 923838876, now seen corresponding path program 1 times [2018-09-14 17:46:46,088 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:46:46,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:46:46,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:46:46,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:46:46,141 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:46:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:46:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:46:46,614 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:46:46,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:46:46,614 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:46:46,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:46:46,638 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:46:46,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:46:46,642 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-09-14 17:46:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:46:54,020 INFO L93 Difference]: Finished difference Result 1558 states and 2849 transitions. [2018-09-14 17:46:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:46:54,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-09-14 17:46:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:46:54,050 INFO L225 Difference]: With dead ends: 1558 [2018-09-14 17:46:54,050 INFO L226 Difference]: Without dead ends: 1114 [2018-09-14 17:46:54,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09-14 17:46:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2018-09-14 17:46:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 759. [2018-09-14 17:46:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-09-14 17:46:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1355 transitions. [2018-09-14 17:46:54,190 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1355 transitions. Word has length 44 [2018-09-14 17:46:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:46:54,191 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1355 transitions. [2018-09-14 17:46:54,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:46:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1355 transitions. [2018-09-14 17:46:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-14 17:46:54,201 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:46:54,201 INFO L376 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, 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] [2018-09-14 17:46:54,202 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:46:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1568120057, now seen corresponding path program 1 times [2018-09-14 17:46:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:46:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:46:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:46:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:46:54,204 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:46:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:46:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:46:54,482 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:46:54,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:46:54,482 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:46:54,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:46:54,485 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:46:54,486 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:46:54,486 INFO L87 Difference]: Start difference. First operand 759 states and 1355 transitions. Second operand 4 states. [2018-09-14 17:47:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:47:03,299 INFO L93 Difference]: Finished difference Result 2757 states and 5143 transitions. [2018-09-14 17:47:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:47:03,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-09-14 17:47:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:47:03,317 INFO L225 Difference]: With dead ends: 2757 [2018-09-14 17:47:03,318 INFO L226 Difference]: Without dead ends: 2004 [2018-09-14 17:47:03,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:47:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2018-09-14 17:47:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1999. [2018-09-14 17:47:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2018-09-14 17:47:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 3239 transitions. [2018-09-14 17:47:03,416 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 3239 transitions. Word has length 114 [2018-09-14 17:47:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:47:03,417 INFO L480 AbstractCegarLoop]: Abstraction has 1999 states and 3239 transitions. [2018-09-14 17:47:03,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:47:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 3239 transitions. [2018-09-14 17:47:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-14 17:47:03,427 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:47:03,427 INFO L376 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, 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] [2018-09-14 17:47:03,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:47:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash 440789569, now seen corresponding path program 1 times [2018-09-14 17:47:03,428 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:47:03,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:47:03,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:47:03,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:47:03,430 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:47:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:47:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:47:03,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:47:03,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 17:47:03,683 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:47:03,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:47:03,684 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:47:03,684 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-14 17:47:03,684 INFO L87 Difference]: Start difference. First operand 1999 states and 3239 transitions. Second operand 5 states. [2018-09-14 17:47:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:47:24,674 INFO L93 Difference]: Finished difference Result 7361 states and 12132 transitions. [2018-09-14 17:47:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 17:47:24,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2018-09-14 17:47:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:47:24,710 INFO L225 Difference]: With dead ends: 7361 [2018-09-14 17:47:24,710 INFO L226 Difference]: Without dead ends: 5368 [2018-09-14 17:47:24,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 17:47:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2018-09-14 17:47:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5286. [2018-09-14 17:47:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5286 states. [2018-09-14 17:47:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7080 transitions. [2018-09-14 17:47:24,914 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7080 transitions. Word has length 168 [2018-09-14 17:47:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:47:24,915 INFO L480 AbstractCegarLoop]: Abstraction has 5286 states and 7080 transitions. [2018-09-14 17:47:24,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:47:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7080 transitions. [2018-09-14 17:47:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-14 17:47:24,927 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:47:24,928 INFO L376 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, 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, 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, 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] [2018-09-14 17:47:24,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:47:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash -116991382, now seen corresponding path program 1 times [2018-09-14 17:47:24,928 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:47:24,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:47:24,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:47:24,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:47:24,930 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:47:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:47:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 77 proven. 87 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-14 17:47:25,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:47:25,293 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:47:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:47:25,302 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:47:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:47:25,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:47:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-14 17:47:26,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:47:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 79 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:47:26,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:47:26,773 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:47:26,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:47:26,791 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:47:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:47:26,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:47:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-14 17:47:27,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:47:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 79 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:47:27,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:47:27,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8, 7, 8] total 16 [2018-09-14 17:47:27,684 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:47:27,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-14 17:47:27,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-14 17:47:27,687 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-09-14 17:47:27,687 INFO L87 Difference]: Start difference. First operand 5286 states and 7080 transitions. Second operand 11 states. [2018-09-14 17:48:00,347 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-14 17:48:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:48:01,966 INFO L93 Difference]: Finished difference Result 28143 states and 44383 transitions. [2018-09-14 17:48:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-14 17:48:01,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 264 [2018-09-14 17:48:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:48:02,136 INFO L225 Difference]: With dead ends: 28143 [2018-09-14 17:48:02,136 INFO L226 Difference]: Without dead ends: 22863 [2018-09-14 17:48:02,233 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1047 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=908, Invalid=3382, Unknown=0, NotChecked=0, Total=4290 [2018-09-14 17:48:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22863 states. [2018-09-14 17:48:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22863 to 22123. [2018-09-14 17:48:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22123 states. [2018-09-14 17:48:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22123 states to 22123 states and 27837 transitions. [2018-09-14 17:48:02,957 INFO L78 Accepts]: Start accepts. Automaton has 22123 states and 27837 transitions. Word has length 264 [2018-09-14 17:48:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:48:02,958 INFO L480 AbstractCegarLoop]: Abstraction has 22123 states and 27837 transitions. [2018-09-14 17:48:02,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-14 17:48:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22123 states and 27837 transitions. [2018-09-14 17:48:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-09-14 17:48:02,985 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:48:02,986 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 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] [2018-09-14 17:48:02,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:48:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1999141052, now seen corresponding path program 1 times [2018-09-14 17:48:02,987 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:48:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:02,989 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:48:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-09-14 17:48:03,450 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:48:03,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:48:03,451 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:48:03,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:48:03,452 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:48:03,452 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:48:03,452 INFO L87 Difference]: Start difference. First operand 22123 states and 27837 transitions. Second operand 3 states. [2018-09-14 17:48:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:48:10,448 INFO L93 Difference]: Finished difference Result 47048 states and 61389 transitions. [2018-09-14 17:48:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:48:10,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2018-09-14 17:48:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:48:10,556 INFO L225 Difference]: With dead ends: 47048 [2018-09-14 17:48:10,557 INFO L226 Difference]: Without dead ends: 25239 [2018-09-14 17:48:10,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:48:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25239 states. [2018-09-14 17:48:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25239 to 25239. [2018-09-14 17:48:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25239 states. [2018-09-14 17:48:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25239 states to 25239 states and 32656 transitions. [2018-09-14 17:48:11,349 INFO L78 Accepts]: Start accepts. Automaton has 25239 states and 32656 transitions. Word has length 415 [2018-09-14 17:48:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:48:11,350 INFO L480 AbstractCegarLoop]: Abstraction has 25239 states and 32656 transitions. [2018-09-14 17:48:11,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:48:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25239 states and 32656 transitions. [2018-09-14 17:48:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-09-14 17:48:11,375 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:48:11,376 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 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] [2018-09-14 17:48:11,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:48:11,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1398971080, now seen corresponding path program 1 times [2018-09-14 17:48:11,377 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:48:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:11,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:11,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:11,378 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:48:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 157 proven. 121 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-09-14 17:48:12,236 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:48:12,236 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:48:12,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:12,247 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:48:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:12,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:48:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-09-14 17:48:12,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:48:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 111 proven. 178 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-14 17:48:14,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:48:14,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 13 [2018-09-14 17:48:14,534 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:48:14,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:48:14,535 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:48:14,536 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-09-14 17:48:14,536 INFO L87 Difference]: Start difference. First operand 25239 states and 32656 transitions. Second operand 5 states. [2018-09-14 17:48:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:48:27,295 INFO L93 Difference]: Finished difference Result 57264 states and 74862 transitions. [2018-09-14 17:48:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:48:27,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 433 [2018-09-14 17:48:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:48:27,379 INFO L225 Difference]: With dead ends: 57264 [2018-09-14 17:48:27,379 INFO L226 Difference]: Without dead ends: 32339 [2018-09-14 17:48:27,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 862 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-09-14 17:48:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32339 states. [2018-09-14 17:48:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32339 to 31551. [2018-09-14 17:48:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31551 states. [2018-09-14 17:48:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31551 states to 31551 states and 40857 transitions. [2018-09-14 17:48:28,244 INFO L78 Accepts]: Start accepts. Automaton has 31551 states and 40857 transitions. Word has length 433 [2018-09-14 17:48:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:48:28,244 INFO L480 AbstractCegarLoop]: Abstraction has 31551 states and 40857 transitions. [2018-09-14 17:48:28,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:48:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 31551 states and 40857 transitions. [2018-09-14 17:48:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-09-14 17:48:28,281 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:48:28,282 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:48:28,282 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:48:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1728873455, now seen corresponding path program 1 times [2018-09-14 17:48:28,282 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:48:28,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:28,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:28,284 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:48:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:28,724 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2018-09-14 17:48:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-09-14 17:48:28,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:48:28,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:48:28,928 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:48:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:48:28,929 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:48:28,929 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:48:28,929 INFO L87 Difference]: Start difference. First operand 31551 states and 40857 transitions. Second operand 3 states. [2018-09-14 17:48:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:48:35,273 INFO L93 Difference]: Finished difference Result 76564 states and 103777 transitions. [2018-09-14 17:48:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:48:35,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2018-09-14 17:48:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:48:35,422 INFO L225 Difference]: With dead ends: 76564 [2018-09-14 17:48:35,423 INFO L226 Difference]: Without dead ends: 45327 [2018-09-14 17:48:35,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:48:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2018-09-14 17:48:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 45307. [2018-09-14 17:48:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45307 states. [2018-09-14 17:48:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 58055 transitions. [2018-09-14 17:48:36,821 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 58055 transitions. Word has length 507 [2018-09-14 17:48:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:48:36,822 INFO L480 AbstractCegarLoop]: Abstraction has 45307 states and 58055 transitions. [2018-09-14 17:48:36,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:48:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 58055 transitions. [2018-09-14 17:48:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-09-14 17:48:36,868 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:48:36,869 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:48:36,869 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:48:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1408295133, now seen corresponding path program 1 times [2018-09-14 17:48:36,870 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:48:36,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:36,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:36,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:48:36,871 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:48:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-14 17:48:37,752 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:48:37,752 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:48:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:37,768 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:48:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:37,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:48:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-14 17:48:38,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:48:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-14 17:48:39,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:48:39,532 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:48:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:48:39,551 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:48:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:48:39,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:48:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-14 17:48:40,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:48:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-14 17:48:41,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:48:41,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:48:41,598 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:48:41,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:48:41,599 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:48:41,599 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:48:41,600 INFO L87 Difference]: Start difference. First operand 45307 states and 58055 transitions. Second operand 9 states. [2018-09-14 17:48:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:48:56,356 INFO L93 Difference]: Finished difference Result 130251 states and 194878 transitions. [2018-09-14 17:48:56,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-14 17:48:56,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 531 [2018-09-14 17:48:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:48:56,994 INFO L225 Difference]: With dead ends: 130251 [2018-09-14 17:48:56,995 INFO L226 Difference]: Without dead ends: 85258 [2018-09-14 17:48:57,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2158 GetRequests, 2128 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2018-09-14 17:48:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85258 states. [2018-09-14 17:48:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85258 to 81283. [2018-09-14 17:48:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81283 states. [2018-09-14 17:49:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81283 states to 81283 states and 109926 transitions. [2018-09-14 17:49:00,371 INFO L78 Accepts]: Start accepts. Automaton has 81283 states and 109926 transitions. Word has length 531 [2018-09-14 17:49:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:49:00,372 INFO L480 AbstractCegarLoop]: Abstraction has 81283 states and 109926 transitions. [2018-09-14 17:49:00,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:49:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 81283 states and 109926 transitions. [2018-09-14 17:49:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-09-14 17:49:00,421 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:49:00,421 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:49:00,422 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:49:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1981221971, now seen corresponding path program 1 times [2018-09-14 17:49:00,422 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:49:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:49:00,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:49:00,424 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:49:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 199 proven. 84 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-14 17:49:00,845 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:49:00,845 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:49:00,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:00,857 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:49:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:01,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:49:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 372 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-09-14 17:49:01,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:49:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 199 proven. 84 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-14 17:49:01,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:49:01,534 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:49:01,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:01,550 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:49:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:01,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:49:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 372 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-09-14 17:49:02,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:49:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 199 proven. 84 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-14 17:49:03,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:49:03,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:49:03,015 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:49:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:49:03,017 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:49:03,017 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:49:03,018 INFO L87 Difference]: Start difference. First operand 81283 states and 109926 transitions. Second operand 9 states. [2018-09-14 17:49:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:49:17,584 INFO L93 Difference]: Finished difference Result 174201 states and 273769 transitions. [2018-09-14 17:49:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-14 17:49:17,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 537 [2018-09-14 17:49:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:49:18,286 INFO L225 Difference]: With dead ends: 174201 [2018-09-14 17:49:18,286 INFO L226 Difference]: Without dead ends: 93930 [2018-09-14 17:49:18,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2180 GetRequests, 2151 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2018-09-14 17:49:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93930 states. [2018-09-14 17:49:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93930 to 93519. [2018-09-14 17:49:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93519 states. [2018-09-14 17:49:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93519 states to 93519 states and 156242 transitions. [2018-09-14 17:49:23,697 INFO L78 Accepts]: Start accepts. Automaton has 93519 states and 156242 transitions. Word has length 537 [2018-09-14 17:49:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:49:23,698 INFO L480 AbstractCegarLoop]: Abstraction has 93519 states and 156242 transitions. [2018-09-14 17:49:23,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:49:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 93519 states and 156242 transitions. [2018-09-14 17:49:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-09-14 17:49:23,756 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:49:23,756 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-14 17:49:23,757 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:49:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -559178935, now seen corresponding path program 1 times [2018-09-14 17:49:23,757 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:49:23,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:49:23,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:23,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:49:23,758 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:49:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 331 proven. 85 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2018-09-14 17:49:24,330 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:49:24,330 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:49:24,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:24,340 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:49:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:24,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:49:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 596 proven. 2 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-09-14 17:49:24,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:49:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 331 proven. 85 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2018-09-14 17:49:25,015 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:49:25,016 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:49:25,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:25,031 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:49:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:26,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:49:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 596 proven. 2 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-09-14 17:49:26,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:49:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 331 proven. 85 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2018-09-14 17:49:26,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:49:26,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:49:26,678 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:49:26,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:49:26,679 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:49:26,680 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:49:26,680 INFO L87 Difference]: Start difference. First operand 93519 states and 156242 transitions. Second operand 9 states. [2018-09-14 17:49:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:49:39,970 INFO L93 Difference]: Finished difference Result 156934 states and 249278 transitions. [2018-09-14 17:49:39,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-14 17:49:39,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 558 [2018-09-14 17:49:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:49:40,213 INFO L225 Difference]: With dead ends: 156934 [2018-09-14 17:49:40,214 INFO L226 Difference]: Without dead ends: 64427 [2018-09-14 17:49:40,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2254 GetRequests, 2230 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-09-14 17:49:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64427 states. [2018-09-14 17:49:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64427 to 63458. [2018-09-14 17:49:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63458 states. [2018-09-14 17:49:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63458 states to 63458 states and 74530 transitions. [2018-09-14 17:49:42,560 INFO L78 Accepts]: Start accepts. Automaton has 63458 states and 74530 transitions. Word has length 558 [2018-09-14 17:49:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:49:42,561 INFO L480 AbstractCegarLoop]: Abstraction has 63458 states and 74530 transitions. [2018-09-14 17:49:42,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:49:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 63458 states and 74530 transitions. [2018-09-14 17:49:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-09-14 17:49:42,588 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:49:42,588 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:49:42,589 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:49:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2018883817, now seen corresponding path program 1 times [2018-09-14 17:49:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:49:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:49:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:49:42,591 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:49:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:43,380 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-14 17:49:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 44 proven. 448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:49:44,451 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:49:44,451 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:49:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:49:44,459 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:49:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:49:45,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:50:06,593 WARN L178 SmtUtils]: Spent 21.18 s on a formula simplification. DAG size of input: 388 DAG size of output: 62 [2018-09-14 17:50:13,125 WARN L178 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2018-09-14 17:50:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 348 proven. 35 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-09-14 17:50:13,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:50:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 381 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-09-14 17:50:14,231 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:50:14,232 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:50:14,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:50:14,247 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:50:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:50:14,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-09-14 17:50:35,129 WARN L186 SmtUtils]: Removed 3 from assertion stack [2018-09-14 17:50:35,130 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-14 17:50:35,331 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:50:35,331 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 17:50:35,337 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 17:50:35,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 05:50:35 BoogieIcfgContainer [2018-09-14 17:50:35,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 17:50:35,339 INFO L168 Benchmark]: Toolchain (without parser) took 238723.91 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-14 17:50:35,340 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 17:50:35,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1348.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-09-14 17:50:35,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-14 17:50:35,342 INFO L168 Benchmark]: Boogie Preprocessor took 619.16 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 909.1 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2018-09-14 17:50:35,343 INFO L168 Benchmark]: RCFGBuilder took 7147.23 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 298.5 MB). Peak memory consumption was 298.5 MB. Max. memory is 7.1 GB. [2018-09-14 17:50:35,343 INFO L168 Benchmark]: TraceAbstraction took 229384.56 ms. Allocated memory was 2.5 GB in the beginning and 4.8 GB in the end (delta: 2.4 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -576.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-14 17:50:35,348 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1348.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 218.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 619.16 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 909.1 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7147.23 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 298.5 MB). Peak memory consumption was 298.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229384.56 ms. Allocated memory was 2.5 GB in the beginning and 4.8 GB in the end (delta: 2.4 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -576.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 118). Cancelled while BasicCegarLoop was analyzing trace of length 589 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 229.3s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 144.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2560 SDtfs, 17578 SDslu, 3822 SDs, 0 SdLazy, 42848 SolverSat, 7611 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 113.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8613 GetRequests, 8434 SyntacticMatches, 24 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93519occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 7345 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 7784 NumberOfCodeBlocks, 7784 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 11969 ConstructedInterpolants, 0 QuantifiedInterpolants, 15263192 SizeOfPredicates, 6 NumberOfNonLiveVariables, 6202 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 9434/10531 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem15_label27_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_17-50-35-371.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem15_label27_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_17-50-35-371.csv Completed graceful shutdown