/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:12,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:12,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:12,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:12,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:12,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:12,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:12,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:12,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:12,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:12,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:12,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:12,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:12,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:12,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:12,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:12,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:12,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:12,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:12,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:12,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:12,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:12,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:12,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:12,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:12,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:12,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:12,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:12,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:12,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:12,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:12,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:12,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:12,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:12,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:12,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:12,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:12,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:12,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:12,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:12,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:12,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:05:12,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:12,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:12,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:12,800 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:12,800 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:12,801 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:12,801 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:12,801 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:12,801 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:12,801 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:12,801 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:12,802 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:12,802 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:12,802 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:12,802 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:12,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:12,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:12,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:12,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:12,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:12,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:12,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:12,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:12,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:12,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:12,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:12,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:12,807 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:12,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:12,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:12,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:12,808 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:13,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:13,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:13,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:13,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:13,116 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:13,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-11-24 06:05:13,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb033777/59fcde4c004a4636913fe7f457f114c9/FLAG3ce48f85f [2019-11-24 06:05:13,654 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:13,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-11-24 06:05:13,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb033777/59fcde4c004a4636913fe7f457f114c9/FLAG3ce48f85f [2019-11-24 06:05:14,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb033777/59fcde4c004a4636913fe7f457f114c9 [2019-11-24 06:05:14,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:14,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:14,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:14,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:14,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:14,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d9ee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14, skipping insertion in model container [2019-11-24 06:05:14,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:14,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:14,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:14,373 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:14,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:14,525 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:14,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14 WrapperNode [2019-11-24 06:05:14,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:14,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:14,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:14,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:14,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:14,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:14,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:14,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:14,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (1/1) ... [2019-11-24 06:05:14,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:14,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:14,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:14,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:14,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (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 [2019-11-24 06:05:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:14,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:15,905 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:15,906 INFO L284 CfgBuilder]: Removed 80 assume(true) statements. [2019-11-24 06:05:15,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:15 BoogieIcfgContainer [2019-11-24 06:05:15,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:15,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:15,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:15,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:15,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:14" (1/3) ... [2019-11-24 06:05:15,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d92684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:15, skipping insertion in model container [2019-11-24 06:05:15,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:14" (2/3) ... [2019-11-24 06:05:15,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d92684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:15, skipping insertion in model container [2019-11-24 06:05:15,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:15" (3/3) ... [2019-11-24 06:05:15,918 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-11-24 06:05:15,928 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:15,935 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:05:15,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:05:15,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:15,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:15,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:15,968 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:15,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:15,968 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:15,968 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:15,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 06:05:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:05:15,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:15,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:15,990 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -828432178, now seen corresponding path program 1 times [2019-11-24 06:05:16,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:16,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516306998] [2019-11-24 06:05:16,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:16,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516306998] [2019-11-24 06:05:16,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:16,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:16,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63281894] [2019-11-24 06:05:16,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:16,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:16,190 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2019-11-24 06:05:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:16,286 INFO L93 Difference]: Finished difference Result 162 states and 249 transitions. [2019-11-24 06:05:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:16,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:05:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:16,307 INFO L225 Difference]: With dead ends: 162 [2019-11-24 06:05:16,308 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 06:05:16,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 06:05:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-11-24 06:05:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-24 06:05:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2019-11-24 06:05:16,394 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 16 [2019-11-24 06:05:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:16,395 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2019-11-24 06:05:16,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2019-11-24 06:05:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:05:16,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:16,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:16,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2116626707, now seen corresponding path program 1 times [2019-11-24 06:05:16,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:16,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652793132] [2019-11-24 06:05:16,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:16,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652793132] [2019-11-24 06:05:16,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:16,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:16,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087311023] [2019-11-24 06:05:16,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:16,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:16,512 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand 3 states. [2019-11-24 06:05:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:16,583 INFO L93 Difference]: Finished difference Result 270 states and 388 transitions. [2019-11-24 06:05:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:16,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:05:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:16,590 INFO L225 Difference]: With dead ends: 270 [2019-11-24 06:05:16,590 INFO L226 Difference]: Without dead ends: 174 [2019-11-24 06:05:16,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-24 06:05:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2019-11-24 06:05:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-24 06:05:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 226 transitions. [2019-11-24 06:05:16,632 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 226 transitions. Word has length 16 [2019-11-24 06:05:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:16,632 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 226 transitions. [2019-11-24 06:05:16,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 226 transitions. [2019-11-24 06:05:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 06:05:16,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:16,634 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:16,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash 579209000, now seen corresponding path program 1 times [2019-11-24 06:05:16,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:16,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878029991] [2019-11-24 06:05:16,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:16,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878029991] [2019-11-24 06:05:16,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:16,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:16,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751263691] [2019-11-24 06:05:16,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:16,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:16,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:16,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:16,754 INFO L87 Difference]: Start difference. First operand 163 states and 226 transitions. Second operand 4 states. [2019-11-24 06:05:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:16,844 INFO L93 Difference]: Finished difference Result 403 states and 574 transitions. [2019-11-24 06:05:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:16,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-24 06:05:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:16,847 INFO L225 Difference]: With dead ends: 403 [2019-11-24 06:05:16,847 INFO L226 Difference]: Without dead ends: 247 [2019-11-24 06:05:16,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-24 06:05:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 193. [2019-11-24 06:05:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-24 06:05:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2019-11-24 06:05:16,866 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 29 [2019-11-24 06:05:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:16,867 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2019-11-24 06:05:16,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2019-11-24 06:05:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:05:16,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:16,870 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:16,870 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1655854086, now seen corresponding path program 1 times [2019-11-24 06:05:16,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:16,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230538616] [2019-11-24 06:05:16,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:17,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230538616] [2019-11-24 06:05:17,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:17,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:17,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721068169] [2019-11-24 06:05:17,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:17,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:17,034 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 4 states. [2019-11-24 06:05:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:17,087 INFO L93 Difference]: Finished difference Result 308 states and 442 transitions. [2019-11-24 06:05:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:17,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 06:05:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:17,089 INFO L225 Difference]: With dead ends: 308 [2019-11-24 06:05:17,089 INFO L226 Difference]: Without dead ends: 199 [2019-11-24 06:05:17,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-24 06:05:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2019-11-24 06:05:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-24 06:05:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2019-11-24 06:05:17,106 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 42 [2019-11-24 06:05:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:17,106 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2019-11-24 06:05:17,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2019-11-24 06:05:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:05:17,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:17,109 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:17,109 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:17,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1498761499, now seen corresponding path program 1 times [2019-11-24 06:05:17,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:17,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638155137] [2019-11-24 06:05:17,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:17,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638155137] [2019-11-24 06:05:17,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:17,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:17,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336785368] [2019-11-24 06:05:17,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:17,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:17,165 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand 3 states. [2019-11-24 06:05:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:17,204 INFO L93 Difference]: Finished difference Result 313 states and 435 transitions. [2019-11-24 06:05:17,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:17,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 06:05:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:17,207 INFO L225 Difference]: With dead ends: 313 [2019-11-24 06:05:17,207 INFO L226 Difference]: Without dead ends: 204 [2019-11-24 06:05:17,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-24 06:05:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-11-24 06:05:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-24 06:05:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 257 transitions. [2019-11-24 06:05:17,236 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 257 transitions. Word has length 42 [2019-11-24 06:05:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:17,237 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 257 transitions. [2019-11-24 06:05:17,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2019-11-24 06:05:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:05:17,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:17,245 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:17,247 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1403929291, now seen corresponding path program 1 times [2019-11-24 06:05:17,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:17,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932057037] [2019-11-24 06:05:17,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:17,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932057037] [2019-11-24 06:05:17,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738380724] [2019-11-24 06:05:17,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:17,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:05:17,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:17,522 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:17,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:17,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:17,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:17,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-11-24 06:05:17,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455826472] [2019-11-24 06:05:17,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:17,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:17,540 INFO L87 Difference]: Start difference. First operand 193 states and 257 transitions. Second operand 3 states. [2019-11-24 06:05:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:17,590 INFO L93 Difference]: Finished difference Result 454 states and 606 transitions. [2019-11-24 06:05:17,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:17,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 06:05:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:17,592 INFO L225 Difference]: With dead ends: 454 [2019-11-24 06:05:17,592 INFO L226 Difference]: Without dead ends: 268 [2019-11-24 06:05:17,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:05:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-24 06:05:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-11-24 06:05:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-24 06:05:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 347 transitions. [2019-11-24 06:05:17,618 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 347 transitions. Word has length 43 [2019-11-24 06:05:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:17,619 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 347 transitions. [2019-11-24 06:05:17,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 347 transitions. [2019-11-24 06:05:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 06:05:17,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:17,626 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:17,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:17,830 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash 888588432, now seen corresponding path program 1 times [2019-11-24 06:05:17,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:17,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112299543] [2019-11-24 06:05:17,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:17,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112299543] [2019-11-24 06:05:17,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251794508] [2019-11-24 06:05:17,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:17,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 06:05:17,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:18,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:18,035 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:18,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:05:18,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-11-24 06:05:18,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762367614] [2019-11-24 06:05:18,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 06:05:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 06:05:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-24 06:05:18,070 INFO L87 Difference]: Start difference. First operand 266 states and 347 transitions. Second operand 8 states. [2019-11-24 06:05:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,426 INFO L93 Difference]: Finished difference Result 556 states and 743 transitions. [2019-11-24 06:05:18,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-24 06:05:18,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-24 06:05:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,429 INFO L225 Difference]: With dead ends: 556 [2019-11-24 06:05:18,429 INFO L226 Difference]: Without dead ends: 297 [2019-11-24 06:05:18,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-11-24 06:05:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-24 06:05:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 188. [2019-11-24 06:05:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-24 06:05:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2019-11-24 06:05:18,445 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 44 [2019-11-24 06:05:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,446 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2019-11-24 06:05:18,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 06:05:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2019-11-24 06:05:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:05:18,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,449 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 06:05:18,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:18,653 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash -46455675, now seen corresponding path program 1 times [2019-11-24 06:05:18,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601056794] [2019-11-24 06:05:18,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:18,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601056794] [2019-11-24 06:05:18,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:18,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437324521] [2019-11-24 06:05:18,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:18,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:18,694 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand 4 states. [2019-11-24 06:05:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,770 INFO L93 Difference]: Finished difference Result 449 states and 592 transitions. [2019-11-24 06:05:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:18,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-24 06:05:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,772 INFO L225 Difference]: With dead ends: 449 [2019-11-24 06:05:18,772 INFO L226 Difference]: Without dead ends: 280 [2019-11-24 06:05:18,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-24 06:05:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 192. [2019-11-24 06:05:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-24 06:05:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2019-11-24 06:05:18,787 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 46 [2019-11-24 06:05:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,787 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2019-11-24 06:05:18,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2019-11-24 06:05:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:05:18,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,789 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:18,789 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1930154037, now seen corresponding path program 1 times [2019-11-24 06:05:18,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672344176] [2019-11-24 06:05:18,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:18,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672344176] [2019-11-24 06:05:18,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:18,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194295401] [2019-11-24 06:05:18,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:18,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:18,840 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand 3 states. [2019-11-24 06:05:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,870 INFO L93 Difference]: Finished difference Result 350 states and 463 transitions. [2019-11-24 06:05:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:18,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-24 06:05:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,873 INFO L225 Difference]: With dead ends: 350 [2019-11-24 06:05:18,874 INFO L226 Difference]: Without dead ends: 193 [2019-11-24 06:05:18,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-24 06:05:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2019-11-24 06:05:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-24 06:05:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2019-11-24 06:05:18,890 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 46 [2019-11-24 06:05:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:18,890 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2019-11-24 06:05:18,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2019-11-24 06:05:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 06:05:18,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:18,891 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:18,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1294389580, now seen corresponding path program 1 times [2019-11-24 06:05:18,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:18,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276660814] [2019-11-24 06:05:18,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:18,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276660814] [2019-11-24 06:05:18,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:18,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:18,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714115477] [2019-11-24 06:05:18,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:18,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:18,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:18,955 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand 4 states. [2019-11-24 06:05:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:18,992 INFO L93 Difference]: Finished difference Result 341 states and 422 transitions. [2019-11-24 06:05:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:18,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-24 06:05:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:18,995 INFO L225 Difference]: With dead ends: 341 [2019-11-24 06:05:18,995 INFO L226 Difference]: Without dead ends: 190 [2019-11-24 06:05:18,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-24 06:05:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-11-24 06:05:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-24 06:05:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 225 transitions. [2019-11-24 06:05:19,008 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 225 transitions. Word has length 46 [2019-11-24 06:05:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,008 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 225 transitions. [2019-11-24 06:05:19,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 225 transitions. [2019-11-24 06:05:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 06:05:19,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,009 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:19,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1476432462, now seen corresponding path program 1 times [2019-11-24 06:05:19,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155372624] [2019-11-24 06:05:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:05:19,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155372624] [2019-11-24 06:05:19,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737717003] [2019-11-24 06:05:19,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 06:05:19,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:19,227 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:19,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:05:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:19,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:05:19,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2019-11-24 06:05:19,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671636781] [2019-11-24 06:05:19,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:05:19,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:05:19,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:19,270 INFO L87 Difference]: Start difference. First operand 188 states and 225 transitions. Second operand 6 states. [2019-11-24 06:05:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,380 INFO L93 Difference]: Finished difference Result 438 states and 524 transitions. [2019-11-24 06:05:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:05:19,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-24 06:05:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,382 INFO L225 Difference]: With dead ends: 438 [2019-11-24 06:05:19,382 INFO L226 Difference]: Without dead ends: 222 [2019-11-24 06:05:19,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:05:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-24 06:05:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2019-11-24 06:05:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 06:05:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2019-11-24 06:05:19,397 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 47 [2019-11-24 06:05:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,399 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2019-11-24 06:05:19,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:05:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2019-11-24 06:05:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 06:05:19,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,400 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-24 06:05:19,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:19,604 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1866451240, now seen corresponding path program 1 times [2019-11-24 06:05:19,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274368788] [2019-11-24 06:05:19,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:19,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274368788] [2019-11-24 06:05:19,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:19,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:19,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918896734] [2019-11-24 06:05:19,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:19,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:19,732 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand 4 states. [2019-11-24 06:05:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:19,772 INFO L93 Difference]: Finished difference Result 430 states and 500 transitions. [2019-11-24 06:05:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:19,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-24 06:05:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:19,775 INFO L225 Difference]: With dead ends: 430 [2019-11-24 06:05:19,775 INFO L226 Difference]: Without dead ends: 428 [2019-11-24 06:05:19,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-24 06:05:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 290. [2019-11-24 06:05:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-24 06:05:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 338 transitions. [2019-11-24 06:05:19,805 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 338 transitions. Word has length 48 [2019-11-24 06:05:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:19,805 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 338 transitions. [2019-11-24 06:05:19,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 338 transitions. [2019-11-24 06:05:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-24 06:05:19,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:19,807 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 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] [2019-11-24 06:05:19,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash -668107358, now seen corresponding path program 1 times [2019-11-24 06:05:19,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:19,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489268582] [2019-11-24 06:05:19,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 06:05:19,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489268582] [2019-11-24 06:05:19,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:19,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:19,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381714434] [2019-11-24 06:05:19,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:19,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:19,916 INFO L87 Difference]: Start difference. First operand 290 states and 338 transitions. Second operand 4 states. [2019-11-24 06:05:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:20,013 INFO L93 Difference]: Finished difference Result 476 states and 552 transitions. [2019-11-24 06:05:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:20,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-24 06:05:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:20,014 INFO L225 Difference]: With dead ends: 476 [2019-11-24 06:05:20,014 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 06:05:20,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 06:05:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 06:05:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 06:05:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 06:05:20,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-24 06:05:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:20,017 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 06:05:20,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 06:05:20,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 06:05:20,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 06:05:20,413 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 114 [2019-11-24 06:05:20,712 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-24 06:05:20,820 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2019-11-24 06:05:21,020 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-11-24 06:05:21,202 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-24 06:05:21,314 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-11-24 06:05:21,714 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-24 06:05:22,356 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 49 [2019-11-24 06:05:23,439 WARN L192 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 58 [2019-11-24 06:05:23,926 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-24 06:05:24,055 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-11-24 06:05:24,124 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-24 06:05:24,124 INFO L440 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (and (<= 2 ~E_M~0) (= ~m_pc~0 1) (= 1 ~t1_pc~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= ~token~0 (+ ~local~0 1)) (not (= 0 ~t1_st~0)) (< ~local~0 ~token~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~E_1~0) (not (= ~m_st~0 0))) [2019-11-24 06:05:24,124 INFO L444 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-11-24 06:05:24,125 INFO L444 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-11-24 06:05:24,125 INFO L440 ceAbstractionStarter]: At program point L437(lines 437 446) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse2 (not (= 0 ~t1_st~0))) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse8))) [2019-11-24 06:05:24,126 INFO L440 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse2 (not (= 0 ~t1_st~0))) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse8))) [2019-11-24 06:05:24,126 INFO L440 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (not (= 0 ~t1_st~0))) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse5 .cse7 (<= ~local~0 ~token~0)))) [2019-11-24 06:05:24,126 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-24 06:05:24,126 INFO L440 ceAbstractionStarter]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse4 (= 0 ~t1_st~0))) (let ((.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse2 (= 0 ~t1_pc~0)) (.cse12 (not .cse4)) (.cse3 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse11 (= ~m_pc~0 1)) (.cse9 (= 1 ~t1_pc~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (not (= ~m_st~0 0))) (.cse8 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse8) (and .cse0 .cse9 .cse10 .cse3 .cse5 .cse6) (and .cse0 .cse11 .cse9 .cse10 .cse12 .cse13 .cse5 .cse6) (and .cse0 .cse11 .cse9 .cse10 (<= ~token~0 (+ ~local~0 1)) .cse12 (< ~local~0 ~token~0) .cse13 .cse5) (and .cse0 .cse11 .cse1 .cse2 .cse7 (<= 2 ~m_st~0) .cse4 .cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8) (and .cse0 .cse9 .cse10 .cse12 .cse3 .cse5) (and .cse0 .cse11 .cse9 .cse10 .cse7 .cse5 .cse6 .cse8)))) [2019-11-24 06:05:24,127 INFO L440 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (and (<= 2 ~E_M~0) (= 0 ~t1_pc~0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-11-24 06:05:24,127 INFO L440 ceAbstractionStarter]: At program point L144-1(lines 132 146) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse1 (= 0 ~t1_st~0)) (.cse3 (not (= ~m_st~0 0))) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= ~local~0 ~token~0))) (or (and .cse0 (= 1 ~t1_pc~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (not .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_eval_~tmp~0 1) (= 0 ~t1_pc~0) .cse2 .cse1 .cse3 .cse4 .cse5))) [2019-11-24 06:05:24,127 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-11-24 06:05:24,127 INFO L440 ceAbstractionStarter]: At program point L144-2(lines 132 146) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not (= 0 ~t1_st~0))) (.cse5 (<= 2 ~E_1~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse5 .cse6 .cse7))) [2019-11-24 06:05:24,127 INFO L440 ceAbstractionStarter]: At program point L144-3(lines 132 146) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse2 (not (= 0 ~t1_st~0))) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse8))) [2019-11-24 06:05:24,128 INFO L440 ceAbstractionStarter]: At program point L144-4(lines 132 146) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse2 (not (= 0 ~t1_st~0))) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse8))) [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,128 INFO L440 ceAbstractionStarter]: At program point L81(lines 81 85) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not (= 0 ~t1_st~0))) (.cse4 (<= 2 ~E_1~0))) (or (and .cse0 (= ~m_pc~0 1) .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4 (not (= ~m_st~0 0))))) [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,128 INFO L444 ceAbstractionStarter]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-11-24 06:05:24,129 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 06:05:24,129 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-11-24 06:05:24,130 INFO L440 ceAbstractionStarter]: At program point L418-1(lines 273 455) the Hoare annotation is: (let ((.cse7 (= 0 ~t1_st~0))) (let ((.cse6 (= ~m_pc~0 1)) (.cse2 (not .cse7)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 (= 0 ~t1_pc~0) .cse3 (<= ~token~0 ~local~0) .cse7 .cse5 (<= ~local~0 ~token~0)) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse8 .cse9)))) [2019-11-24 06:05:24,130 INFO L440 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= ~m_pc~0 1)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not (= 0 ~t1_st~0))) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (<= 2 ~E_1~0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 (<= ~local~0 ~token~0)) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse1 (= 1 ~t1_pc~0) .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 (< ~local~0 ~token~0) .cse8 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6))) [2019-11-24 06:05:24,130 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 06:05:24,130 INFO L440 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse8 (= 0 ~t1_st~0))) (let ((.cse10 (<= 2 ~t1_st~0)) (.cse6 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t1_pc~0)) (.cse15 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (not .cse8)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse9 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse8 .cse5 .cse9) (and .cse0 .cse1 .cse3 .cse10 .cse5) (and .cse0 .cse11 .cse1 .cse12 .cse10 .cse5 .cse13 .cse9 .cse14) (and .cse0 .cse11 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse7 .cse12 .cse3 .cse8 .cse5 .cse13) (and .cse0 .cse1 .cse15 .cse3 .cse5 .cse9) (and .cse0 .cse11 .cse1 .cse15 .cse2 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse6 .cse7 .cse12 (<= 2 ~m_st~0) .cse8 .cse5 .cse14 .cse13) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse5) (and .cse0 .cse11 .cse1 .cse15 .cse12 .cse5 .cse13 .cse9) (and .cse0 .cse11 .cse1 .cse2 .cse4 .cse5 .cse9 .cse14) (and .cse0 .cse1 .cse3 .cse5 .cse9 .cse14)))) [2019-11-24 06:05:24,130 INFO L440 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (and (<= 2 ~E_M~0) (= 0 ~t1_pc~0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-11-24 06:05:24,130 INFO L440 ceAbstractionStarter]: At program point L125-1(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse1 (= 0 ~t1_st~0)) (.cse3 (not (= ~m_st~0 0))) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= ~local~0 ~token~0))) (or (and .cse0 (= 1 ~t1_pc~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (not .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_eval_~tmp~0 1) (= 0 ~t1_pc~0) .cse2 .cse1 .cse3 .cse4 .cse5))) [2019-11-24 06:05:24,130 INFO L440 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse7 (= 0 ~t1_st~0))) (let ((.cse1 (= 1 ~t1_pc~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not .cse7)) (.cse0 (<= 2 ~E_M~0)) (.cse6 (= ~m_pc~0 0)) (.cse4 (<= 2 ~E_1~0)) (.cse5 (not (= ~m_st~0 0)))) (or (and .cse0 (= ~m_pc~0 1) .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 (< ~local~0 ~token~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_eval_~tmp~0 1) (= 0 ~t1_pc~0) .cse6 (<= ~token~0 ~local~0) .cse7 .cse4 .cse5 (<= ~local~0 ~token~0))))) [2019-11-24 06:05:24,131 INFO L440 ceAbstractionStarter]: At program point L125-2(lines 113 127) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not (= 0 ~t1_st~0))) (.cse5 (not (= ~m_st~0 0))) (.cse4 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 (< ~local~0 ~token~0) (or (= ~E_M~0 1) .cse5) .cse4))) [2019-11-24 06:05:24,131 INFO L440 ceAbstractionStarter]: At program point L125-3(lines 113 127) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse3 (not (= 0 ~t1_st~0))) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse6 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse5 .cse7 .cse8 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse6 .cse5 .cse7 .cse8))) [2019-11-24 06:05:24,131 INFO L440 ceAbstractionStarter]: At program point L125-4(lines 113 127) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse2 (not (= 0 ~t1_st~0))) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse8))) [2019-11-24 06:05:24,131 INFO L447 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: true [2019-11-24 06:05:24,131 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-11-24 06:05:24,131 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-24 06:05:24,131 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,131 INFO L444 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,131 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-24 06:05:24,131 INFO L444 ceAbstractionStarter]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-11-24 06:05:24,132 INFO L444 ceAbstractionStarter]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-11-24 06:05:24,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:05:24 BoogieIcfgContainer [2019-11-24 06:05:24,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:05:24,181 INFO L168 Benchmark]: Toolchain (without parser) took 10107.71 ms. Allocated memory was 144.2 MB in the beginning and 324.0 MB in the end (delta: 179.8 MB). Free memory was 101.9 MB in the beginning and 146.8 MB in the end (delta: -44.9 MB). Peak memory consumption was 192.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,182 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.34 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 179.2 MB in the end (delta: -77.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.87 ms. Allocated memory is still 201.3 MB. Free memory was 179.2 MB in the beginning and 176.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,185 INFO L168 Benchmark]: Boogie Preprocessor took 56.37 ms. Allocated memory is still 201.3 MB. Free memory was 176.3 MB in the beginning and 173.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,185 INFO L168 Benchmark]: RCFGBuilder took 1274.16 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 173.8 MB in the beginning and 199.0 MB in the end (delta: -25.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,186 INFO L168 Benchmark]: TraceAbstraction took 8271.14 ms. Allocated memory was 232.3 MB in the beginning and 324.0 MB in the end (delta: 91.8 MB). Free memory was 197.5 MB in the beginning and 146.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 199.7 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:24,190 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 451.34 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 179.2 MB in the end (delta: -77.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.87 ms. Allocated memory is still 201.3 MB. Free memory was 179.2 MB in the beginning and 176.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.37 ms. Allocated memory is still 201.3 MB. Free memory was 176.3 MB in the beginning and 173.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1274.16 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 173.8 MB in the beginning and 199.0 MB in the end (delta: -25.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8271.14 ms. Allocated memory was 232.3 MB in the beginning and 324.0 MB in the end (delta: 91.8 MB). Free memory was 197.5 MB in the beginning and 146.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 199.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1) || ((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1)) || ((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0))) || ((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0))) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && token <= local) && 2 <= E_1) && !(m_st == 0)) && local <= token) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && token <= local) && !(m_st == 0)) && __retres1 == 0) && local <= token) || (((((((2 <= E_M && tmp == 1) && 0 == t1_pc) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1) || ((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1)) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && token <= local) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((2 <= E_M && 0 == t1_pc) && m_pc == 0) && token <= local) && 0 == t1_st) && 2 <= E_1) && local <= token - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) || ((((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0))) || ((((((((2 <= E_M && tmp == 1) && 0 == t1_pc) && m_pc == 0) && token <= local) && 0 == t1_st) && 2 <= E_1) && !(m_st == 0)) && local <= token) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((m_pc == 1 && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) || ((((((1 == t1_pc && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((((m_pc == 1 && 1 == t1_pc) && !(tmp == 0)) && token <= local + 1) && !(0 == t1_st)) && local < token) && (E_M == 1 || !(m_st == 0))) && 2 <= E_1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0) - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && token <= local) && 2 <= E_1) && local <= token) || ((((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && token <= local) && !(m_st == 0)) && __retres1 == 0) && local <= token) || (((((((2 <= E_M && tmp == 1) && 0 == t1_pc) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((2 <= E_M && tmp == 1) && 0 == t1_pc) && m_pc == 0) && 0 == t1_st) && 2 <= E_1) && !(m_st == 0)) || (((((((2 <= E_M && tmp == 1) && 0 == t1_pc) && m_pc == 0) && token <= local) && 0 == t1_st) && 2 <= E_1) && local <= token)) || (((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0))) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0))) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((((((2 <= E_M && m_pc == 1) && tmp == 1) && 0 == t1_pc) && token <= local) && 2 <= m_st) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && token <= local) && 2 <= E_1) && !(m_st == 0)) && local <= token) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || ((((((2 <= E_M && 0 == t1_pc) && m_pc == 0) && token <= local) && 0 == t1_st) && 2 <= E_1) && local <= token)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((2 <= E_M && 0 == t1_pc) && m_pc == 0) && token <= local) && 0 == t1_st) && 2 <= E_1) && local <= token - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || ((((((2 <= E_M && tmp == 1) && 0 == t1_pc) && m_pc == 0) && 0 == t1_st) && 2 <= E_1) && !(m_st == 0))) || ((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= t1_st) && 2 <= E_1)) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local) && 2 <= t1_st) && 2 <= E_1) && local <= token) && !(m_st == 0)) && __retres1 == 0)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || ((((((2 <= E_M && 0 == t1_pc) && token <= local) && m_pc == 0) && 0 == t1_st) && 2 <= E_1) && local <= token)) || (((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0))) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0))) || (((((((((2 <= E_M && m_pc == 1) && tmp == 1) && 0 == t1_pc) && token <= local) && 2 <= m_st) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((2 <= E_M && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && token <= local) && 2 <= E_1) && local <= token) && !(m_st == 0))) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && m_pc == 1) && !(tmp == 0)) && !(0 == t1_st)) && token <= local) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((2 <= E_M && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1)) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(tmp == 0)) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((2 <= E_M && !(tmp == 0)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((((2 <= E_M && m_pc == 1) && !(tmp == 0)) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((m_pc == 1 && 1 == t1_pc) && !(tmp == 0)) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1) || (((((((m_pc == 1 && 1 == t1_pc) && !(tmp == 0)) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || ((((((1 == t1_pc && !(tmp == 0)) && !(0 == t1_st)) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && 1 == t1_pc) && !(0 == t1_st)) && m_pc == 0) && __retres1 == 0) && 2 <= E_1) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && token <= local + 1) && !(0 == t1_st)) && local < token) && __retres1 == 0) && 2 <= E_1)) || (((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && !(0 == t1_st)) && __retres1 == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0)) || (((((2 <= E_M && 1 == t1_pc) && m_pc == 0) && 2 <= E_1) && !(m_st == 0)) && __retres1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 1 error locations. Result: SAFE, OverallTime: 8.1s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 1220 SDtfs, 1051 SDslu, 1242 SDs, 0 SdLazy, 394 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 286 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 452 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 149 NumberOfFragments, 1993 HoareAnnotationTreeSize, 22 FomulaSimplifications, 7589 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 6266 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 677 NumberOfCodeBlocks, 677 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 80541 SizeOfPredicates, 15 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 209/218 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...