/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 06:22:31,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 06:22:31,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 06:22:31,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 06:22:31,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 06:22:31,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 06:22:31,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 06:22:31,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 06:22:31,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 06:22:31,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 06:22:31,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 06:22:31,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 06:22:31,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 06:22:31,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 06:22:31,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 06:22:31,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 06:22:31,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 06:22:31,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 06:22:31,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 06:22:31,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 06:22:31,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 06:22:31,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 06:22:31,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 06:22:31,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 06:22:31,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 06:22:31,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 06:22:31,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 06:22:31,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 06:22:31,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 06:22:31,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 06:22:31,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 06:22:31,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 06:22:31,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 06:22:31,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 06:22:31,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 06:22:31,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 06:22:31,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 06:22:31,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 06:22:31,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 06:22:31,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 06:22:31,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 06:22:31,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 06:22:31,785 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 06:22:31,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 06:22:31,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 06:22:31,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 06:22:31,790 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 06:22:31,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 06:22:31,791 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 06:22:31,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 06:22:31,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 06:22:31,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 06:22:31,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 06:22:31,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 06:22:31,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 06:22:31,792 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 06:22:31,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 06:22:31,794 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 06:22:31,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 06:22:31,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 06:22:31,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 06:22:31,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 06:22:31,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 06:22:31,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:22:31,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 06:22:31,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 06:22:31,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 06:22:31,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 06:22:31,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 06:22:31,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 06:22:31,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 06:22:31,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 06:22:32,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 06:22:32,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 06:22:32,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 06:22:32,103 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 06:22:32,103 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 06:22:32,104 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-20 06:22:32,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc0aed9c/57fa6b4ca1bc45a487e789bba9ab8850/FLAG45a08ce12 [2020-07-20 06:22:32,698 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 06:22:32,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-20 06:22:32,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc0aed9c/57fa6b4ca1bc45a487e789bba9ab8850/FLAG45a08ce12 [2020-07-20 06:22:33,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc0aed9c/57fa6b4ca1bc45a487e789bba9ab8850 [2020-07-20 06:22:33,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 06:22:33,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 06:22:33,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 06:22:33,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 06:22:33,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 06:22:33,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae35183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33, skipping insertion in model container [2020-07-20 06:22:33,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 06:22:33,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 06:22:33,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:22:33,437 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 06:22:33,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:22:33,502 INFO L208 MainTranslator]: Completed translation [2020-07-20 06:22:33,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33 WrapperNode [2020-07-20 06:22:33,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 06:22:33,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 06:22:33,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 06:22:33,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 06:22:33,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (1/1) ... [2020-07-20 06:22:33,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 06:22:33,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 06:22:33,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 06:22:33,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 06:22:33,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (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 [2020-07-20 06:22:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 06:22:33,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 06:22:33,710 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 06:22:33,710 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 06:22:33,710 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 06:22:33,710 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 06:22:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 06:22:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 06:22:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 06:22:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 06:22:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 06:22:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 06:22:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 06:22:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 06:22:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 06:22:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 06:22:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 06:22:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 06:22:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 06:22:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 06:22:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 06:22:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 06:22:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 06:22:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 06:22:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 06:22:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 06:22:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 06:22:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 06:22:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 06:22:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 06:22:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 06:22:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 06:22:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 06:22:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 06:22:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 06:22:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 06:22:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 06:22:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 06:22:34,247 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 06:22:34,248 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 06:22:34,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:34 BoogieIcfgContainer [2020-07-20 06:22:34,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 06:22:34,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 06:22:34,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 06:22:34,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 06:22:34,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:22:33" (1/3) ... [2020-07-20 06:22:34,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afeeb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:34, skipping insertion in model container [2020-07-20 06:22:34,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:33" (2/3) ... [2020-07-20 06:22:34,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afeeb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:34, skipping insertion in model container [2020-07-20 06:22:34,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:34" (3/3) ... [2020-07-20 06:22:34,272 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-07-20 06:22:34,283 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 06:22:34,296 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 06:22:34,311 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 06:22:34,342 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 06:22:34,342 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 06:22:34,342 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 06:22:34,342 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 06:22:34,343 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 06:22:34,343 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 06:22:34,343 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 06:22:34,344 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 06:22:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-07-20 06:22:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:34,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:34,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:34,380 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:34,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2020-07-20 06:22:34,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:34,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824183851] [2020-07-20 06:22:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:35,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824183851] [2020-07-20 06:22:35,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:35,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:22:35,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885635461] [2020-07-20 06:22:35,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:22:35,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:22:35,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:22:35,032 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 9 states. [2020-07-20 06:22:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:37,179 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-07-20 06:22:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 06:22:37,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-07-20 06:22:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:37,201 INFO L225 Difference]: With dead ends: 522 [2020-07-20 06:22:37,201 INFO L226 Difference]: Without dead ends: 371 [2020-07-20 06:22:37,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-20 06:22:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-07-20 06:22:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2020-07-20 06:22:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-20 06:22:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2020-07-20 06:22:37,341 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 78 [2020-07-20 06:22:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:37,342 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2020-07-20 06:22:37,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:22:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2020-07-20 06:22:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:37,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:37,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:37,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 06:22:37,352 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash 211359051, now seen corresponding path program 1 times [2020-07-20 06:22:37,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:37,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864971726] [2020-07-20 06:22:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:37,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864971726] [2020-07-20 06:22:37,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:37,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:22:37,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148315917] [2020-07-20 06:22:37,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:22:37,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:22:37,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:37,643 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. Second operand 10 states. [2020-07-20 06:22:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:38,883 INFO L93 Difference]: Finished difference Result 599 states and 848 transitions. [2020-07-20 06:22:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:22:38,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 06:22:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:38,889 INFO L225 Difference]: With dead ends: 599 [2020-07-20 06:22:38,889 INFO L226 Difference]: Without dead ends: 361 [2020-07-20 06:22:38,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 06:22:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-07-20 06:22:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2020-07-20 06:22:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-20 06:22:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2020-07-20 06:22:38,940 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 78 [2020-07-20 06:22:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:38,941 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2020-07-20 06:22:38,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:22:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2020-07-20 06:22:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:38,943 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:38,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:38,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 06:22:38,944 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2119705461, now seen corresponding path program 1 times [2020-07-20 06:22:38,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:38,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181246110] [2020-07-20 06:22:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:39,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181246110] [2020-07-20 06:22:39,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:39,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:22:39,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678275678] [2020-07-20 06:22:39,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:22:39,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:39,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:22:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:39,123 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand 10 states. [2020-07-20 06:22:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:40,535 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2020-07-20 06:22:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 06:22:40,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 06:22:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:40,544 INFO L225 Difference]: With dead ends: 722 [2020-07-20 06:22:40,545 INFO L226 Difference]: Without dead ends: 484 [2020-07-20 06:22:40,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-20 06:22:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-07-20 06:22:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2020-07-20 06:22:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-07-20 06:22:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2020-07-20 06:22:40,621 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 78 [2020-07-20 06:22:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:40,623 INFO L479 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2020-07-20 06:22:40,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:22:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2020-07-20 06:22:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:40,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:40,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:40,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 06:22:40,633 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash -579817174, now seen corresponding path program 1 times [2020-07-20 06:22:40,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:40,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494917751] [2020-07-20 06:22:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:40,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494917751] [2020-07-20 06:22:40,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:40,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:22:40,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979086986] [2020-07-20 06:22:40,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:22:40,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:22:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:40,825 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand 10 states. [2020-07-20 06:22:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:42,148 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2020-07-20 06:22:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:22:42,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 06:22:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:42,155 INFO L225 Difference]: With dead ends: 744 [2020-07-20 06:22:42,155 INFO L226 Difference]: Without dead ends: 455 [2020-07-20 06:22:42,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-20 06:22:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-07-20 06:22:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 329. [2020-07-20 06:22:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-07-20 06:22:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2020-07-20 06:22:42,212 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 78 [2020-07-20 06:22:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:42,212 INFO L479 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2020-07-20 06:22:42,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:22:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2020-07-20 06:22:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:42,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:42,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:42,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 06:22:42,214 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash -156170452, now seen corresponding path program 1 times [2020-07-20 06:22:42,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:42,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132146428] [2020-07-20 06:22:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:42,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132146428] [2020-07-20 06:22:42,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:42,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:22:42,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484533128] [2020-07-20 06:22:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:22:42,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:22:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:42,378 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand 10 states. [2020-07-20 06:22:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:43,850 INFO L93 Difference]: Finished difference Result 774 states and 1027 transitions. [2020-07-20 06:22:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 06:22:43,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 06:22:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:43,854 INFO L225 Difference]: With dead ends: 774 [2020-07-20 06:22:43,854 INFO L226 Difference]: Without dead ends: 465 [2020-07-20 06:22:43,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-20 06:22:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-07-20 06:22:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2020-07-20 06:22:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-07-20 06:22:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2020-07-20 06:22:43,888 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 78 [2020-07-20 06:22:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:43,888 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2020-07-20 06:22:43,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:22:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2020-07-20 06:22:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:43,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:43,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:43,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 06:22:43,890 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash 118589162, now seen corresponding path program 1 times [2020-07-20 06:22:43,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:43,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174280317] [2020-07-20 06:22:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:44,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174280317] [2020-07-20 06:22:44,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:44,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:22:44,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55391834] [2020-07-20 06:22:44,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:22:44,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:22:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:44,092 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand 10 states. [2020-07-20 06:22:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:45,593 INFO L93 Difference]: Finished difference Result 920 states and 1216 transitions. [2020-07-20 06:22:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 06:22:45,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 06:22:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:45,601 INFO L225 Difference]: With dead ends: 920 [2020-07-20 06:22:45,602 INFO L226 Difference]: Without dead ends: 600 [2020-07-20 06:22:45,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-20 06:22:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-07-20 06:22:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 375. [2020-07-20 06:22:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-20 06:22:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 445 transitions. [2020-07-20 06:22:45,660 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 445 transitions. Word has length 78 [2020-07-20 06:22:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:45,661 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 445 transitions. [2020-07-20 06:22:45,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:22:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 445 transitions. [2020-07-20 06:22:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:22:45,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:45,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:45,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 06:22:45,664 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2020-07-20 06:22:45,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:45,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523019562] [2020-07-20 06:22:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:22:45,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523019562] [2020-07-20 06:22:45,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:22:45,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 06:22:45,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134579982] [2020-07-20 06:22:45,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 06:22:45,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 06:22:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 06:22:45,813 INFO L87 Difference]: Start difference. First operand 375 states and 445 transitions. Second operand 7 states. [2020-07-20 06:22:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:47,172 INFO L93 Difference]: Finished difference Result 1208 states and 1535 transitions. [2020-07-20 06:22:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:22:47,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-07-20 06:22:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:47,180 INFO L225 Difference]: With dead ends: 1208 [2020-07-20 06:22:47,180 INFO L226 Difference]: Without dead ends: 853 [2020-07-20 06:22:47,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 06:22:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2020-07-20 06:22:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 751. [2020-07-20 06:22:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-07-20 06:22:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 921 transitions. [2020-07-20 06:22:47,253 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 921 transitions. Word has length 78 [2020-07-20 06:22:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:47,253 INFO L479 AbstractCegarLoop]: Abstraction has 751 states and 921 transitions. [2020-07-20 06:22:47,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 06:22:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 921 transitions. [2020-07-20 06:22:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-20 06:22:47,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:47,256 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:47,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 06:22:47,256 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash 972462964, now seen corresponding path program 1 times [2020-07-20 06:22:47,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:47,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117538535] [2020-07-20 06:22:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 06:22:47,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117538535] [2020-07-20 06:22:47,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144001882] [2020-07-20 06:22:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3c7df903 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:47,566 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3c7df903 issued 1 check-sat command(s) [2020-07-20 06:22:47,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:47,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 06:22:47,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 06:22:47,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:22:47,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-20 06:22:47,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177203602] [2020-07-20 06:22:47,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:22:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:22:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:47,672 INFO L87 Difference]: Start difference. First operand 751 states and 921 transitions. Second operand 3 states. [2020-07-20 06:22:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:47,804 INFO L93 Difference]: Finished difference Result 2037 states and 2550 transitions. [2020-07-20 06:22:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:22:47,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-07-20 06:22:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:47,813 INFO L225 Difference]: With dead ends: 2037 [2020-07-20 06:22:47,813 INFO L226 Difference]: Without dead ends: 1033 [2020-07-20 06:22:47,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2020-07-20 06:22:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2020-07-20 06:22:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-07-20 06:22:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1261 transitions. [2020-07-20 06:22:47,922 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1261 transitions. Word has length 123 [2020-07-20 06:22:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:47,923 INFO L479 AbstractCegarLoop]: Abstraction has 1033 states and 1261 transitions. [2020-07-20 06:22:47,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:22:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1261 transitions. [2020-07-20 06:22:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-07-20 06:22:47,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:47,926 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:48,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-20 06:22:48,140 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1660958730, now seen corresponding path program 1 times [2020-07-20 06:22:48,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:48,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131254368] [2020-07-20 06:22:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-20 06:22:48,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131254368] [2020-07-20 06:22:48,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624227265] [2020-07-20 06:22:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@db84bbb No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:48,492 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@db84bbb issued 3 check-sat command(s) [2020-07-20 06:22:48,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:48,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 06:22:48,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 06:22:48,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:22:48,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-20 06:22:48,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398479388] [2020-07-20 06:22:48,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:22:48,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:22:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:22:48,600 INFO L87 Difference]: Start difference. First operand 1033 states and 1261 transitions. Second operand 3 states. [2020-07-20 06:22:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:48,783 INFO L93 Difference]: Finished difference Result 2498 states and 3083 transitions. [2020-07-20 06:22:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:22:48,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-07-20 06:22:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:48,794 INFO L225 Difference]: With dead ends: 2498 [2020-07-20 06:22:48,794 INFO L226 Difference]: Without dead ends: 1485 [2020-07-20 06:22:48,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:22:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2020-07-20 06:22:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1473. [2020-07-20 06:22:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2020-07-20 06:22:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1781 transitions. [2020-07-20 06:22:48,944 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1781 transitions. Word has length 158 [2020-07-20 06:22:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:48,944 INFO L479 AbstractCegarLoop]: Abstraction has 1473 states and 1781 transitions. [2020-07-20 06:22:48,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:22:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1781 transitions. [2020-07-20 06:22:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 06:22:48,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:48,949 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:49,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:49,165 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1249606409, now seen corresponding path program 1 times [2020-07-20 06:22:49,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:49,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729586129] [2020-07-20 06:22:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-07-20 06:22:49,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729586129] [2020-07-20 06:22:49,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766303190] [2020-07-20 06:22:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@e1e38de No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:49,525 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@e1e38de issued 2 check-sat command(s) [2020-07-20 06:22:49,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:49,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 06:22:49,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-20 06:22:49,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:22:49,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 06:22:49,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987583972] [2020-07-20 06:22:49,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:22:49,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:22:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:22:49,567 INFO L87 Difference]: Start difference. First operand 1473 states and 1781 transitions. Second operand 3 states. [2020-07-20 06:22:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:49,736 INFO L93 Difference]: Finished difference Result 2919 states and 3592 transitions. [2020-07-20 06:22:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:22:49,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-07-20 06:22:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:49,748 INFO L225 Difference]: With dead ends: 2919 [2020-07-20 06:22:49,748 INFO L226 Difference]: Without dead ends: 1467 [2020-07-20 06:22:49,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:22:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-07-20 06:22:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2020-07-20 06:22:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2020-07-20 06:22:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1753 transitions. [2020-07-20 06:22:49,881 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1753 transitions. Word has length 176 [2020-07-20 06:22:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:49,881 INFO L479 AbstractCegarLoop]: Abstraction has 1467 states and 1753 transitions. [2020-07-20 06:22:49,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:22:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1753 transitions. [2020-07-20 06:22:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 06:22:49,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:49,886 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:50,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 06:22:50,100 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1366701111, now seen corresponding path program 1 times [2020-07-20 06:22:50,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:50,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814559427] [2020-07-20 06:22:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-20 06:22:50,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814559427] [2020-07-20 06:22:50,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618844304] [2020-07-20 06:22:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@75db0864 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:50,431 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@75db0864 issued 1 check-sat command(s) [2020-07-20 06:22:50,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:50,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 06:22:50,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 06:22:50,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:22:50,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 06:22:50,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453792828] [2020-07-20 06:22:50,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:22:50,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:22:50,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:50,467 INFO L87 Difference]: Start difference. First operand 1467 states and 1753 transitions. Second operand 3 states. [2020-07-20 06:22:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:50,618 INFO L93 Difference]: Finished difference Result 3392 states and 4063 transitions. [2020-07-20 06:22:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:22:50,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-20 06:22:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:50,626 INFO L225 Difference]: With dead ends: 3392 [2020-07-20 06:22:50,626 INFO L226 Difference]: Without dead ends: 969 [2020-07-20 06:22:50,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-20 06:22:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 967. [2020-07-20 06:22:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-20 06:22:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1109 transitions. [2020-07-20 06:22:50,741 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1109 transitions. Word has length 177 [2020-07-20 06:22:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:50,742 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1109 transitions. [2020-07-20 06:22:50,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:22:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1109 transitions. [2020-07-20 06:22:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 06:22:50,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:50,781 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:50,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:50,990 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -816293866, now seen corresponding path program 1 times [2020-07-20 06:22:50,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:50,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836518438] [2020-07-20 06:22:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-07-20 06:22:51,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836518438] [2020-07-20 06:22:51,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899548962] [2020-07-20 06:22:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36b60783 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:51,425 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36b60783 issued 4 check-sat command(s) [2020-07-20 06:22:51,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:51,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 06:22:51,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-20 06:22:51,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:22:51,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 06:22:51,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844941954] [2020-07-20 06:22:51,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:22:51,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:22:51,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:51,470 INFO L87 Difference]: Start difference. First operand 967 states and 1109 transitions. Second operand 3 states. [2020-07-20 06:22:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:51,573 INFO L93 Difference]: Finished difference Result 1731 states and 2028 transitions. [2020-07-20 06:22:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:22:51,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-20 06:22:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:51,581 INFO L225 Difference]: With dead ends: 1731 [2020-07-20 06:22:51,581 INFO L226 Difference]: Without dead ends: 967 [2020-07-20 06:22:51,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:22:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2020-07-20 06:22:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2020-07-20 06:22:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-20 06:22:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1101 transitions. [2020-07-20 06:22:51,686 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1101 transitions. Word has length 177 [2020-07-20 06:22:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:51,686 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1101 transitions. [2020-07-20 06:22:51,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:22:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1101 transitions. [2020-07-20 06:22:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-07-20 06:22:51,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:51,690 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:51,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 06:22:51,905 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2020-07-20 06:22:51,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:51,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578407091] [2020-07-20 06:22:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-20 06:22:52,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578407091] [2020-07-20 06:22:52,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22038536] [2020-07-20 06:22:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ec285a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:52,466 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ec285a issued 4 check-sat command(s) [2020-07-20 06:22:52,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:52,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 06:22:52,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 06:22:52,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 06:22:52,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-20 06:22:52,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406674435] [2020-07-20 06:22:52,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 06:22:52,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 06:22:52,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-20 06:22:52,600 INFO L87 Difference]: Start difference. First operand 967 states and 1101 transitions. Second operand 12 states. [2020-07-20 06:22:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:54,881 INFO L93 Difference]: Finished difference Result 1223 states and 1418 transitions. [2020-07-20 06:22:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 06:22:54,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2020-07-20 06:22:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:54,889 INFO L225 Difference]: With dead ends: 1223 [2020-07-20 06:22:54,890 INFO L226 Difference]: Without dead ends: 1220 [2020-07-20 06:22:54,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-20 06:22:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-07-20 06:22:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1172. [2020-07-20 06:22:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2020-07-20 06:22:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2020-07-20 06:22:55,001 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 178 [2020-07-20 06:22:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:55,002 INFO L479 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2020-07-20 06:22:55,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 06:22:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2020-07-20 06:22:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-07-20 06:22:55,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:55,005 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:55,218 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:55,219 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2020-07-20 06:22:55,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:55,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423387212] [2020-07-20 06:22:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:22:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-07-20 06:22:55,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423387212] [2020-07-20 06:22:55,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142656016] [2020-07-20 06:22:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3cc5654c No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:22:55,596 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3cc5654c issued 4 check-sat command(s) [2020-07-20 06:22:55,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:22:55,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 06:22:55,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:22:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-20 06:22:55,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:22:55,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-20 06:22:55,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114203294] [2020-07-20 06:22:55,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:22:55,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:22:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:22:55,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:22:55,633 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 3 states. [2020-07-20 06:22:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:22:55,731 INFO L93 Difference]: Finished difference Result 1969 states and 2271 transitions. [2020-07-20 06:22:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:22:55,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-07-20 06:22:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:22:55,741 INFO L225 Difference]: With dead ends: 1969 [2020-07-20 06:22:55,742 INFO L226 Difference]: Without dead ends: 1186 [2020-07-20 06:22:55,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:22:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-07-20 06:22:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2020-07-20 06:22:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2020-07-20 06:22:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1353 transitions. [2020-07-20 06:22:55,894 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1353 transitions. Word has length 182 [2020-07-20 06:22:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:22:55,895 INFO L479 AbstractCegarLoop]: Abstraction has 1186 states and 1353 transitions. [2020-07-20 06:22:55,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:22:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1353 transitions. [2020-07-20 06:22:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-20 06:22:55,898 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:22:55,899 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:22:56,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 06:22:56,112 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:22:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:22:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2020-07-20 06:22:56,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:22:56,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481518272] [2020-07-20 06:22:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@453af41 [2020-07-20 06:22:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:22:56,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:22:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:22:56,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:22:56,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 06:22:56,249 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 06:22:56,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 06:22:56,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:22:56 BoogieIcfgContainer [2020-07-20 06:22:56,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 06:22:56,456 INFO L168 Benchmark]: Toolchain (without parser) took 23403.14 ms. Allocated memory was 139.5 MB in the beginning and 559.9 MB in the end (delta: 420.5 MB). Free memory was 104.1 MB in the beginning and 446.2 MB in the end (delta: -342.1 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:56,460 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 06:22:56,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.34 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 89.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:56,465 INFO L168 Benchmark]: Boogie Preprocessor took 137.04 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 180.3 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:56,466 INFO L168 Benchmark]: RCFGBuilder took 613.73 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 147.2 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:56,468 INFO L168 Benchmark]: TraceAbstraction took 22194.10 ms. Allocated memory was 202.9 MB in the beginning and 559.9 MB in the end (delta: 357.0 MB). Free memory was 146.5 MB in the beginning and 446.2 MB in the end (delta: -299.7 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:56,475 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 452.34 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 89.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.04 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 180.3 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 613.73 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 147.2 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22194.10 ms. Allocated memory was 202.9 MB in the beginning and 559.9 MB in the end (delta: 357.0 MB). Free memory was 146.5 MB in the beginning and 446.2 MB in the end (delta: -299.7 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 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 m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=6, \old(M_E)=17, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=7, \old(t1_i)=16, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=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, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L390] m_i = 1 [L391] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L479] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L424] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=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, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=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, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, 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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=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, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=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, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, 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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, 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, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, 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, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=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, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=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, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, 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, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=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, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=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, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=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, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=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, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=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, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, 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, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, 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, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, 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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, 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, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, 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, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, 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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, 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, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=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, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=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=1, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=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=1, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=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=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=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=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=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=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, 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=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=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, token=1] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=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, token=1] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=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, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.9s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2616 SDtfs, 5565 SDslu, 1387 SDs, 0 SdLazy, 7549 SolverSat, 2755 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1815 GetRequests, 1626 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1473occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1034 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3071 NumberOfCodeBlocks, 2721 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2867 ConstructedInterpolants, 0 QuantifiedInterpolants, 871578 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3416 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 1204/1280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...