/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 NUM_VARIABLES --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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 02:04:43,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 02:04:43,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 02:04:43,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 02:04:43,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 02:04:43,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 02:04:43,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 02:04:43,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 02:04:43,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 02:04:43,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 02:04:43,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 02:04:43,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 02:04:43,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 02:04:43,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 02:04:43,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 02:04:43,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 02:04:43,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 02:04:43,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 02:04:43,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 02:04:43,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 02:04:43,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 02:04:43,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 02:04:43,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 02:04:43,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 02:04:43,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 02:04:43,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 02:04:43,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 02:04:43,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 02:04:43,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 02:04:43,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 02:04:43,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 02:04:43,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 02:04:43,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 02:04:43,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 02:04:43,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 02:04:43,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 02:04:43,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 02:04:43,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 02:04:43,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 02:04:43,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 02:04:43,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 02:04:43,784 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 02:04:43,814 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 02:04:43,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 02:04:43,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 02:04:43,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 02:04:43,817 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 02:04:43,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 02:04:43,818 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 02:04:43,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 02:04:43,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 02:04:43,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 02:04:43,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 02:04:43,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 02:04:43,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 02:04:43,820 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 02:04:43,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 02:04:43,820 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 02:04:43,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 02:04:43,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 02:04:43,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 02:04:43,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 02:04:43,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 02:04:43,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 02:04:43,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 02:04:43,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 02:04:43,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 02:04:43,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 02:04:43,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 02:04:43,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 02:04:43,823 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 02:04:43,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES 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 02:04:44,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 02:04:44,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 02:04:44,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 02:04:44,113 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 02:04:44,113 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 02:04:44,114 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-07-20 02:04:44,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb935bdcc/96d231a24c774a758ad97ade711c02e0/FLAGf9e7518d3 [2020-07-20 02:04:44,638 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 02:04:44,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-07-20 02:04:44,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb935bdcc/96d231a24c774a758ad97ade711c02e0/FLAGf9e7518d3 [2020-07-20 02:04:44,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb935bdcc/96d231a24c774a758ad97ade711c02e0 [2020-07-20 02:04:45,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 02:04:45,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 02:04:45,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 02:04:45,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 02:04:45,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 02:04:45,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:04:44" (1/1) ... [2020-07-20 02:04:45,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af56354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45, skipping insertion in model container [2020-07-20 02:04:45,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:04:44" (1/1) ... [2020-07-20 02:04:45,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 02:04:45,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 02:04:45,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:04:45,298 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 02:04:45,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:04:45,450 INFO L208 MainTranslator]: Completed translation [2020-07-20 02:04:45,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45 WrapperNode [2020-07-20 02:04:45,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 02:04:45,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 02:04:45,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 02:04:45,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 02:04:45,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (1/1) ... [2020-07-20 02:04:45,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 02:04:45,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 02:04:45,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 02:04:45,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 02:04:45,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (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 02:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 02:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 02:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 02:04:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 02:04:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 02:04:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-20 02:04:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 02:04:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 02:04:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 02:04:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 02:04:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 02:04:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 02:04:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 02:04:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 02:04:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 02:04:45,577 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 02:04:45,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 02:04:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 02:04:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 02:04:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 02:04:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-20 02:04:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 02:04:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 02:04:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 02:04:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 02:04:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 02:04:45,580 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 02:04:45,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 02:04:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 02:04:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 02:04:46,205 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 02:04:46,205 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-20 02:04:46,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:04:46 BoogieIcfgContainer [2020-07-20 02:04:46,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 02:04:46,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 02:04:46,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 02:04:46,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 02:04:46,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:04:44" (1/3) ... [2020-07-20 02:04:46,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3626c0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:04:46, skipping insertion in model container [2020-07-20 02:04:46,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:45" (2/3) ... [2020-07-20 02:04:46,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3626c0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:04:46, skipping insertion in model container [2020-07-20 02:04:46,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:04:46" (3/3) ... [2020-07-20 02:04:46,229 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-07-20 02:04:46,241 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 02:04:46,263 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 02:04:46,279 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 02:04:46,319 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 02:04:46,319 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 02:04:46,319 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 02:04:46,320 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 02:04:46,320 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 02:04:46,320 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 02:04:46,321 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 02:04:46,321 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 02:04:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-20 02:04:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:46,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:46,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:46,360 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2020-07-20 02:04:46,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:46,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702222844] [2020-07-20 02:04:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:46,891 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 02:04:46,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702222844] [2020-07-20 02:04:46,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:46,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 02:04:46,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582479717] [2020-07-20 02:04:46,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 02:04:46,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 02:04:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-20 02:04:46,923 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 8 states. [2020-07-20 02:04:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:48,625 INFO L93 Difference]: Finished difference Result 412 states and 626 transitions. [2020-07-20 02:04:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:04:48,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-07-20 02:04:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:48,659 INFO L225 Difference]: With dead ends: 412 [2020-07-20 02:04:48,660 INFO L226 Difference]: Without dead ends: 247 [2020-07-20 02:04:48,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-07-20 02:04:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-07-20 02:04:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2020-07-20 02:04:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-20 02:04:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2020-07-20 02:04:48,751 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2020-07-20 02:04:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:48,752 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-07-20 02:04:48,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 02:04:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2020-07-20 02:04:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:48,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:48,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:48,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 02:04:48,766 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:48,766 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2020-07-20 02:04:48,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:48,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877580724] [2020-07-20 02:04:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:49,106 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 02:04:49,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877580724] [2020-07-20 02:04:49,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:49,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 02:04:49,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934332896] [2020-07-20 02:04:49,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 02:04:49,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:49,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 02:04:49,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:49,110 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 9 states. [2020-07-20 02:04:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:51,314 INFO L93 Difference]: Finished difference Result 579 states and 839 transitions. [2020-07-20 02:04:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 02:04:51,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2020-07-20 02:04:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:51,329 INFO L225 Difference]: With dead ends: 579 [2020-07-20 02:04:51,329 INFO L226 Difference]: Without dead ends: 439 [2020-07-20 02:04:51,335 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-07-20 02:04:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-07-20 02:04:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294. [2020-07-20 02:04:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-07-20 02:04:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 393 transitions. [2020-07-20 02:04:51,429 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 393 transitions. Word has length 90 [2020-07-20 02:04:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:51,430 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 393 transitions. [2020-07-20 02:04:51,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 02:04:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 393 transitions. [2020-07-20 02:04:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:51,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:51,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:51,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 02:04:51,441 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1952833149, now seen corresponding path program 1 times [2020-07-20 02:04:51,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:51,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388441274] [2020-07-20 02:04:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:51,649 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 02:04:51,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388441274] [2020-07-20 02:04:51,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:51,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:51,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216603994] [2020-07-20 02:04:51,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:51,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:51,652 INFO L87 Difference]: Start difference. First operand 294 states and 393 transitions. Second operand 10 states. [2020-07-20 02:04:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:52,942 INFO L93 Difference]: Finished difference Result 704 states and 993 transitions. [2020-07-20 02:04:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 02:04:52,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:04:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:52,954 INFO L225 Difference]: With dead ends: 704 [2020-07-20 02:04:52,954 INFO L226 Difference]: Without dead ends: 430 [2020-07-20 02:04:52,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 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 02:04:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-07-20 02:04:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 294. [2020-07-20 02:04:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-07-20 02:04:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2020-07-20 02:04:53,056 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 90 [2020-07-20 02:04:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:53,057 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2020-07-20 02:04:53,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2020-07-20 02:04:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:53,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:53,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:53,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 02:04:53,060 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 227206333, now seen corresponding path program 1 times [2020-07-20 02:04:53,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:53,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26347915] [2020-07-20 02:04:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:53,241 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 02:04:53,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26347915] [2020-07-20 02:04:53,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:53,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:53,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805840866] [2020-07-20 02:04:53,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:53,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:53,244 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand 10 states. [2020-07-20 02:04:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:54,477 INFO L93 Difference]: Finished difference Result 700 states and 971 transitions. [2020-07-20 02:04:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 02:04:54,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:04:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:54,482 INFO L225 Difference]: With dead ends: 700 [2020-07-20 02:04:54,482 INFO L226 Difference]: Without dead ends: 426 [2020-07-20 02:04:54,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 02:04:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-07-20 02:04:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 294. [2020-07-20 02:04:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-07-20 02:04:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 379 transitions. [2020-07-20 02:04:54,525 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 379 transitions. Word has length 90 [2020-07-20 02:04:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:54,525 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 379 transitions. [2020-07-20 02:04:54,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 379 transitions. [2020-07-20 02:04:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:54,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:54,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:54,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 02:04:54,528 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1418466941, now seen corresponding path program 1 times [2020-07-20 02:04:54,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:54,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357162248] [2020-07-20 02:04:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:54,715 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 02:04:54,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357162248] [2020-07-20 02:04:54,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:54,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:54,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980259382] [2020-07-20 02:04:54,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:54,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:54,718 INFO L87 Difference]: Start difference. First operand 294 states and 379 transitions. Second operand 10 states. [2020-07-20 02:04:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:56,501 INFO L93 Difference]: Finished difference Result 855 states and 1230 transitions. [2020-07-20 02:04:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 02:04:56,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:04:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:56,510 INFO L225 Difference]: With dead ends: 855 [2020-07-20 02:04:56,510 INFO L226 Difference]: Without dead ends: 581 [2020-07-20 02:04:56,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-07-20 02:04:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-07-20 02:04:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366. [2020-07-20 02:04:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-07-20 02:04:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2020-07-20 02:04:56,553 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 90 [2020-07-20 02:04:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:56,553 INFO L479 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2020-07-20 02:04:56,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2020-07-20 02:04:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:56,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:56,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:56,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 02:04:56,556 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:56,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1504622653, now seen corresponding path program 1 times [2020-07-20 02:04:56,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:56,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270768562] [2020-07-20 02:04:56,557 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:56,749 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 02:04:56,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270768562] [2020-07-20 02:04:56,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:56,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:56,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366454304] [2020-07-20 02:04:56,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:56,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:56,754 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 10 states. [2020-07-20 02:04:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:58,425 INFO L93 Difference]: Finished difference Result 877 states and 1164 transitions. [2020-07-20 02:04:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:04:58,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:04:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:58,431 INFO L225 Difference]: With dead ends: 877 [2020-07-20 02:04:58,431 INFO L226 Difference]: Without dead ends: 532 [2020-07-20 02:04:58,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-20 02:04:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-07-20 02:04:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2020-07-20 02:04:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-07-20 02:04:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 465 transitions. [2020-07-20 02:04:58,478 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 465 transitions. Word has length 90 [2020-07-20 02:04:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:58,478 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 465 transitions. [2020-07-20 02:04:58,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 465 transitions. [2020-07-20 02:04:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:04:58,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:58,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:58,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 02:04:58,481 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash -523963457, now seen corresponding path program 1 times [2020-07-20 02:04:58,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:58,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605910247] [2020-07-20 02:04:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:04:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,662 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 02:04:58,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605910247] [2020-07-20 02:04:58,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:58,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:58,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993535257] [2020-07-20 02:04:58,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:58,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:58,668 INFO L87 Difference]: Start difference. First operand 376 states and 465 transitions. Second operand 10 states. [2020-07-20 02:05:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:00,337 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions. [2020-07-20 02:05:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 02:05:00,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:05:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:00,347 INFO L225 Difference]: With dead ends: 915 [2020-07-20 02:05:00,347 INFO L226 Difference]: Without dead ends: 560 [2020-07-20 02:05:00,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 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 02:05:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-07-20 02:05:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 396. [2020-07-20 02:05:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-07-20 02:05:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2020-07-20 02:05:00,395 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 90 [2020-07-20 02:05:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:00,396 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2020-07-20 02:05:00,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:05:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2020-07-20 02:05:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:05:00,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:00,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:00,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 02:05:00,398 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash -275816963, now seen corresponding path program 1 times [2020-07-20 02:05:00,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:00,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128165227] [2020-07-20 02:05:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,699 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 02:05:00,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128165227] [2020-07-20 02:05:00,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:00,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:05:00,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054266924] [2020-07-20 02:05:00,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:05:00,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:05:00,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:05:00,702 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand 10 states. [2020-07-20 02:05:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:02,480 INFO L93 Difference]: Finished difference Result 939 states and 1222 transitions. [2020-07-20 02:05:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 02:05:02,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:05:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:02,487 INFO L225 Difference]: With dead ends: 939 [2020-07-20 02:05:02,488 INFO L226 Difference]: Without dead ends: 564 [2020-07-20 02:05:02,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:05:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-07-20 02:05:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 406. [2020-07-20 02:05:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-07-20 02:05:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions. [2020-07-20 02:05:02,533 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 90 [2020-07-20 02:05:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:02,533 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions. [2020-07-20 02:05:02,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:05:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions. [2020-07-20 02:05:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:05:02,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:02,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:02,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 02:05:02,535 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash -348203521, now seen corresponding path program 1 times [2020-07-20 02:05:02,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:02,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213435721] [2020-07-20 02:05:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:02,708 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 02:05:02,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213435721] [2020-07-20 02:05:02,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:02,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:05:02,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908507774] [2020-07-20 02:05:02,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:05:02,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:05:02,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:05:02,716 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand 10 states. [2020-07-20 02:05:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:04,491 INFO L93 Difference]: Finished difference Result 1144 states and 1493 transitions. [2020-07-20 02:05:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 02:05:04,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 02:05:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:04,497 INFO L225 Difference]: With dead ends: 1144 [2020-07-20 02:05:04,497 INFO L226 Difference]: Without dead ends: 758 [2020-07-20 02:05:04,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2020-07-20 02:05:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2020-07-20 02:05:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 467. [2020-07-20 02:05:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-07-20 02:05:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2020-07-20 02:05:04,550 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 90 [2020-07-20 02:05:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:04,550 INFO L479 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2020-07-20 02:05:04,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:05:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2020-07-20 02:05:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 02:05:04,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:04,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:04,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 02:05:04,553 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times [2020-07-20 02:05:04,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:04,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362623177] [2020-07-20 02:05:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:04,680 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 02:05:04,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362623177] [2020-07-20 02:05:04,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:04,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 02:05:04,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898132464] [2020-07-20 02:05:04,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 02:05:04,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 02:05:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 02:05:04,683 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 7 states. [2020-07-20 02:05:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:06,375 INFO L93 Difference]: Finished difference Result 1503 states and 1877 transitions. [2020-07-20 02:05:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:05:06,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2020-07-20 02:05:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:06,383 INFO L225 Difference]: With dead ends: 1503 [2020-07-20 02:05:06,384 INFO L226 Difference]: Without dead ends: 1058 [2020-07-20 02:05:06,386 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:05:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2020-07-20 02:05:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 847. [2020-07-20 02:05:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-07-20 02:05:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1018 transitions. [2020-07-20 02:05:06,483 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1018 transitions. Word has length 90 [2020-07-20 02:05:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:06,484 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1018 transitions. [2020-07-20 02:05:06,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 02:05:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1018 transitions. [2020-07-20 02:05:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 02:05:06,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:06,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:06,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 02:05:06,486 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times [2020-07-20 02:05:06,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:06,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987784877] [2020-07-20 02:05:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,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 02:05:06,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987784877] [2020-07-20 02:05:06,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:06,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 02:05:06,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997572665] [2020-07-20 02:05:06,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 02:05:06,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:06,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 02:05:06,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 02:05:06,642 INFO L87 Difference]: Start difference. First operand 847 states and 1018 transitions. Second operand 7 states. [2020-07-20 02:05:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:08,381 INFO L93 Difference]: Finished difference Result 2813 states and 3701 transitions. [2020-07-20 02:05:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:05:08,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2020-07-20 02:05:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:08,396 INFO L225 Difference]: With dead ends: 2813 [2020-07-20 02:05:08,396 INFO L226 Difference]: Without dead ends: 1993 [2020-07-20 02:05:08,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:05:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2020-07-20 02:05:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1710. [2020-07-20 02:05:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2020-07-20 02:05:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2141 transitions. [2020-07-20 02:05:08,593 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2141 transitions. Word has length 91 [2020-07-20 02:05:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:08,594 INFO L479 AbstractCegarLoop]: Abstraction has 1710 states and 2141 transitions. [2020-07-20 02:05:08,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 02:05:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2141 transitions. [2020-07-20 02:05:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-20 02:05:08,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:08,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:08,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 02:05:08,599 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1387972843, now seen corresponding path program 1 times [2020-07-20 02:05:08,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:08,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321904781] [2020-07-20 02:05:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-20 02:05:08,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321904781] [2020-07-20 02:05:08,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:08,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 02:05:08,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96845051] [2020-07-20 02:05:08,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 02:05:08,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 02:05:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:05:08,770 INFO L87 Difference]: Start difference. First operand 1710 states and 2141 transitions. Second operand 9 states. [2020-07-20 02:05:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:10,205 INFO L93 Difference]: Finished difference Result 3845 states and 5084 transitions. [2020-07-20 02:05:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:05:10,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2020-07-20 02:05:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:10,218 INFO L225 Difference]: With dead ends: 3845 [2020-07-20 02:05:10,219 INFO L226 Difference]: Without dead ends: 2157 [2020-07-20 02:05:10,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-20 02:05:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2020-07-20 02:05:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1767. [2020-07-20 02:05:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-07-20 02:05:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2232 transitions. [2020-07-20 02:05:10,434 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2232 transitions. Word has length 111 [2020-07-20 02:05:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:10,435 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 2232 transitions. [2020-07-20 02:05:10,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 02:05:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2232 transitions. [2020-07-20 02:05:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-20 02:05:10,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:10,439 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:10,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 02:05:10,439 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times [2020-07-20 02:05:10,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:10,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625495813] [2020-07-20 02:05:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 02:05:10,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625495813] [2020-07-20 02:05:10,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:10,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 02:05:10,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197673006] [2020-07-20 02:05:10,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 02:05:10,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 02:05:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 02:05:10,643 INFO L87 Difference]: Start difference. First operand 1767 states and 2232 transitions. Second operand 8 states. [2020-07-20 02:05:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:12,886 INFO L93 Difference]: Finished difference Result 5835 states and 7942 transitions. [2020-07-20 02:05:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 02:05:12,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-07-20 02:05:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:12,908 INFO L225 Difference]: With dead ends: 5835 [2020-07-20 02:05:12,908 INFO L226 Difference]: Without dead ends: 3120 [2020-07-20 02:05:12,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:05:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2020-07-20 02:05:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2788. [2020-07-20 02:05:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2020-07-20 02:05:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3646 transitions. [2020-07-20 02:05:13,426 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3646 transitions. Word has length 111 [2020-07-20 02:05:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:13,427 INFO L479 AbstractCegarLoop]: Abstraction has 2788 states and 3646 transitions. [2020-07-20 02:05:13,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 02:05:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3646 transitions. [2020-07-20 02:05:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-07-20 02:05:13,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:13,434 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:13,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 02:05:13,434 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:13,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times [2020-07-20 02:05:13,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:13,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50485109] [2020-07-20 02:05:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-20 02:05:13,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50485109] [2020-07-20 02:05:13,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:13,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 02:05:13,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984785221] [2020-07-20 02:05:13,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 02:05:13,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 02:05:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:05:13,655 INFO L87 Difference]: Start difference. First operand 2788 states and 3646 transitions. Second operand 9 states. [2020-07-20 02:05:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:16,394 INFO L93 Difference]: Finished difference Result 8089 states and 11637 transitions. [2020-07-20 02:05:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 02:05:16,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2020-07-20 02:05:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:16,446 INFO L225 Difference]: With dead ends: 8089 [2020-07-20 02:05:16,446 INFO L226 Difference]: Without dead ends: 5323 [2020-07-20 02:05:16,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-07-20 02:05:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2020-07-20 02:05:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 4852. [2020-07-20 02:05:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2020-07-20 02:05:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6633 transitions. [2020-07-20 02:05:17,442 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6633 transitions. Word has length 155 [2020-07-20 02:05:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:17,443 INFO L479 AbstractCegarLoop]: Abstraction has 4852 states and 6633 transitions. [2020-07-20 02:05:17,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 02:05:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6633 transitions. [2020-07-20 02:05:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-20 02:05:17,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:17,453 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:17,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 02:05:17,454 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times [2020-07-20 02:05:17,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:17,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297452888] [2020-07-20 02:05:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-07-20 02:05:17,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297452888] [2020-07-20 02:05:17,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:17,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:05:17,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881661678] [2020-07-20 02:05:17,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:05:17,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:17,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:05:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:05:17,875 INFO L87 Difference]: Start difference. First operand 4852 states and 6633 transitions. Second operand 10 states. [2020-07-20 02:05:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:21,805 INFO L93 Difference]: Finished difference Result 12975 states and 19533 transitions. [2020-07-20 02:05:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 02:05:21,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2020-07-20 02:05:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:21,855 INFO L225 Difference]: With dead ends: 12975 [2020-07-20 02:05:21,855 INFO L226 Difference]: Without dead ends: 6726 [2020-07-20 02:05:21,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2020-07-20 02:05:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2020-07-20 02:05:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 6174. [2020-07-20 02:05:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2020-07-20 02:05:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 8297 transitions. [2020-07-20 02:05:22,758 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 8297 transitions. Word has length 156 [2020-07-20 02:05:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:22,759 INFO L479 AbstractCegarLoop]: Abstraction has 6174 states and 8297 transitions. [2020-07-20 02:05:22,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:05:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 8297 transitions. [2020-07-20 02:05:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-20 02:05:22,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:22,770 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:22,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 02:05:22,770 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1382123670, now seen corresponding path program 1 times [2020-07-20 02:05:22,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:22,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89893324] [2020-07-20 02:05:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-20 02:05:23,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89893324] [2020-07-20 02:05:23,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:23,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 02:05:23,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225126186] [2020-07-20 02:05:23,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 02:05:23,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 02:05:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:05:23,135 INFO L87 Difference]: Start difference. First operand 6174 states and 8297 transitions. Second operand 11 states. [2020-07-20 02:05:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:26,292 INFO L93 Difference]: Finished difference Result 12270 states and 16979 transitions. [2020-07-20 02:05:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 02:05:26,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2020-07-20 02:05:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:26,315 INFO L225 Difference]: With dead ends: 12270 [2020-07-20 02:05:26,315 INFO L226 Difference]: Without dead ends: 3143 [2020-07-20 02:05:26,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2020-07-20 02:05:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2020-07-20 02:05:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 2950. [2020-07-20 02:05:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2020-07-20 02:05:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3443 transitions. [2020-07-20 02:05:26,760 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3443 transitions. Word has length 207 [2020-07-20 02:05:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:26,761 INFO L479 AbstractCegarLoop]: Abstraction has 2950 states and 3443 transitions. [2020-07-20 02:05:26,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 02:05:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3443 transitions. [2020-07-20 02:05:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-20 02:05:26,767 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:26,767 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:26,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 02:05:26,768 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times [2020-07-20 02:05:26,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:26,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277329511] [2020-07-20 02:05:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e08281a [2020-07-20 02:05:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:05:26,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:05:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:05:26,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:05:26,970 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 02:05:26,970 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 02:05:26,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 02:05:27,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:05:27 BoogieIcfgContainer [2020-07-20 02:05:27,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 02:05:27,207 INFO L168 Benchmark]: Toolchain (without parser) took 42200.04 ms. Allocated memory was 138.4 MB in the beginning and 769.1 MB in the end (delta: 630.7 MB). Free memory was 101.6 MB in the beginning and 447.7 MB in the end (delta: -346.1 MB). Peak memory consumption was 284.6 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:27,209 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 02:05:27,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.82 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 180.8 MB in the end (delta: -79.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:27,219 INFO L168 Benchmark]: Boogie Preprocessor took 52.71 ms. Allocated memory is still 202.4 MB. Free memory was 180.8 MB in the beginning and 178.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:27,220 INFO L168 Benchmark]: RCFGBuilder took 712.44 ms. Allocated memory is still 202.4 MB. Free memory was 178.4 MB in the beginning and 142.3 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:27,220 INFO L168 Benchmark]: TraceAbstraction took 40983.66 ms. Allocated memory was 202.4 MB in the beginning and 769.1 MB in the end (delta: 566.8 MB). Free memory was 141.7 MB in the beginning and 447.7 MB in the end (delta: -306.1 MB). Peak memory consumption was 260.7 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:27,227 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 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 444.82 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 180.8 MB in the end (delta: -79.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.71 ms. Allocated memory is still 202.4 MB. Free memory was 180.8 MB in the beginning and 178.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 712.44 ms. Allocated memory is still 202.4 MB. Free memory was 178.4 MB in the beginning and 142.3 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40983.66 ms. Allocated memory was 202.4 MB in the beginning and 769.1 MB in the end (delta: 566.8 MB). Free memory was 141.7 MB in the beginning and 447.7 MB in the end (delta: -306.1 MB). Peak memory consumption was 260.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=13, \old(m_i)=7, \old(m_pc)=11, \old(m_st)=12, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=8, \old(t1_st)=4, \old(T2_E)=14, \old(t2_i)=6, \old(t2_pc)=9, \old(t2_st)=10, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L567] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L567] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L568] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L511] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L512] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L211] COND TRUE m_i == 1 [L212] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L512] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L513] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L324] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L329] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L513] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L514] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L514] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L515] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L357] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L362] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L515] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L257] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L252] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L291] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L291] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L305] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] t2_pc = 1 [L127] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L305] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L261] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L264] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L231] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L252] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L264] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1] [L277] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L51] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L52] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L425] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L425] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L52] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] m_pc = 1 [L59] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L277] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1] [L291] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L97] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L98] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L425] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit2_triggered()=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L425] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L98] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L291] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1] [L305] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L132] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 40.6s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2605 SDtfs, 11531 SDslu, 735 SDs, 0 SdLazy, 15832 SolverSat, 5833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 486 SyntacticMatches, 2 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6174occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 3916 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1715 ConstructedInterpolants, 0 QuantifiedInterpolants, 487945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 237/237 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...