./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69fb30bd96659b6c61b59030d7ea8c3053fedc35 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:13:16,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:13:16,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:13:16,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:13:16,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:13:16,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:13:16,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:13:16,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:13:16,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:13:16,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:13:16,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:13:16,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:13:16,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:13:16,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:13:16,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:13:16,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:13:16,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:13:16,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:13:16,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:13:16,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:13:16,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:13:16,629 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:13:16,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:13:16,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:13:16,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:13:16,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:13:16,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:13:16,636 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:13:16,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:13:16,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:13:16,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:13:16,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:13:16,639 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:13:16,640 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:13:16,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:13:16,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:13:16,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:13:16,660 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:13:16,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:13:16,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:13:16,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:13:16,662 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:13:16,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:13:16,663 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:13:16,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:13:16,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:13:16,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:13:16,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:13:16,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:13:16,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:13:16,665 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:13:16,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:13:16,665 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:13:16,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:13:16,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:13:16,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:13:16,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:13:16,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:13:16,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:13:16,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:13:16,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:13:16,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:13:16,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:13:16,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:13:16,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:13:16,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69fb30bd96659b6c61b59030d7ea8c3053fedc35 [2019-01-12 15:13:16,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:13:16,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:13:16,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:13:16,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:13:16,740 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:13:16,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:16,800 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0ef8efe/7e79d7289d4f47eeb84a73db4ea484aa/FLAG67cf18b6a [2019-01-12 15:13:17,235 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:13:17,236 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:17,261 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0ef8efe/7e79d7289d4f47eeb84a73db4ea484aa/FLAG67cf18b6a [2019-01-12 15:13:17,592 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0ef8efe/7e79d7289d4f47eeb84a73db4ea484aa [2019-01-12 15:13:17,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:13:17,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:13:17,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:13:17,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:13:17,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:13:17,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:17,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17, skipping insertion in model container [2019-01-12 15:13:17,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:17,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:13:17,670 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:13:17,897 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:13:17,904 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:13:17,972 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:13:17,993 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:13:17,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17 WrapperNode [2019-01-12 15:13:17,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:13:17,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:13:17,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:13:17,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:13:18,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:13:18,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:13:18,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:13:18,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:13:18,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (1/1) ... [2019-01-12 15:13:18,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:13:18,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:13:18,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:13:18,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:13:18,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (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-01-12 15:13:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:13:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:13:20,554 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:13:20,555 INFO L286 CfgBuilder]: Removed 132 assue(true) statements. [2019-01-12 15:13:20,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:20 BoogieIcfgContainer [2019-01-12 15:13:20,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:13:20,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:13:20,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:13:20,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:13:20,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:13:17" (1/3) ... [2019-01-12 15:13:20,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bc8a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:13:20, skipping insertion in model container [2019-01-12 15:13:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:17" (2/3) ... [2019-01-12 15:13:20,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bc8a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:13:20, skipping insertion in model container [2019-01-12 15:13:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:20" (3/3) ... [2019-01-12 15:13:20,565 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:20,575 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:13:20,585 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 15:13:20,602 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 15:13:20,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:13:20,641 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:13:20,641 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:13:20,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:13:20,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:13:20,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:13:20,642 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:13:20,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:13:20,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:13:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states. [2019-01-12 15:13:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:20,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:20,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:20,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2019-01-12 15:13:20,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:20,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:20,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:20,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:20,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:20,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:20,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:20,883 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 3 states. [2019-01-12 15:13:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:20,982 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2019-01-12 15:13:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:20,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:21,003 INFO L225 Difference]: With dead ends: 627 [2019-01-12 15:13:21,003 INFO L226 Difference]: Without dead ends: 312 [2019-01-12 15:13:21,008 INFO L631 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-01-12 15:13:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-12 15:13:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-01-12 15:13:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 15:13:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2019-01-12 15:13:21,080 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 61 [2019-01-12 15:13:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:21,080 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2019-01-12 15:13:21,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2019-01-12 15:13:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:21,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:21,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:21,084 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2019-01-12 15:13:21,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:21,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:21,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:21,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:21,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:21,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:21,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:21,189 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand 3 states. [2019-01-12 15:13:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:21,388 INFO L93 Difference]: Finished difference Result 848 states and 1286 transitions. [2019-01-12 15:13:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:21,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:21,398 INFO L225 Difference]: With dead ends: 848 [2019-01-12 15:13:21,398 INFO L226 Difference]: Without dead ends: 544 [2019-01-12 15:13:21,402 INFO L631 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-01-12 15:13:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-01-12 15:13:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2019-01-12 15:13:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 818 transitions. [2019-01-12 15:13:21,458 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 818 transitions. Word has length 61 [2019-01-12 15:13:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:21,459 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 818 transitions. [2019-01-12 15:13:21,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 818 transitions. [2019-01-12 15:13:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:21,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:21,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:21,462 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2019-01-12 15:13:21,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:21,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:21,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:21,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:21,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:21,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:21,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:21,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:21,553 INFO L87 Difference]: Start difference. First operand 540 states and 818 transitions. Second operand 3 states. [2019-01-12 15:13:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:21,687 INFO L93 Difference]: Finished difference Result 1071 states and 1623 transitions. [2019-01-12 15:13:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:21,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:21,692 INFO L225 Difference]: With dead ends: 1071 [2019-01-12 15:13:21,693 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:21,695 INFO L631 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-01-12 15:13:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 810 transitions. [2019-01-12 15:13:21,731 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 810 transitions. Word has length 61 [2019-01-12 15:13:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:21,731 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 810 transitions. [2019-01-12 15:13:21,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 810 transitions. [2019-01-12 15:13:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:21,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:21,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:21,738 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1494892678, now seen corresponding path program 1 times [2019-01-12 15:13:21,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:21,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:21,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:21,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:21,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:21,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:21,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:21,869 INFO L87 Difference]: Start difference. First operand 540 states and 810 transitions. Second operand 3 states. [2019-01-12 15:13:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:22,021 INFO L93 Difference]: Finished difference Result 1070 states and 1606 transitions. [2019-01-12 15:13:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:22,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:22,028 INFO L225 Difference]: With dead ends: 1070 [2019-01-12 15:13:22,028 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:22,029 INFO L631 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-01-12 15:13:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 802 transitions. [2019-01-12 15:13:22,059 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 802 transitions. Word has length 61 [2019-01-12 15:13:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:22,059 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 802 transitions. [2019-01-12 15:13:22,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 802 transitions. [2019-01-12 15:13:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:22,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:22,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:22,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -774201098, now seen corresponding path program 1 times [2019-01-12 15:13:22,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:22,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:22,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:22,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:22,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:22,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:22,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:22,126 INFO L87 Difference]: Start difference. First operand 540 states and 802 transitions. Second operand 3 states. [2019-01-12 15:13:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:22,296 INFO L93 Difference]: Finished difference Result 1069 states and 1589 transitions. [2019-01-12 15:13:22,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:22,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:22,303 INFO L225 Difference]: With dead ends: 1069 [2019-01-12 15:13:22,303 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:22,306 INFO L631 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-01-12 15:13:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 794 transitions. [2019-01-12 15:13:22,347 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 794 transitions. Word has length 61 [2019-01-12 15:13:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:22,349 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 794 transitions. [2019-01-12 15:13:22,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 794 transitions. [2019-01-12 15:13:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:22,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:22,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:22,360 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:22,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -196763654, now seen corresponding path program 1 times [2019-01-12 15:13:22,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:22,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:22,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:22,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:22,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:22,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:22,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:22,483 INFO L87 Difference]: Start difference. First operand 540 states and 794 transitions. Second operand 3 states. [2019-01-12 15:13:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:22,877 INFO L93 Difference]: Finished difference Result 1068 states and 1572 transitions. [2019-01-12 15:13:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:22,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:22,884 INFO L225 Difference]: With dead ends: 1068 [2019-01-12 15:13:22,884 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:22,887 INFO L631 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-01-12 15:13:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 776 transitions. [2019-01-12 15:13:22,929 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 776 transitions. Word has length 61 [2019-01-12 15:13:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:22,930 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 776 transitions. [2019-01-12 15:13:22,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 776 transitions. [2019-01-12 15:13:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:22,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:22,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:22,935 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash 749500983, now seen corresponding path program 1 times [2019-01-12 15:13:22,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:22,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:23,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:23,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:23,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:23,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:23,068 INFO L87 Difference]: Start difference. First operand 540 states and 776 transitions. Second operand 3 states. [2019-01-12 15:13:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:23,443 INFO L93 Difference]: Finished difference Result 1066 states and 1533 transitions. [2019-01-12 15:13:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:23,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:23,451 INFO L225 Difference]: With dead ends: 1066 [2019-01-12 15:13:23,451 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:23,452 INFO L631 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-01-12 15:13:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 758 transitions. [2019-01-12 15:13:23,497 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 758 transitions. Word has length 61 [2019-01-12 15:13:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:23,498 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 758 transitions. [2019-01-12 15:13:23,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 758 transitions. [2019-01-12 15:13:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:23,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:23,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:23,500 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:23,503 INFO L82 PathProgramCache]: Analyzing trace with hash 91036916, now seen corresponding path program 1 times [2019-01-12 15:13:23,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:23,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:23,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:23,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:23,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:23,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:23,615 INFO L87 Difference]: Start difference. First operand 540 states and 758 transitions. Second operand 3 states. [2019-01-12 15:13:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:23,990 INFO L93 Difference]: Finished difference Result 1065 states and 1496 transitions. [2019-01-12 15:13:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:23,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:23,995 INFO L225 Difference]: With dead ends: 1065 [2019-01-12 15:13:23,995 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:23,997 INFO L631 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-01-12 15:13:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 740 transitions. [2019-01-12 15:13:24,037 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 740 transitions. Word has length 61 [2019-01-12 15:13:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:24,038 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 740 transitions. [2019-01-12 15:13:24,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 740 transitions. [2019-01-12 15:13:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:24,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:24,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:24,042 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1080534521, now seen corresponding path program 1 times [2019-01-12 15:13:24,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:24,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:24,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:24,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:24,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:24,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:24,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:24,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:24,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:24,186 INFO L87 Difference]: Start difference. First operand 540 states and 740 transitions. Second operand 3 states. [2019-01-12 15:13:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:24,603 INFO L93 Difference]: Finished difference Result 1067 states and 1463 transitions. [2019-01-12 15:13:24,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:24,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:24,610 INFO L225 Difference]: With dead ends: 1067 [2019-01-12 15:13:24,610 INFO L226 Difference]: Without dead ends: 540 [2019-01-12 15:13:24,612 INFO L631 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-01-12 15:13:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-12 15:13:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-01-12 15:13:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-01-12 15:13:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2019-01-12 15:13:24,657 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 61 [2019-01-12 15:13:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:24,657 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2019-01-12 15:13:24,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2019-01-12 15:13:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:13:24,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:24,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:24,659 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash -507813381, now seen corresponding path program 1 times [2019-01-12 15:13:24,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:24,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:24,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:24,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:24,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:24,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:24,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:24,788 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2019-01-12 15:13:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:25,315 INFO L93 Difference]: Finished difference Result 1522 states and 2039 transitions. [2019-01-12 15:13:25,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:25,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:13:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:25,326 INFO L225 Difference]: With dead ends: 1522 [2019-01-12 15:13:25,326 INFO L226 Difference]: Without dead ends: 999 [2019-01-12 15:13:25,329 INFO L631 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-01-12 15:13:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-01-12 15:13:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 947. [2019-01-12 15:13:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-01-12 15:13:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1256 transitions. [2019-01-12 15:13:25,387 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1256 transitions. Word has length 61 [2019-01-12 15:13:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:25,390 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1256 transitions. [2019-01-12 15:13:25,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1256 transitions. [2019-01-12 15:13:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:13:25,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:25,392 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:25,393 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash -624063038, now seen corresponding path program 1 times [2019-01-12 15:13:25,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:25,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:25,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:25,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:25,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:25,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:25,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:25,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:25,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:25,500 INFO L87 Difference]: Start difference. First operand 947 states and 1256 transitions. Second operand 3 states. [2019-01-12 15:13:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:26,032 INFO L93 Difference]: Finished difference Result 2713 states and 3613 transitions. [2019-01-12 15:13:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:26,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 15:13:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:26,043 INFO L225 Difference]: With dead ends: 2713 [2019-01-12 15:13:26,043 INFO L226 Difference]: Without dead ends: 1789 [2019-01-12 15:13:26,046 INFO L631 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-01-12 15:13:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-01-12 15:13:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1701. [2019-01-12 15:13:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2019-01-12 15:13:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2254 transitions. [2019-01-12 15:13:26,149 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2254 transitions. Word has length 99 [2019-01-12 15:13:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:26,150 INFO L480 AbstractCegarLoop]: Abstraction has 1701 states and 2254 transitions. [2019-01-12 15:13:26,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2254 transitions. [2019-01-12 15:13:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:13:26,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:26,152 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:26,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2094346499, now seen corresponding path program 1 times [2019-01-12 15:13:26,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:26,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:26,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:26,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:26,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:26,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:26,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:26,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:26,420 INFO L87 Difference]: Start difference. First operand 1701 states and 2254 transitions. Second operand 5 states. [2019-01-12 15:13:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:27,750 INFO L93 Difference]: Finished difference Result 3741 states and 4988 transitions. [2019-01-12 15:13:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:27,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-12 15:13:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:27,763 INFO L225 Difference]: With dead ends: 3741 [2019-01-12 15:13:27,763 INFO L226 Difference]: Without dead ends: 2067 [2019-01-12 15:13:27,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:13:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-01-12 15:13:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1707. [2019-01-12 15:13:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 15:13:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2225 transitions. [2019-01-12 15:13:27,907 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2225 transitions. Word has length 99 [2019-01-12 15:13:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:27,908 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2225 transitions. [2019-01-12 15:13:27,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2225 transitions. [2019-01-12 15:13:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:13:27,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:27,912 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:27,912 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1569507335, now seen corresponding path program 1 times [2019-01-12 15:13:27,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:28,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:28,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:28,194 INFO L87 Difference]: Start difference. First operand 1707 states and 2225 transitions. Second operand 5 states. [2019-01-12 15:13:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:29,530 INFO L93 Difference]: Finished difference Result 4182 states and 5468 transitions. [2019-01-12 15:13:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:29,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-12 15:13:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:29,545 INFO L225 Difference]: With dead ends: 4182 [2019-01-12 15:13:29,545 INFO L226 Difference]: Without dead ends: 2509 [2019-01-12 15:13:29,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:13:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-01-12 15:13:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1719. [2019-01-12 15:13:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-01-12 15:13:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2204 transitions. [2019-01-12 15:13:29,709 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2204 transitions. Word has length 99 [2019-01-12 15:13:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:29,709 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 2204 transitions. [2019-01-12 15:13:29,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2204 transitions. [2019-01-12 15:13:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:13:29,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:29,714 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:29,714 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1452084725, now seen corresponding path program 1 times [2019-01-12 15:13:29,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:29,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:29,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:29,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:29,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:29,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:29,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:29,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:29,988 INFO L87 Difference]: Start difference. First operand 1719 states and 2204 transitions. Second operand 5 states. [2019-01-12 15:13:30,346 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 15:13:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:31,405 INFO L93 Difference]: Finished difference Result 4879 states and 6330 transitions. [2019-01-12 15:13:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:31,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-12 15:13:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:31,421 INFO L225 Difference]: With dead ends: 4879 [2019-01-12 15:13:31,421 INFO L226 Difference]: Without dead ends: 3201 [2019-01-12 15:13:31,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:13:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-01-12 15:13:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 1743. [2019-01-12 15:13:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2019-01-12 15:13:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2199 transitions. [2019-01-12 15:13:31,558 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2199 transitions. Word has length 99 [2019-01-12 15:13:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:31,559 INFO L480 AbstractCegarLoop]: Abstraction has 1743 states and 2199 transitions. [2019-01-12 15:13:31,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2199 transitions. [2019-01-12 15:13:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:13:31,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:31,561 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:31,561 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:31,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1078857969, now seen corresponding path program 1 times [2019-01-12 15:13:31,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:31,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:31,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:31,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:31,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:31,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:31,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:31,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:31,659 INFO L87 Difference]: Start difference. First operand 1743 states and 2199 transitions. Second operand 3 states. [2019-01-12 15:13:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:32,107 INFO L93 Difference]: Finished difference Result 4925 states and 6187 transitions. [2019-01-12 15:13:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:32,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 15:13:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:32,123 INFO L225 Difference]: With dead ends: 4925 [2019-01-12 15:13:32,123 INFO L226 Difference]: Without dead ends: 3231 [2019-01-12 15:13:32,128 INFO L631 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-01-12 15:13:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2019-01-12 15:13:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3227. [2019-01-12 15:13:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3227 states. [2019-01-12 15:13:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4009 transitions. [2019-01-12 15:13:32,359 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4009 transitions. Word has length 99 [2019-01-12 15:13:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:32,360 INFO L480 AbstractCegarLoop]: Abstraction has 3227 states and 4009 transitions. [2019-01-12 15:13:32,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4009 transitions. [2019-01-12 15:13:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 15:13:32,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:32,363 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:32,363 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1872181795, now seen corresponding path program 1 times [2019-01-12 15:13:32,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:32,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:32,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:32,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:32,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:32,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:32,469 INFO L87 Difference]: Start difference. First operand 3227 states and 4009 transitions. Second operand 3 states. [2019-01-12 15:13:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:33,184 INFO L93 Difference]: Finished difference Result 9026 states and 11196 transitions. [2019-01-12 15:13:33,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:33,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 15:13:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:33,213 INFO L225 Difference]: With dead ends: 9026 [2019-01-12 15:13:33,213 INFO L226 Difference]: Without dead ends: 5848 [2019-01-12 15:13:33,221 INFO L631 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-01-12 15:13:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2019-01-12 15:13:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 5844. [2019-01-12 15:13:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5844 states. [2019-01-12 15:13:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 7200 transitions. [2019-01-12 15:13:33,702 INFO L78 Accepts]: Start accepts. Automaton has 5844 states and 7200 transitions. Word has length 100 [2019-01-12 15:13:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 5844 states and 7200 transitions. [2019-01-12 15:13:33,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5844 states and 7200 transitions. [2019-01-12 15:13:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 15:13:33,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:33,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:33,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -520796577, now seen corresponding path program 1 times [2019-01-12 15:13:33,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:33,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:13:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:33,784 INFO L87 Difference]: Start difference. First operand 5844 states and 7200 transitions. Second operand 3 states. [2019-01-12 15:13:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:34,166 INFO L93 Difference]: Finished difference Result 11596 states and 14298 transitions. [2019-01-12 15:13:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:34,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 15:13:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:34,190 INFO L225 Difference]: With dead ends: 11596 [2019-01-12 15:13:34,190 INFO L226 Difference]: Without dead ends: 5801 [2019-01-12 15:13:34,200 INFO L631 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-01-12 15:13:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-01-12 15:13:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 5801. [2019-01-12 15:13:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5801 states. [2019-01-12 15:13:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 7152 transitions. [2019-01-12 15:13:34,589 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 7152 transitions. Word has length 100 [2019-01-12 15:13:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:34,589 INFO L480 AbstractCegarLoop]: Abstraction has 5801 states and 7152 transitions. [2019-01-12 15:13:34,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 7152 transitions. [2019-01-12 15:13:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 15:13:34,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:34,594 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:34,594 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1349787928, now seen corresponding path program 1 times [2019-01-12 15:13:34,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:34,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:34,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:34,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:34,686 INFO L87 Difference]: Start difference. First operand 5801 states and 7152 transitions. Second operand 3 states. [2019-01-12 15:13:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:35,369 INFO L93 Difference]: Finished difference Result 16291 states and 20097 transitions. [2019-01-12 15:13:35,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:35,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 15:13:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:35,393 INFO L225 Difference]: With dead ends: 16291 [2019-01-12 15:13:35,393 INFO L226 Difference]: Without dead ends: 10539 [2019-01-12 15:13:35,404 INFO L631 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-01-12 15:13:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10539 states. [2019-01-12 15:13:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10539 to 10535. [2019-01-12 15:13:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10535 states. [2019-01-12 15:13:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 12941 transitions. [2019-01-12 15:13:35,926 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 12941 transitions. Word has length 101 [2019-01-12 15:13:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:35,926 INFO L480 AbstractCegarLoop]: Abstraction has 10535 states and 12941 transitions. [2019-01-12 15:13:35,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 12941 transitions. [2019-01-12 15:13:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 15:13:35,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:35,933 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:35,933 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1593794150, now seen corresponding path program 1 times [2019-01-12 15:13:35,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:35,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:13:35,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:35,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:35,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:35,992 INFO L87 Difference]: Start difference. First operand 10535 states and 12941 transitions. Second operand 3 states. [2019-01-12 15:13:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:36,601 INFO L93 Difference]: Finished difference Result 20979 states and 25783 transitions. [2019-01-12 15:13:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:36,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 15:13:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:36,627 INFO L225 Difference]: With dead ends: 20979 [2019-01-12 15:13:36,628 INFO L226 Difference]: Without dead ends: 10493 [2019-01-12 15:13:36,644 INFO L631 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-01-12 15:13:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10493 states. [2019-01-12 15:13:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 10493. [2019-01-12 15:13:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10493 states. [2019-01-12 15:13:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 12895 transitions. [2019-01-12 15:13:37,169 INFO L78 Accepts]: Start accepts. Automaton has 10493 states and 12895 transitions. Word has length 101 [2019-01-12 15:13:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:37,169 INFO L480 AbstractCegarLoop]: Abstraction has 10493 states and 12895 transitions. [2019-01-12 15:13:37,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 10493 states and 12895 transitions. [2019-01-12 15:13:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 15:13:37,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:37,175 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:37,175 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 988555220, now seen corresponding path program 1 times [2019-01-12 15:13:37,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:37,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:37,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:37,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:37,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:37,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:37,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:37,262 INFO L87 Difference]: Start difference. First operand 10493 states and 12895 transitions. Second operand 3 states. [2019-01-12 15:13:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:38,546 INFO L93 Difference]: Finished difference Result 29982 states and 36689 transitions. [2019-01-12 15:13:38,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:38,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-12 15:13:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:38,581 INFO L225 Difference]: With dead ends: 29982 [2019-01-12 15:13:38,582 INFO L226 Difference]: Without dead ends: 19538 [2019-01-12 15:13:38,603 INFO L631 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-01-12 15:13:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2019-01-12 15:13:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 19538. [2019-01-12 15:13:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19538 states. [2019-01-12 15:13:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19538 states to 19538 states and 23591 transitions. [2019-01-12 15:13:39,959 INFO L78 Accepts]: Start accepts. Automaton has 19538 states and 23591 transitions. Word has length 102 [2019-01-12 15:13:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:39,960 INFO L480 AbstractCegarLoop]: Abstraction has 19538 states and 23591 transitions. [2019-01-12 15:13:39,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19538 states and 23591 transitions. [2019-01-12 15:13:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 15:13:39,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:39,976 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:39,976 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 490924073, now seen corresponding path program 1 times [2019-01-12 15:13:39,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:39,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:39,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:40,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:40,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:40,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:40,096 INFO L87 Difference]: Start difference. First operand 19538 states and 23591 transitions. Second operand 3 states. [2019-01-12 15:13:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:42,119 INFO L93 Difference]: Finished difference Result 47674 states and 57563 transitions. [2019-01-12 15:13:42,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:42,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-01-12 15:13:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:42,165 INFO L225 Difference]: With dead ends: 47674 [2019-01-12 15:13:42,166 INFO L226 Difference]: Without dead ends: 28204 [2019-01-12 15:13:42,197 INFO L631 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-01-12 15:13:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28204 states. [2019-01-12 15:13:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28204 to 28072. [2019-01-12 15:13:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28072 states. [2019-01-12 15:13:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28072 states to 28072 states and 33691 transitions. [2019-01-12 15:13:43,821 INFO L78 Accepts]: Start accepts. Automaton has 28072 states and 33691 transitions. Word has length 131 [2019-01-12 15:13:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:43,821 INFO L480 AbstractCegarLoop]: Abstraction has 28072 states and 33691 transitions. [2019-01-12 15:13:43,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28072 states and 33691 transitions. [2019-01-12 15:13:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 15:13:43,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:43,839 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:43,839 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash 293838688, now seen corresponding path program 1 times [2019-01-12 15:13:43,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:43,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:43,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:43,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:43,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:43,929 INFO L87 Difference]: Start difference. First operand 28072 states and 33691 transitions. Second operand 3 states. [2019-01-12 15:13:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:46,260 INFO L93 Difference]: Finished difference Result 68432 states and 82087 transitions. [2019-01-12 15:13:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:46,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-01-12 15:13:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:46,326 INFO L225 Difference]: With dead ends: 68432 [2019-01-12 15:13:46,327 INFO L226 Difference]: Without dead ends: 40414 [2019-01-12 15:13:46,363 INFO L631 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-01-12 15:13:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40414 states. [2019-01-12 15:13:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40414 to 40218. [2019-01-12 15:13:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40218 states. [2019-01-12 15:13:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40218 states to 40218 states and 47939 transitions. [2019-01-12 15:13:48,988 INFO L78 Accepts]: Start accepts. Automaton has 40218 states and 47939 transitions. Word has length 131 [2019-01-12 15:13:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:48,988 INFO L480 AbstractCegarLoop]: Abstraction has 40218 states and 47939 transitions. [2019-01-12 15:13:48,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 40218 states and 47939 transitions. [2019-01-12 15:13:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 15:13:49,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:49,012 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:13:49,013 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 477376696, now seen corresponding path program 1 times [2019-01-12 15:13:49,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:49,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:49,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 15:13:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:49,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:49,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:49,102 INFO L87 Difference]: Start difference. First operand 40218 states and 47939 transitions. Second operand 3 states. [2019-01-12 15:13:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:51,083 INFO L93 Difference]: Finished difference Result 72088 states and 85999 transitions. [2019-01-12 15:13:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:51,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-01-12 15:13:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:51,149 INFO L225 Difference]: With dead ends: 72088 [2019-01-12 15:13:51,150 INFO L226 Difference]: Without dead ends: 41106 [2019-01-12 15:13:51,200 INFO L631 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-01-12 15:13:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41106 states. [2019-01-12 15:13:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41106 to 39498. [2019-01-12 15:13:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39498 states. [2019-01-12 15:13:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39498 states to 39498 states and 46331 transitions. [2019-01-12 15:13:53,549 INFO L78 Accepts]: Start accepts. Automaton has 39498 states and 46331 transitions. Word has length 147 [2019-01-12 15:13:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:53,550 INFO L480 AbstractCegarLoop]: Abstraction has 39498 states and 46331 transitions. [2019-01-12 15:13:53,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 39498 states and 46331 transitions. [2019-01-12 15:13:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 15:13:53,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:53,574 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 15:13:53,574 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:53,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:53,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1845088335, now seen corresponding path program 1 times [2019-01-12 15:13:53,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:53,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:53,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:53,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:53,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:53,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:53,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:53,662 INFO L87 Difference]: Start difference. First operand 39498 states and 46331 transitions. Second operand 3 states. [2019-01-12 15:13:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:55,584 INFO L93 Difference]: Finished difference Result 62310 states and 73339 transitions. [2019-01-12 15:13:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:55,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-12 15:13:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:55,636 INFO L225 Difference]: With dead ends: 62310 [2019-01-12 15:13:55,636 INFO L226 Difference]: Without dead ends: 34906 [2019-01-12 15:13:55,658 INFO L631 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-01-12 15:13:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2019-01-12 15:13:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 34902. [2019-01-12 15:13:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34902 states. [2019-01-12 15:13:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34902 states to 34902 states and 40863 transitions. [2019-01-12 15:13:57,201 INFO L78 Accepts]: Start accepts. Automaton has 34902 states and 40863 transitions. Word has length 148 [2019-01-12 15:13:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:57,202 INFO L480 AbstractCegarLoop]: Abstraction has 34902 states and 40863 transitions. [2019-01-12 15:13:57,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34902 states and 40863 transitions. [2019-01-12 15:13:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 15:13:57,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:57,216 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 15:13:57,216 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817295, now seen corresponding path program 1 times [2019-01-12 15:13:57,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:57,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:57,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:57,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:57,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:57,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:57,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:57,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:57,298 INFO L87 Difference]: Start difference. First operand 34902 states and 40863 transitions. Second operand 3 states. [2019-01-12 15:13:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:59,219 INFO L93 Difference]: Finished difference Result 62382 states and 73243 transitions. [2019-01-12 15:13:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:59,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-12 15:13:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:59,260 INFO L225 Difference]: With dead ends: 62382 [2019-01-12 15:13:59,260 INFO L226 Difference]: Without dead ends: 34906 [2019-01-12 15:13:59,284 INFO L631 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-01-12 15:13:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2019-01-12 15:14:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 34902. [2019-01-12 15:14:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34902 states. [2019-01-12 15:14:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34902 states to 34902 states and 40695 transitions. [2019-01-12 15:14:01,133 INFO L78 Accepts]: Start accepts. Automaton has 34902 states and 40695 transitions. Word has length 148 [2019-01-12 15:14:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:01,134 INFO L480 AbstractCegarLoop]: Abstraction has 34902 states and 40695 transitions. [2019-01-12 15:14:01,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 34902 states and 40695 transitions. [2019-01-12 15:14:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 15:14:01,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:01,142 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 15:14:01,142 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1576151473, now seen corresponding path program 1 times [2019-01-12 15:14:01,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:14:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:01,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:01,235 INFO L87 Difference]: Start difference. First operand 34902 states and 40695 transitions. Second operand 3 states. [2019-01-12 15:14:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:02,479 INFO L93 Difference]: Finished difference Result 58470 states and 68303 transitions. [2019-01-12 15:14:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:02,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-12 15:14:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:02,513 INFO L225 Difference]: With dead ends: 58470 [2019-01-12 15:14:02,513 INFO L226 Difference]: Without dead ends: 23658 [2019-01-12 15:14:02,542 INFO L631 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-01-12 15:14:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23658 states. [2019-01-12 15:14:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23658 to 23654. [2019-01-12 15:14:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23654 states. [2019-01-12 15:14:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23654 states to 23654 states and 27459 transitions. [2019-01-12 15:14:03,977 INFO L78 Accepts]: Start accepts. Automaton has 23654 states and 27459 transitions. Word has length 148 [2019-01-12 15:14:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:03,978 INFO L480 AbstractCegarLoop]: Abstraction has 23654 states and 27459 transitions. [2019-01-12 15:14:03,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23654 states and 27459 transitions. [2019-01-12 15:14:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 15:14:03,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:03,986 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:03,987 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash -954570, now seen corresponding path program 1 times [2019-01-12 15:14:03,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:03,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:14:04,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:04,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:04,073 INFO L87 Difference]: Start difference. First operand 23654 states and 27459 transitions. Second operand 3 states. [2019-01-12 15:14:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:05,495 INFO L93 Difference]: Finished difference Result 43106 states and 50305 transitions. [2019-01-12 15:14:05,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:05,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-12 15:14:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:05,529 INFO L225 Difference]: With dead ends: 43106 [2019-01-12 15:14:05,529 INFO L226 Difference]: Without dead ends: 24254 [2019-01-12 15:14:05,552 INFO L631 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-01-12 15:14:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24254 states. [2019-01-12 15:14:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24254 to 23534. [2019-01-12 15:14:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23534 states. [2019-01-12 15:14:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23534 states to 23534 states and 26843 transitions. [2019-01-12 15:14:06,683 INFO L78 Accepts]: Start accepts. Automaton has 23534 states and 26843 transitions. Word has length 148 [2019-01-12 15:14:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:06,683 INFO L480 AbstractCegarLoop]: Abstraction has 23534 states and 26843 transitions. [2019-01-12 15:14:06,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23534 states and 26843 transitions. [2019-01-12 15:14:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 15:14:06,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:06,689 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:06,690 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 823641312, now seen corresponding path program 1 times [2019-01-12 15:14:06,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:14:06,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:06,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:14:06,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:14:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:14:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:14:06,947 INFO L87 Difference]: Start difference. First operand 23534 states and 26843 transitions. Second operand 5 states. [2019-01-12 15:14:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:08,255 INFO L93 Difference]: Finished difference Result 32626 states and 36969 transitions. [2019-01-12 15:14:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:14:08,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-01-12 15:14:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:08,261 INFO L225 Difference]: With dead ends: 32626 [2019-01-12 15:14:08,262 INFO L226 Difference]: Without dead ends: 4731 [2019-01-12 15:14:08,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:14:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-01-12 15:14:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4595. [2019-01-12 15:14:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-01-12 15:14:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4976 transitions. [2019-01-12 15:14:08,507 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4976 transitions. Word has length 149 [2019-01-12 15:14:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:08,507 INFO L480 AbstractCegarLoop]: Abstraction has 4595 states and 4976 transitions. [2019-01-12 15:14:08,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:14:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4976 transitions. [2019-01-12 15:14:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-12 15:14:08,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:08,511 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:08,511 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1473194168, now seen corresponding path program 1 times [2019-01-12 15:14:08,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:08,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:14:08,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:08,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:08,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:08,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:08,604 INFO L87 Difference]: Start difference. First operand 4595 states and 4976 transitions. Second operand 3 states. [2019-01-12 15:14:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:09,325 INFO L93 Difference]: Finished difference Result 7852 states and 8519 transitions. [2019-01-12 15:14:09,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:09,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-01-12 15:14:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:09,336 INFO L225 Difference]: With dead ends: 7852 [2019-01-12 15:14:09,337 INFO L226 Difference]: Without dead ends: 4595 [2019-01-12 15:14:09,343 INFO L631 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-01-12 15:14:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2019-01-12 15:14:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2019-01-12 15:14:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-01-12 15:14:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4922 transitions. [2019-01-12 15:14:09,657 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4922 transitions. Word has length 214 [2019-01-12 15:14:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:09,657 INFO L480 AbstractCegarLoop]: Abstraction has 4595 states and 4922 transitions. [2019-01-12 15:14:09,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4922 transitions. [2019-01-12 15:14:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-12 15:14:09,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:09,662 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:09,663 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1279770330, now seen corresponding path program 1 times [2019-01-12 15:14:09,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:09,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:09,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:14:09,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:09,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:09,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:09,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:09,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:09,799 INFO L87 Difference]: Start difference. First operand 4595 states and 4922 transitions. Second operand 3 states. [2019-01-12 15:14:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:10,276 INFO L93 Difference]: Finished difference Result 7385 states and 7926 transitions. [2019-01-12 15:14:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:10,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-01-12 15:14:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:10,283 INFO L225 Difference]: With dead ends: 7385 [2019-01-12 15:14:10,283 INFO L226 Difference]: Without dead ends: 4595 [2019-01-12 15:14:10,287 INFO L631 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-01-12 15:14:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2019-01-12 15:14:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2019-01-12 15:14:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-01-12 15:14:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4876 transitions. [2019-01-12 15:14:10,708 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4876 transitions. Word has length 217 [2019-01-12 15:14:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:10,708 INFO L480 AbstractCegarLoop]: Abstraction has 4595 states and 4876 transitions. [2019-01-12 15:14:10,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4876 transitions. [2019-01-12 15:14:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-12 15:14:10,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:10,712 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:10,713 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash -928723252, now seen corresponding path program 1 times [2019-01-12 15:14:10,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:10,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:10,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:10,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:14:10,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:10,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:10,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:10,826 INFO L87 Difference]: Start difference. First operand 4595 states and 4876 transitions. Second operand 3 states. [2019-01-12 15:14:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:11,161 INFO L93 Difference]: Finished difference Result 5891 states and 6255 transitions. [2019-01-12 15:14:11,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:11,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-01-12 15:14:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:11,166 INFO L225 Difference]: With dead ends: 5891 [2019-01-12 15:14:11,166 INFO L226 Difference]: Without dead ends: 3680 [2019-01-12 15:14:11,169 INFO L631 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-01-12 15:14:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-01-12 15:14:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2019-01-12 15:14:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-01-12 15:14:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 3894 transitions. [2019-01-12 15:14:11,357 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 3894 transitions. Word has length 220 [2019-01-12 15:14:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:11,358 INFO L480 AbstractCegarLoop]: Abstraction has 3680 states and 3894 transitions. [2019-01-12 15:14:11,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 3894 transitions. [2019-01-12 15:14:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-01-12 15:14:11,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:11,362 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:11,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1613896568, now seen corresponding path program 1 times [2019-01-12 15:14:11,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:11,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:11,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:14:11,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:11,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 15:14:11,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:14:11,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:14:11,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:14:11,658 INFO L87 Difference]: Start difference. First operand 3680 states and 3894 transitions. Second operand 6 states. [2019-01-12 15:14:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:12,058 INFO L93 Difference]: Finished difference Result 3680 states and 3894 transitions. [2019-01-12 15:14:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:14:12,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-01-12 15:14:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:12,066 INFO L225 Difference]: With dead ends: 3680 [2019-01-12 15:14:12,066 INFO L226 Difference]: Without dead ends: 3678 [2019-01-12 15:14:12,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:14:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-01-12 15:14:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3678. [2019-01-12 15:14:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2019-01-12 15:14:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 3891 transitions. [2019-01-12 15:14:12,292 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 3891 transitions. Word has length 223 [2019-01-12 15:14:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:12,292 INFO L480 AbstractCegarLoop]: Abstraction has 3678 states and 3891 transitions. [2019-01-12 15:14:12,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:14:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 3891 transitions. [2019-01-12 15:14:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-01-12 15:14:12,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:12,297 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:12,297 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1852984938, now seen corresponding path program 1 times [2019-01-12 15:14:12,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:14:12,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:12,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:12,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:12,413 INFO L87 Difference]: Start difference. First operand 3678 states and 3891 transitions. Second operand 3 states. [2019-01-12 15:14:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:12,746 INFO L93 Difference]: Finished difference Result 5766 states and 6078 transitions. [2019-01-12 15:14:12,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:12,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-01-12 15:14:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:12,753 INFO L225 Difference]: With dead ends: 5766 [2019-01-12 15:14:12,753 INFO L226 Difference]: Without dead ends: 4714 [2019-01-12 15:14:12,756 INFO L631 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-01-12 15:14:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2019-01-12 15:14:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 3680. [2019-01-12 15:14:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-01-12 15:14:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 3893 transitions. [2019-01-12 15:14:12,981 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 3893 transitions. Word has length 227 [2019-01-12 15:14:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:12,982 INFO L480 AbstractCegarLoop]: Abstraction has 3680 states and 3893 transitions. [2019-01-12 15:14:12,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 3893 transitions. [2019-01-12 15:14:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-12 15:14:12,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:12,987 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:14:12,987 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1845395018, now seen corresponding path program 1 times [2019-01-12 15:14:12,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:12,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:12,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:14:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:14:13,124 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:14:13,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:14:13 BoogieIcfgContainer [2019-01-12 15:14:13,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:14:13,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:14:13,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:14:13,318 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:14:13,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:20" (3/4) ... [2019-01-12 15:14:13,325 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:14:13,561 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:14:13,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:14:13,562 INFO L168 Benchmark]: Toolchain (without parser) took 55966.00 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 946.0 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-12 15:14:13,567 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:14:13,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.52 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:14:13,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-12 15:14:13,568 INFO L168 Benchmark]: Boogie Preprocessor took 68.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:14:13,570 INFO L168 Benchmark]: RCFGBuilder took 2322.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.7 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:14:13,570 INFO L168 Benchmark]: TraceAbstraction took 52759.91 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-12 15:14:13,571 INFO L168 Benchmark]: Witness Printer took 243.29 ms. Allocated memory is still 4.9 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-12 15:14:13,575 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.52 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2322.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.7 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52759.91 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 243.29 ms. Allocated memory is still 4.9 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int t3_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int t3_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int T3_E = 2; [L30] int E_M = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L39] int token ; [L41] int local ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L725] int __retres1 ; [L638] m_i = 1 [L639] t1_i = 1 [L640] t2_i = 1 [L641] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L666] int kernel_st ; [L667] int tmp ; [L668] int tmp___0 ; [L672] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L294] COND TRUE m_i == 1 [L295] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L299] COND TRUE t1_i == 1 [L300] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L304] COND TRUE t2_i == 1 [L305] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L309] COND TRUE t3_i == 1 [L310] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L431] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L436] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L441] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L446] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L451] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L456] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L461] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L466] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L210] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L229] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L248] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L267] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L479] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L484] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L489] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L494] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L499] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L504] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L509] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L514] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L680] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L683] kernel_st = 1 [L350] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L102] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L113] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L138] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L149] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L174] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L185] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L57] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L60] token = __VERIFIER_nondet_int() [L61] local = token [L62] E_1 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L210] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L220] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L222] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L226] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L229] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L230] COND TRUE E_1 == 1 [L231] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L241] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND TRUE \read(tmp___0) [L542] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L245] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L248] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L249] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L258] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L260] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L264] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L267] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L268] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L277] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L279] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L64] E_1 = 2 [L65] m_pc = 1 [L66] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L102] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L105] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L121] token += 1 [L122] E_2 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L220] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L222] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L226] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L239] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L241] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L245] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L249] COND TRUE E_2 == 1 [L250] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L260] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L547] tmp___1 = is_transmit2_triggered() [L549] COND TRUE \read(tmp___1) [L550] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L264] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L277] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L279] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L124] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L113] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L138] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L141] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L157] token += 1 [L158] E_3 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L268] COND TRUE E_3 == 1 [L269] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L555] tmp___2 = is_transmit3_triggered() [L557] COND TRUE \read(tmp___2) [L558] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L160] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L149] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L174] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L177] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L193] token += 1 [L194] E_M = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L211] COND TRUE E_M == 1 [L212] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L531] tmp = is_master_triggered() [L533] COND TRUE \read(tmp) [L534] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L196] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L185] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L49] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L71] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L82] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L83] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L84] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 316 locations, 2 error locations. UNSAFE Result, 52.6s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 29.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15598 SDtfs, 13593 SDslu, 11009 SDs, 0 SdLazy, 596 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40218occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 6602 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 4088 NumberOfCodeBlocks, 4088 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3827 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 504/504 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...