/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/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:06:07,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:06:07,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:06:07,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:06:07,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:06:07,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:06:07,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:06:07,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:06:07,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:06:07,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:06:07,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:06:07,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:06:07,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:06:07,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:06:07,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:06:07,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:06:07,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:06:07,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:06:07,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:06:07,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:06:07,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:06:07,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:06:07,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:06:07,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:06:07,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:06:07,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:06:07,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:06:07,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:06:07,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:06:07,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:06:07,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:06:07,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:06:07,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:06:07,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:06:07,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:06:07,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:06:07,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:06:07,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:06:07,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:06:07,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:06:07,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:06:07,614 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:06:07,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:06:07,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:06:07,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:06:07,630 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:06:07,630 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:06:07,630 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:06:07,630 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:06:07,631 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:06:07,631 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:06:07,631 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:06:07,631 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:06:07,631 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:06:07,632 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:06:07,632 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:06:07,632 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:06:07,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:06:07,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:06:07,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:06:07,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:06:07,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:06:07,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:06:07,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:06:07,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:06:07,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:06:07,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:06:07,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:06:07,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:06:07,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:06:07,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:06:07,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:06:07,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:06:07,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:06:07,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:06:07,636 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:06:07,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:06:07,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:06:07,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:06:07,637 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:06:07,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:06:07,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:06:07,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:06:07,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:06:07,995 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:06:07,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-11-24 06:06:08,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629c82f17/83ec8b6a00d74aa0ba1d834023a8806d/FLAG4d7af6478 [2019-11-24 06:06:08,550 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:06:08,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-11-24 06:06:08,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629c82f17/83ec8b6a00d74aa0ba1d834023a8806d/FLAG4d7af6478 [2019-11-24 06:06:08,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629c82f17/83ec8b6a00d74aa0ba1d834023a8806d [2019-11-24 06:06:08,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:06:08,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:06:08,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:08,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:06:08,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:06:08,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:08" (1/1) ... [2019-11-24 06:06:08,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55219956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:08, skipping insertion in model container [2019-11-24 06:06:08,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:08" (1/1) ... [2019-11-24 06:06:08,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:06:09,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:06:09,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:09,261 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:06:09,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:09,409 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:06:09,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09 WrapperNode [2019-11-24 06:06:09,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:09,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:09,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:06:09,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:06:09,419 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:06:09" (1/1) ... [2019-11-24 06:06:09,428 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:06:09" (1/1) ... [2019-11-24 06:06:09,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:09,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:06:09,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:06:09,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:06:09,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (1/1) ... [2019-11-24 06:06:09,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:06:09,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:06:09,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:06:09,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:06:09,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (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:06:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:06:09,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:06:11,585 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:06:11,585 INFO L284 CfgBuilder]: Removed 119 assume(true) statements. [2019-11-24 06:06:11,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:11 BoogieIcfgContainer [2019-11-24 06:06:11,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:06:11,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:06:11,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:06:11,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:06:11,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:06:08" (1/3) ... [2019-11-24 06:06:11,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7c3d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:11, skipping insertion in model container [2019-11-24 06:06:11,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:09" (2/3) ... [2019-11-24 06:06:11,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7c3d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:11, skipping insertion in model container [2019-11-24 06:06:11,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:11" (3/3) ... [2019-11-24 06:06:11,596 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-11-24 06:06:11,607 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:06:11,615 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:06:11,629 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:06:11,657 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:06:11,657 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:06:11,657 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:06:11,658 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:06:11,658 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:06:11,659 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:06:11,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:06:11,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:06:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-24 06:06:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 06:06:11,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:11,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:11,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash 364239594, now seen corresponding path program 1 times [2019-11-24 06:06:11,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:11,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958906202] [2019-11-24 06:06:11,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:11,912 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:06:11,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958906202] [2019-11-24 06:06:11,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:11,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:11,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403005341] [2019-11-24 06:06:11,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:11,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:11,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:11,944 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2019-11-24 06:06:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:12,080 INFO L93 Difference]: Finished difference Result 343 states and 529 transitions. [2019-11-24 06:06:12,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:12,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 06:06:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:12,100 INFO L225 Difference]: With dead ends: 343 [2019-11-24 06:06:12,100 INFO L226 Difference]: Without dead ends: 216 [2019-11-24 06:06:12,104 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:06:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-24 06:06:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2019-11-24 06:06:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-24 06:06:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-11-24 06:06:12,199 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2019-11-24 06:06:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:12,200 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-11-24 06:06:12,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-11-24 06:06:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 06:06:12,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:12,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:12,204 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1025573385, now seen corresponding path program 1 times [2019-11-24 06:06:12,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:12,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474500553] [2019-11-24 06:06:12,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:12,284 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:06:12,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474500553] [2019-11-24 06:06:12,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:12,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:12,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007824287] [2019-11-24 06:06:12,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:12,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:12,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:12,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:12,290 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 3 states. [2019-11-24 06:06:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:12,365 INFO L93 Difference]: Finished difference Result 598 states and 890 transitions. [2019-11-24 06:06:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:12,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 06:06:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:12,369 INFO L225 Difference]: With dead ends: 598 [2019-11-24 06:06:12,369 INFO L226 Difference]: Without dead ends: 398 [2019-11-24 06:06:12,371 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:06:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-11-24 06:06:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2019-11-24 06:06:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-24 06:06:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2019-11-24 06:06:12,407 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 24 [2019-11-24 06:06:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:12,407 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2019-11-24 06:06:12,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2019-11-24 06:06:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 06:06:12,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:12,410 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:12,411 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 874733872, now seen corresponding path program 1 times [2019-11-24 06:06:12,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:12,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648820061] [2019-11-24 06:06:12,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:12,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648820061] [2019-11-24 06:06:12,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:12,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:12,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711138176] [2019-11-24 06:06:12,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:12,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:12,529 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand 4 states. [2019-11-24 06:06:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:12,692 INFO L93 Difference]: Finished difference Result 1214 states and 1789 transitions. [2019-11-24 06:06:12,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:12,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 06:06:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:12,701 INFO L225 Difference]: With dead ends: 1214 [2019-11-24 06:06:12,703 INFO L226 Difference]: Without dead ends: 833 [2019-11-24 06:06:12,707 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:06:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-11-24 06:06:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 466. [2019-11-24 06:06:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-24 06:06:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 697 transitions. [2019-11-24 06:06:12,758 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 697 transitions. Word has length 33 [2019-11-24 06:06:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:12,759 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 697 transitions. [2019-11-24 06:06:12,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2019-11-24 06:06:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 06:06:12,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:12,770 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:12,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -741539991, now seen corresponding path program 1 times [2019-11-24 06:06:12,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:12,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960738069] [2019-11-24 06:06:12,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:12,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960738069] [2019-11-24 06:06:12,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:12,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:12,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352805049] [2019-11-24 06:06:12,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:12,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:12,892 INFO L87 Difference]: Start difference. First operand 466 states and 697 transitions. Second operand 3 states. [2019-11-24 06:06:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:12,960 INFO L93 Difference]: Finished difference Result 1169 states and 1768 transitions. [2019-11-24 06:06:12,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:12,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 06:06:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:12,965 INFO L225 Difference]: With dead ends: 1169 [2019-11-24 06:06:12,965 INFO L226 Difference]: Without dead ends: 718 [2019-11-24 06:06:12,967 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:06:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-24 06:06:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 588. [2019-11-24 06:06:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-11-24 06:06:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 901 transitions. [2019-11-24 06:06:12,992 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 901 transitions. Word has length 49 [2019-11-24 06:06:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:12,993 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 901 transitions. [2019-11-24 06:06:12,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 901 transitions. [2019-11-24 06:06:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 06:06:12,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:12,995 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:12,995 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -810806936, now seen corresponding path program 1 times [2019-11-24 06:06:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:12,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146798405] [2019-11-24 06:06:12,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:13,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146798405] [2019-11-24 06:06:13,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:13,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:13,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833520064] [2019-11-24 06:06:13,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:13,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:13,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:13,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:13,061 INFO L87 Difference]: Start difference. First operand 588 states and 901 transitions. Second operand 3 states. [2019-11-24 06:06:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:13,135 INFO L93 Difference]: Finished difference Result 1423 states and 2212 transitions. [2019-11-24 06:06:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:13,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 06:06:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:13,141 INFO L225 Difference]: With dead ends: 1423 [2019-11-24 06:06:13,143 INFO L226 Difference]: Without dead ends: 850 [2019-11-24 06:06:13,144 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:06:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-11-24 06:06:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 800. [2019-11-24 06:06:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-11-24 06:06:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1245 transitions. [2019-11-24 06:06:13,184 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1245 transitions. Word has length 49 [2019-11-24 06:06:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1245 transitions. [2019-11-24 06:06:13,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1245 transitions. [2019-11-24 06:06:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:06:13,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:13,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:13,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1136337243, now seen corresponding path program 1 times [2019-11-24 06:06:13,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:13,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864066527] [2019-11-24 06:06:13,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:06:13,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864066527] [2019-11-24 06:06:13,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:13,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:13,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558617698] [2019-11-24 06:06:13,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:13,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:13,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:13,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:13,265 INFO L87 Difference]: Start difference. First operand 800 states and 1245 transitions. Second operand 3 states. [2019-11-24 06:06:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:13,388 INFO L93 Difference]: Finished difference Result 2285 states and 3558 transitions. [2019-11-24 06:06:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:13,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:06:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:13,399 INFO L225 Difference]: With dead ends: 2285 [2019-11-24 06:06:13,399 INFO L226 Difference]: Without dead ends: 1494 [2019-11-24 06:06:13,401 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:06:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-24 06:06:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1476. [2019-11-24 06:06:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-11-24 06:06:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2277 transitions. [2019-11-24 06:06:13,472 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2277 transitions. Word has length 50 [2019-11-24 06:06:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:13,473 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 2277 transitions. [2019-11-24 06:06:13,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2277 transitions. [2019-11-24 06:06:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:06:13,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:13,478 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:13,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash -670741872, now seen corresponding path program 1 times [2019-11-24 06:06:13,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:13,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204255350] [2019-11-24 06:06:13,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:13,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204255350] [2019-11-24 06:06:13,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:13,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:13,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875860817] [2019-11-24 06:06:13,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:13,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:13,595 INFO L87 Difference]: Start difference. First operand 1476 states and 2277 transitions. Second operand 4 states. [2019-11-24 06:06:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:13,803 INFO L93 Difference]: Finished difference Result 5637 states and 8731 transitions. [2019-11-24 06:06:13,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:13,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 06:06:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:13,825 INFO L225 Difference]: With dead ends: 5637 [2019-11-24 06:06:13,825 INFO L226 Difference]: Without dead ends: 4163 [2019-11-24 06:06:13,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:06:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2019-11-24 06:06:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 2699. [2019-11-24 06:06:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-11-24 06:06:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4138 transitions. [2019-11-24 06:06:13,999 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4138 transitions. Word has length 50 [2019-11-24 06:06:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:13,999 INFO L462 AbstractCegarLoop]: Abstraction has 2699 states and 4138 transitions. [2019-11-24 06:06:13,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4138 transitions. [2019-11-24 06:06:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:06:14,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:14,003 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:14,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:14,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:14,004 INFO L82 PathProgramCache]: Analyzing trace with hash -9408081, now seen corresponding path program 1 times [2019-11-24 06:06:14,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:14,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369577573] [2019-11-24 06:06:14,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:14,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369577573] [2019-11-24 06:06:14,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:14,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:14,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496369347] [2019-11-24 06:06:14,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:14,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:14,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:14,053 INFO L87 Difference]: Start difference. First operand 2699 states and 4138 transitions. Second operand 3 states. [2019-11-24 06:06:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:14,196 INFO L93 Difference]: Finished difference Result 4073 states and 6275 transitions. [2019-11-24 06:06:14,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:14,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:06:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:14,211 INFO L225 Difference]: With dead ends: 4073 [2019-11-24 06:06:14,211 INFO L226 Difference]: Without dead ends: 2699 [2019-11-24 06:06:14,214 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:06:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2019-11-24 06:06:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2699. [2019-11-24 06:06:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-11-24 06:06:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4114 transitions. [2019-11-24 06:06:14,359 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4114 transitions. Word has length 50 [2019-11-24 06:06:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:14,360 INFO L462 AbstractCegarLoop]: Abstraction has 2699 states and 4114 transitions. [2019-11-24 06:06:14,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4114 transitions. [2019-11-24 06:06:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:06:14,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:14,364 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:14,364 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -882246736, now seen corresponding path program 1 times [2019-11-24 06:06:14,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:14,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104682591] [2019-11-24 06:06:14,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:14,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104682591] [2019-11-24 06:06:14,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:14,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:14,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194196635] [2019-11-24 06:06:14,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:14,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:14,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:14,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:14,408 INFO L87 Difference]: Start difference. First operand 2699 states and 4114 transitions. Second operand 3 states. [2019-11-24 06:06:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:14,576 INFO L93 Difference]: Finished difference Result 4073 states and 6227 transitions. [2019-11-24 06:06:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:14,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 06:06:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:14,592 INFO L225 Difference]: With dead ends: 4073 [2019-11-24 06:06:14,592 INFO L226 Difference]: Without dead ends: 2699 [2019-11-24 06:06:14,596 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:06:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2019-11-24 06:06:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2637. [2019-11-24 06:06:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-11-24 06:06:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3960 transitions. [2019-11-24 06:06:14,807 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3960 transitions. Word has length 50 [2019-11-24 06:06:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:14,808 INFO L462 AbstractCegarLoop]: Abstraction has 2637 states and 3960 transitions. [2019-11-24 06:06:14,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3960 transitions. [2019-11-24 06:06:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 06:06:14,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:14,817 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:14,818 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash -79786412, now seen corresponding path program 1 times [2019-11-24 06:06:14,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:14,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099067063] [2019-11-24 06:06:14,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:14,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099067063] [2019-11-24 06:06:14,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:14,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253240336] [2019-11-24 06:06:14,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:14,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:14,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:14,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:14,933 INFO L87 Difference]: Start difference. First operand 2637 states and 3960 transitions. Second operand 4 states. [2019-11-24 06:06:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:15,358 INFO L93 Difference]: Finished difference Result 7431 states and 11059 transitions. [2019-11-24 06:06:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:15,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-24 06:06:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:15,383 INFO L225 Difference]: With dead ends: 7431 [2019-11-24 06:06:15,383 INFO L226 Difference]: Without dead ends: 3147 [2019-11-24 06:06:15,392 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:06:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2019-11-24 06:06:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2307. [2019-11-24 06:06:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-24 06:06:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3288 transitions. [2019-11-24 06:06:15,671 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3288 transitions. Word has length 51 [2019-11-24 06:06:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:15,672 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3288 transitions. [2019-11-24 06:06:15,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3288 transitions. [2019-11-24 06:06:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:06:15,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:15,677 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:15,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash -100302702, now seen corresponding path program 1 times [2019-11-24 06:06:15,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:15,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742944590] [2019-11-24 06:06:15,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:15,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742944590] [2019-11-24 06:06:15,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:15,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:15,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436289766] [2019-11-24 06:06:15,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:15,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:15,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:15,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:15,720 INFO L87 Difference]: Start difference. First operand 2307 states and 3288 transitions. Second operand 3 states. [2019-11-24 06:06:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:15,863 INFO L93 Difference]: Finished difference Result 4615 states and 6576 transitions. [2019-11-24 06:06:15,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:15,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-24 06:06:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:15,876 INFO L225 Difference]: With dead ends: 4615 [2019-11-24 06:06:15,876 INFO L226 Difference]: Without dead ends: 2321 [2019-11-24 06:06:15,880 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:06:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-11-24 06:06:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2307. [2019-11-24 06:06:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-24 06:06:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3217 transitions. [2019-11-24 06:06:16,000 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3217 transitions. Word has length 70 [2019-11-24 06:06:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:16,000 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3217 transitions. [2019-11-24 06:06:16,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3217 transitions. [2019-11-24 06:06:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:06:16,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:16,005 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:16,005 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1240654413, now seen corresponding path program 1 times [2019-11-24 06:06:16,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:16,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046947433] [2019-11-24 06:06:16,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:16,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046947433] [2019-11-24 06:06:16,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:16,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:16,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362479688] [2019-11-24 06:06:16,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:16,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:16,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:16,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:16,048 INFO L87 Difference]: Start difference. First operand 2307 states and 3217 transitions. Second operand 3 states. [2019-11-24 06:06:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:16,190 INFO L93 Difference]: Finished difference Result 3789 states and 5319 transitions. [2019-11-24 06:06:16,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:16,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-24 06:06:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:16,202 INFO L225 Difference]: With dead ends: 3789 [2019-11-24 06:06:16,203 INFO L226 Difference]: Without dead ends: 2311 [2019-11-24 06:06:16,205 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:06:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2019-11-24 06:06:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2279. [2019-11-24 06:06:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-11-24 06:06:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3093 transitions. [2019-11-24 06:06:16,326 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3093 transitions. Word has length 70 [2019-11-24 06:06:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:16,327 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3093 transitions. [2019-11-24 06:06:16,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3093 transitions. [2019-11-24 06:06:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 06:06:16,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:16,333 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:16,333 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash 47540116, now seen corresponding path program 1 times [2019-11-24 06:06:16,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:16,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453990138] [2019-11-24 06:06:16,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:16,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453990138] [2019-11-24 06:06:16,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:16,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:16,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141662159] [2019-11-24 06:06:16,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:16,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:16,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:16,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:16,452 INFO L87 Difference]: Start difference. First operand 2279 states and 3093 transitions. Second operand 3 states. [2019-11-24 06:06:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:16,637 INFO L93 Difference]: Finished difference Result 3721 states and 5059 transitions. [2019-11-24 06:06:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:16,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-24 06:06:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:16,653 INFO L225 Difference]: With dead ends: 3721 [2019-11-24 06:06:16,653 INFO L226 Difference]: Without dead ends: 2279 [2019-11-24 06:06:16,657 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:06:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-11-24 06:06:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2279. [2019-11-24 06:06:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-11-24 06:06:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3051 transitions. [2019-11-24 06:06:16,820 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3051 transitions. Word has length 70 [2019-11-24 06:06:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:16,821 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3051 transitions. [2019-11-24 06:06:16,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3051 transitions. [2019-11-24 06:06:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 06:06:16,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:16,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:16,828 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1081066735, now seen corresponding path program 1 times [2019-11-24 06:06:16,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:16,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434335306] [2019-11-24 06:06:16,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:16,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434335306] [2019-11-24 06:06:16,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:16,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:06:16,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734145109] [2019-11-24 06:06:16,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:06:16,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:06:16,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:06:16,910 INFO L87 Difference]: Start difference. First operand 2279 states and 3051 transitions. Second operand 5 states. [2019-11-24 06:06:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:17,249 INFO L93 Difference]: Finished difference Result 4830 states and 6471 transitions. [2019-11-24 06:06:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:06:17,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-24 06:06:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:17,266 INFO L225 Difference]: With dead ends: 4830 [2019-11-24 06:06:17,266 INFO L226 Difference]: Without dead ends: 3388 [2019-11-24 06:06:17,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:06:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-11-24 06:06:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 2406. [2019-11-24 06:06:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-11-24 06:06:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3192 transitions. [2019-11-24 06:06:17,450 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3192 transitions. Word has length 72 [2019-11-24 06:06:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:17,451 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 3192 transitions. [2019-11-24 06:06:17,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:06:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3192 transitions. [2019-11-24 06:06:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:06:17,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:17,455 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:17,456 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -958777918, now seen corresponding path program 1 times [2019-11-24 06:06:17,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:17,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748705168] [2019-11-24 06:06:17,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:17,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748705168] [2019-11-24 06:06:17,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:17,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:17,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646695645] [2019-11-24 06:06:17,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:17,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:17,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:17,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:17,499 INFO L87 Difference]: Start difference. First operand 2406 states and 3192 transitions. Second operand 4 states. [2019-11-24 06:06:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:17,731 INFO L93 Difference]: Finished difference Result 6721 states and 9089 transitions. [2019-11-24 06:06:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:17,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-24 06:06:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:17,758 INFO L225 Difference]: With dead ends: 6721 [2019-11-24 06:06:17,758 INFO L226 Difference]: Without dead ends: 4328 [2019-11-24 06:06:17,764 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:06:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-11-24 06:06:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 3157. [2019-11-24 06:06:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2019-11-24 06:06:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 4239 transitions. [2019-11-24 06:06:17,965 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 4239 transitions. Word has length 73 [2019-11-24 06:06:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:17,965 INFO L462 AbstractCegarLoop]: Abstraction has 3157 states and 4239 transitions. [2019-11-24 06:06:17,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 4239 transitions. [2019-11-24 06:06:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-24 06:06:17,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:17,974 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:17,974 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash -387548833, now seen corresponding path program 1 times [2019-11-24 06:06:17,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:17,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831734438] [2019-11-24 06:06:17,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:18,022 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:06:18,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831734438] [2019-11-24 06:06:18,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:18,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:18,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268396582] [2019-11-24 06:06:18,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:18,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:18,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:18,026 INFO L87 Difference]: Start difference. First operand 3157 states and 4239 transitions. Second operand 3 states. [2019-11-24 06:06:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:18,199 INFO L93 Difference]: Finished difference Result 5405 states and 7301 transitions. [2019-11-24 06:06:18,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:18,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-24 06:06:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:18,209 INFO L225 Difference]: With dead ends: 5405 [2019-11-24 06:06:18,209 INFO L226 Difference]: Without dead ends: 3145 [2019-11-24 06:06:18,214 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:06:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2019-11-24 06:06:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3065. [2019-11-24 06:06:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2019-11-24 06:06:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 3981 transitions. [2019-11-24 06:06:18,457 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 3981 transitions. Word has length 92 [2019-11-24 06:06:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:18,457 INFO L462 AbstractCegarLoop]: Abstraction has 3065 states and 3981 transitions. [2019-11-24 06:06:18,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 3981 transitions. [2019-11-24 06:06:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-24 06:06:18,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:18,463 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:18,463 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1514879935, now seen corresponding path program 1 times [2019-11-24 06:06:18,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:18,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83087314] [2019-11-24 06:06:18,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:18,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83087314] [2019-11-24 06:06:18,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:18,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:18,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270038998] [2019-11-24 06:06:18,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:18,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:18,506 INFO L87 Difference]: Start difference. First operand 3065 states and 3981 transitions. Second operand 3 states. [2019-11-24 06:06:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:18,657 INFO L93 Difference]: Finished difference Result 5217 states and 6781 transitions. [2019-11-24 06:06:18,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:18,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-24 06:06:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:18,664 INFO L225 Difference]: With dead ends: 5217 [2019-11-24 06:06:18,664 INFO L226 Difference]: Without dead ends: 3065 [2019-11-24 06:06:18,668 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:06:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2019-11-24 06:06:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2019-11-24 06:06:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2019-11-24 06:06:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 3927 transitions. [2019-11-24 06:06:18,824 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 3927 transitions. Word has length 92 [2019-11-24 06:06:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:18,825 INFO L462 AbstractCegarLoop]: Abstraction has 3065 states and 3927 transitions. [2019-11-24 06:06:18,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 3927 transitions. [2019-11-24 06:06:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-24 06:06:18,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:18,830 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:18,830 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1085759042, now seen corresponding path program 1 times [2019-11-24 06:06:18,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:18,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860956699] [2019-11-24 06:06:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 06:06:18,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860956699] [2019-11-24 06:06:18,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:18,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:18,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897363368] [2019-11-24 06:06:18,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:18,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:18,881 INFO L87 Difference]: Start difference. First operand 3065 states and 3927 transitions. Second operand 3 states. [2019-11-24 06:06:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:19,176 INFO L93 Difference]: Finished difference Result 7272 states and 9422 transitions. [2019-11-24 06:06:19,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:19,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-24 06:06:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:19,188 INFO L225 Difference]: With dead ends: 7272 [2019-11-24 06:06:19,188 INFO L226 Difference]: Without dead ends: 5771 [2019-11-24 06:06:19,192 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:06:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2019-11-24 06:06:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5767. [2019-11-24 06:06:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-24 06:06:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7457 transitions. [2019-11-24 06:06:19,477 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7457 transitions. Word has length 94 [2019-11-24 06:06:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:19,477 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7457 transitions. [2019-11-24 06:06:19,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7457 transitions. [2019-11-24 06:06:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-24 06:06:19,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:19,488 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:06:19,488 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 662460177, now seen corresponding path program 1 times [2019-11-24 06:06:19,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:19,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121608075] [2019-11-24 06:06:19,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:06:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:06:19,636 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:06:19,637 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:06:19,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:06:19 BoogieIcfgContainer [2019-11-24 06:06:19,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:06:19,778 INFO L168 Benchmark]: Toolchain (without parser) took 10826.29 ms. Allocated memory was 136.3 MB in the beginning and 577.2 MB in the end (delta: 440.9 MB). Free memory was 101.1 MB in the beginning and 206.1 MB in the end (delta: -105.0 MB). Peak memory consumption was 335.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:19,780 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 06:06:19,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.44 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 174.5 MB in the end (delta: -73.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:19,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.36 ms. Allocated memory is still 199.2 MB. Free memory was 174.5 MB in the beginning and 171.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:19,787 INFO L168 Benchmark]: Boogie Preprocessor took 79.84 ms. Allocated memory is still 199.2 MB. Free memory was 171.4 MB in the beginning and 167.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:19,791 INFO L168 Benchmark]: RCFGBuilder took 2032.50 ms. Allocated memory was 199.2 MB in the beginning and 228.6 MB in the end (delta: 29.4 MB). Free memory was 167.9 MB in the beginning and 103.8 MB in the end (delta: 64.2 MB). Peak memory consumption was 93.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:19,791 INFO L168 Benchmark]: TraceAbstraction took 8187.01 ms. Allocated memory was 228.6 MB in the beginning and 577.2 MB in the end (delta: 348.7 MB). Free memory was 103.8 MB in the beginning and 206.1 MB in the end (delta: -102.3 MB). Peak memory consumption was 246.4 MB. Max. memory is 7.1 GB. [2019-11-24 06:06:19,798 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 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 457.44 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 174.5 MB in the end (delta: -73.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.36 ms. Allocated memory is still 199.2 MB. Free memory was 174.5 MB in the beginning and 171.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.84 ms. Allocated memory is still 199.2 MB. Free memory was 171.4 MB in the beginning and 167.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2032.50 ms. Allocated memory was 199.2 MB in the beginning and 228.6 MB in the end (delta: 29.4 MB). Free memory was 167.9 MB in the beginning and 103.8 MB in the end (delta: 64.2 MB). Peak memory consumption was 93.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8187.01 ms. Allocated memory was 228.6 MB in the beginning and 577.2 MB in the end (delta: 348.7 MB). Free memory was 103.8 MB in the beginning and 206.1 MB in the end (delta: -102.3 MB). Peak memory consumption was 246.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int t3_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int t3_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int t3_i ; [L27] int M_E = 2; [L28] int T1_E = 2; [L29] int T2_E = 2; [L30] int T3_E = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L687] int __retres1 ; [L600] m_i = 1 [L601] t1_i = 1 [L602] t2_i = 1 [L603] t3_i = 1 [L628] int kernel_st ; [L629] int tmp ; [L630] int tmp___0 ; [L634] kernel_st = 0 [L271] COND TRUE m_i == 1 [L272] m_st = 0 [L276] COND TRUE t1_i == 1 [L277] t1_st = 0 [L281] COND TRUE t2_i == 1 [L282] t2_st = 0 [L286] COND TRUE t3_i == 1 [L287] t3_st = 0 [L408] COND FALSE !(M_E == 0) [L413] COND FALSE !(T1_E == 0) [L418] COND FALSE !(T2_E == 0) [L423] COND FALSE !(T3_E == 0) [L428] COND FALSE !(E_1 == 0) [L433] COND FALSE !(E_2 == 0) [L438] COND FALSE !(E_3 == 0) [L491] int tmp ; [L492] int tmp___0 ; [L493] int tmp___1 ; [L494] int tmp___2 ; [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L187] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L199] return (__retres1); [L498] tmp = is_master_triggered() [L500] COND FALSE !(\read(tmp)) [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L206] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L218] return (__retres1); [L506] tmp___0 = is_transmit1_triggered() [L508] COND FALSE !(\read(tmp___0)) [L222] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L225] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L237] return (__retres1); [L514] tmp___1 = is_transmit2_triggered() [L516] COND FALSE !(\read(tmp___1)) [L241] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L244] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L256] return (__retres1); [L522] tmp___2 = is_transmit3_triggered() [L524] COND FALSE !(\read(tmp___2)) [L451] COND FALSE !(M_E == 1) [L456] COND FALSE !(T1_E == 1) [L461] COND FALSE !(T2_E == 1) [L466] COND FALSE !(T3_E == 1) [L471] COND FALSE !(E_1 == 1) [L476] COND FALSE !(E_2 == 1) [L481] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L642] COND TRUE 1 [L645] kernel_st = 1 [L327] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L331] COND TRUE 1 [L296] int __retres1 ; [L299] COND TRUE m_st == 0 [L300] __retres1 = 1 [L322] return (__retres1); [L334] tmp = exists_runnable_thread() [L336] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE m_st == 0 [L342] int tmp_ndt_1; [L343] tmp_ndt_1 = __VERIFIER_nondet_int() [L344] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L355] COND TRUE t1_st == 0 [L356] int tmp_ndt_2; [L357] tmp_ndt_2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp_ndt_2) [L360] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L84] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L95] COND TRUE 1 [L97] t1_pc = 1 [L98] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L369] COND TRUE t2_st == 0 [L370] int tmp_ndt_3; [L371] tmp_ndt_3 = __VERIFIER_nondet_int() [L372] COND TRUE \read(tmp_ndt_3) [L374] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L119] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L130] COND TRUE 1 [L132] t2_pc = 1 [L133] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L383] COND TRUE t3_st == 0 [L384] int tmp_ndt_4; [L385] tmp_ndt_4 = __VERIFIER_nondet_int() [L386] COND TRUE \read(tmp_ndt_4) [L388] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L154] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L165] COND TRUE 1 [L167] t3_pc = 1 [L168] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L331] COND TRUE 1 [L296] int __retres1 ; [L299] COND TRUE m_st == 0 [L300] __retres1 = 1 [L322] return (__retres1); [L334] tmp = exists_runnable_thread() [L336] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L341] COND TRUE m_st == 0 [L342] int tmp_ndt_1; [L343] tmp_ndt_1 = __VERIFIER_nondet_int() [L344] COND TRUE \read(tmp_ndt_1) [L346] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L43] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L54] COND TRUE 1 [L57] E_1 = 1 [L491] int tmp ; [L492] int tmp___0 ; [L493] int tmp___1 ; [L494] int tmp___2 ; [L184] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L187] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] return (__retres1); [L498] tmp = is_master_triggered() [L500] COND FALSE !(\read(tmp)) [L203] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L206] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] COND TRUE E_1 == 1 [L208] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] return (__retres1); [L506] tmp___0 = is_transmit1_triggered() [L508] COND TRUE \read(tmp___0) [L509] t1_st = 0 [L222] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L225] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] return (__retres1); [L514] tmp___1 = is_transmit2_triggered() [L516] COND FALSE !(\read(tmp___1)) [L241] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L244] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] return (__retres1); [L522] tmp___2 = is_transmit3_triggered() [L524] COND FALSE !(\read(tmp___2)) [L59] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L62] COND TRUE 1 [L64] m_pc = 1 [L65] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L355] COND TRUE t1_st == 0 [L356] int tmp_ndt_2; [L357] tmp_ndt_2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp_ndt_2) [L360] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L84] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L87] COND TRUE t1_pc == 1 [L103] E_2 = 1 [L491] int tmp ; [L492] int tmp___0 ; [L493] int tmp___1 ; [L494] int tmp___2 ; [L184] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L187] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L188] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] return (__retres1); [L498] tmp = is_master_triggered() [L500] COND FALSE !(\read(tmp)) [L203] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L206] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] return (__retres1); [L506] tmp___0 = is_transmit1_triggered() [L508] COND FALSE !(\read(tmp___0)) [L222] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L225] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] COND TRUE E_2 == 1 [L227] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] return (__retres1); [L514] tmp___1 = is_transmit2_triggered() [L516] COND TRUE \read(tmp___1) [L517] t2_st = 0 [L241] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L244] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] return (__retres1); [L522] tmp___2 = is_transmit3_triggered() [L524] COND FALSE !(\read(tmp___2)) [L105] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L95] COND TRUE 1 [L97] t1_pc = 1 [L98] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L369] COND TRUE t2_st == 0 [L370] int tmp_ndt_3; [L371] tmp_ndt_3 = __VERIFIER_nondet_int() [L372] COND TRUE \read(tmp_ndt_3) [L374] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L119] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L122] COND TRUE t2_pc == 1 [L138] E_3 = 1 [L491] int tmp ; [L492] int tmp___0 ; [L493] int tmp___1 ; [L494] int tmp___2 ; [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L187] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L188] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] return (__retres1); [L498] tmp = is_master_triggered() [L500] COND FALSE !(\read(tmp)) [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L206] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] return (__retres1); [L506] tmp___0 = is_transmit1_triggered() [L508] COND FALSE !(\read(tmp___0)) [L222] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L225] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] return (__retres1); [L514] tmp___1 = is_transmit2_triggered() [L516] COND FALSE !(\read(tmp___1)) [L241] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L244] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] COND TRUE E_3 == 1 [L246] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] return (__retres1); [L522] tmp___2 = is_transmit3_triggered() [L524] COND TRUE \read(tmp___2) [L525] t3_st = 0 [L140] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L130] COND TRUE 1 [L132] t2_pc = 1 [L133] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L383] COND TRUE t3_st == 0 [L384] int tmp_ndt_4; [L385] tmp_ndt_4 = __VERIFIER_nondet_int() [L386] COND TRUE \read(tmp_ndt_4) [L388] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L154] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L157] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.1s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4168 SDtfs, 2843 SDslu, 3236 SDs, 0 SdLazy, 451 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5767occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 5219 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 122119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 176/176 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 incorrect! Received shutdown request...