/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 06:23:10,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 06:23:10,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 06:23:10,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 06:23:10,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 06:23:10,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 06:23:10,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 06:23:10,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 06:23:10,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 06:23:10,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 06:23:10,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 06:23:10,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 06:23:10,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 06:23:10,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 06:23:10,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 06:23:10,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 06:23:10,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 06:23:10,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 06:23:10,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 06:23:10,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 06:23:10,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 06:23:10,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 06:23:10,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 06:23:10,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 06:23:10,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 06:23:10,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 06:23:10,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 06:23:10,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 06:23:10,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 06:23:10,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 06:23:10,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 06:23:10,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 06:23:10,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 06:23:10,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 06:23:10,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 06:23:10,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 06:23:10,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 06:23:10,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 06:23:10,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 06:23:10,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 06:23:10,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 06:23:10,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 06:23:10,371 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 06:23:10,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 06:23:10,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 06:23:10,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 06:23:10,374 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 06:23:10,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 06:23:10,379 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 06:23:10,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 06:23:10,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 06:23:10,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 06:23:10,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 06:23:10,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 06:23:10,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 06:23:10,380 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 06:23:10,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 06:23:10,381 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 06:23:10,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 06:23:10,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 06:23:10,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 06:23:10,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 06:23:10,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 06:23:10,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:23:10,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 06:23:10,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 06:23:10,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 06:23:10,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 06:23:10,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 06:23:10,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 06:23:10,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 06:23:10,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 06:23:10,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 06:23:10,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 06:23:10,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 06:23:10,783 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 06:23:10,783 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 06:23:10,785 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 06:23:10,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6509b5f/9c740ceb12c446c4906422c8bf9b92ec/FLAG681b1c0eb [2020-07-20 06:23:11,393 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 06:23:11,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-07-20 06:23:11,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6509b5f/9c740ceb12c446c4906422c8bf9b92ec/FLAG681b1c0eb [2020-07-20 06:23:11,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6509b5f/9c740ceb12c446c4906422c8bf9b92ec [2020-07-20 06:23:11,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 06:23:11,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 06:23:11,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 06:23:11,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 06:23:11,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 06:23:11,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:11" (1/1) ... [2020-07-20 06:23:11,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcfe225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:11, skipping insertion in model container [2020-07-20 06:23:11,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:11" (1/1) ... [2020-07-20 06:23:11,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 06:23:11,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 06:23:12,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:23:12,007 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 06:23:12,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:23:12,077 INFO L208 MainTranslator]: Completed translation [2020-07-20 06:23:12,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12 WrapperNode [2020-07-20 06:23:12,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 06:23:12,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 06:23:12,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 06:23:12,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 06:23:12,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... [2020-07-20 06:23:12,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 06:23:12,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 06:23:12,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 06:23:12,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 06:23:12,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:23:12,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 06:23:12,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 06:23:12,385 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 06:23:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 06:23:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 06:23:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-20 06:23:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 06:23:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 06:23:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-20 06:23:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 06:23:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 06:23:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 06:23:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 06:23:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 06:23:12,387 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 06:23:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 06:23:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 06:23:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 06:23:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 06:23:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 06:23:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 06:23:12,389 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 06:23:12,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 06:23:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 06:23:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 06:23:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 06:23:12,389 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 06:23:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 06:23:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-20 06:23:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 06:23:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 06:23:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 06:23:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-20 06:23:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 06:23:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 06:23:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 06:23:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 06:23:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 06:23:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 06:23:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 06:23:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 06:23:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 06:23:12,911 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 06:23:12,912 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-20 06:23:12,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:12 BoogieIcfgContainer [2020-07-20 06:23:12,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 06:23:12,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 06:23:12,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 06:23:12,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 06:23:12,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:23:11" (1/3) ... [2020-07-20 06:23:12,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f2c322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:12, skipping insertion in model container [2020-07-20 06:23:12,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:12" (2/3) ... [2020-07-20 06:23:12,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f2c322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:12, skipping insertion in model container [2020-07-20 06:23:12,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:12" (3/3) ... [2020-07-20 06:23:12,928 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-07-20 06:23:12,937 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 06:23:12,944 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 06:23:12,962 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 06:23:12,990 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 06:23:12,990 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 06:23:12,990 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 06:23:12,990 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 06:23:12,991 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 06:23:12,991 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 06:23:12,991 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 06:23:12,991 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 06:23:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-20 06:23:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:13,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:13,033 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 06:23:13,033 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2020-07-20 06:23:13,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:13,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196431214] [2020-07-20 06:23:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:13,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196431214] [2020-07-20 06:23:13,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:13,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 06:23:13,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443084933] [2020-07-20 06:23:13,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 06:23:13,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 06:23:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-20 06:23:13,716 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 8 states. [2020-07-20 06:23:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:15,400 INFO L93 Difference]: Finished difference Result 412 states and 626 transitions. [2020-07-20 06:23:15,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:23:15,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-07-20 06:23:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:15,422 INFO L225 Difference]: With dead ends: 412 [2020-07-20 06:23:15,422 INFO L226 Difference]: Without dead ends: 247 [2020-07-20 06:23:15,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-07-20 06:23:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-07-20 06:23:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2020-07-20 06:23:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-20 06:23:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2020-07-20 06:23:15,527 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2020-07-20 06:23:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:15,527 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-07-20 06:23:15,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 06:23:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2020-07-20 06:23:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:15,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:15,537 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 06:23:15,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 06:23:15,540 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:15,540 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2020-07-20 06:23:15,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:15,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154337808] [2020-07-20 06:23:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:15,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154337808] [2020-07-20 06:23:15,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:15,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:23:15,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612792947] [2020-07-20 06:23:15,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:23:15,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:23:15,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:15,882 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 9 states. [2020-07-20 06:23:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:18,111 INFO L93 Difference]: Finished difference Result 579 states and 839 transitions. [2020-07-20 06:23:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 06:23:18,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2020-07-20 06:23:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:18,118 INFO L225 Difference]: With dead ends: 579 [2020-07-20 06:23:18,118 INFO L226 Difference]: Without dead ends: 439 [2020-07-20 06:23:18,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-07-20 06:23:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-07-20 06:23:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294. [2020-07-20 06:23:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-07-20 06:23:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 393 transitions. [2020-07-20 06:23:18,180 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 393 transitions. Word has length 90 [2020-07-20 06:23:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:18,181 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 393 transitions. [2020-07-20 06:23:18,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:23:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 393 transitions. [2020-07-20 06:23:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:18,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:18,185 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 06:23:18,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 06:23:18,185 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:18,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1952833149, now seen corresponding path program 1 times [2020-07-20 06:23:18,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:18,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522852715] [2020-07-20 06:23:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:18,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522852715] [2020-07-20 06:23:18,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:18,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:18,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284944156] [2020-07-20 06:23:18,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:18,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:18,468 INFO L87 Difference]: Start difference. First operand 294 states and 393 transitions. Second operand 10 states. [2020-07-20 06:23:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:19,701 INFO L93 Difference]: Finished difference Result 704 states and 993 transitions. [2020-07-20 06:23:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:23:19,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:19,710 INFO L225 Difference]: With dead ends: 704 [2020-07-20 06:23:19,711 INFO L226 Difference]: Without dead ends: 430 [2020-07-20 06:23:19,713 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 06:23:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-07-20 06:23:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 294. [2020-07-20 06:23:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-07-20 06:23:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2020-07-20 06:23:19,772 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 90 [2020-07-20 06:23:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:19,772 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2020-07-20 06:23:19,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2020-07-20 06:23:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:19,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:19,775 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 06:23:19,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 06:23:19,776 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 227206333, now seen corresponding path program 1 times [2020-07-20 06:23:19,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:19,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703416834] [2020-07-20 06:23:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:19,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703416834] [2020-07-20 06:23:19,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:19,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:19,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955449899] [2020-07-20 06:23:19,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:19,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:19,952 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand 10 states. [2020-07-20 06:23:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:21,211 INFO L93 Difference]: Finished difference Result 700 states and 971 transitions. [2020-07-20 06:23:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:23:21,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:21,216 INFO L225 Difference]: With dead ends: 700 [2020-07-20 06:23:21,216 INFO L226 Difference]: Without dead ends: 426 [2020-07-20 06:23:21,218 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 06:23:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-07-20 06:23:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 294. [2020-07-20 06:23:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-07-20 06:23:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 379 transitions. [2020-07-20 06:23:21,271 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 379 transitions. Word has length 90 [2020-07-20 06:23:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:21,272 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 379 transitions. [2020-07-20 06:23:21,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 379 transitions. [2020-07-20 06:23:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:21,274 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:21,275 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 06:23:21,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 06:23:21,275 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1418466941, now seen corresponding path program 1 times [2020-07-20 06:23:21,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:21,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559651972] [2020-07-20 06:23:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:21,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559651972] [2020-07-20 06:23:21,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:21,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:21,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029234036] [2020-07-20 06:23:21,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:21,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:21,444 INFO L87 Difference]: Start difference. First operand 294 states and 379 transitions. Second operand 10 states. [2020-07-20 06:23:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:23,252 INFO L93 Difference]: Finished difference Result 855 states and 1230 transitions. [2020-07-20 06:23:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 06:23:23,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:23,259 INFO L225 Difference]: With dead ends: 855 [2020-07-20 06:23:23,259 INFO L226 Difference]: Without dead ends: 581 [2020-07-20 06:23:23,262 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 06:23:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-07-20 06:23:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366. [2020-07-20 06:23:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-07-20 06:23:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2020-07-20 06:23:23,310 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 90 [2020-07-20 06:23:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:23,311 INFO L479 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2020-07-20 06:23:23,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2020-07-20 06:23:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:23,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:23,313 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 06:23:23,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 06:23:23,313 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1504622653, now seen corresponding path program 1 times [2020-07-20 06:23:23,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:23,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057187872] [2020-07-20 06:23:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:23,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057187872] [2020-07-20 06:23:23,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:23,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:23,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397719922] [2020-07-20 06:23:23,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:23,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:23,495 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 10 states. [2020-07-20 06:23:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:25,245 INFO L93 Difference]: Finished difference Result 877 states and 1164 transitions. [2020-07-20 06:23:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:23:25,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:25,250 INFO L225 Difference]: With dead ends: 877 [2020-07-20 06:23:25,250 INFO L226 Difference]: Without dead ends: 532 [2020-07-20 06:23:25,252 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 06:23:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-07-20 06:23:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2020-07-20 06:23:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-07-20 06:23:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 465 transitions. [2020-07-20 06:23:25,299 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 465 transitions. Word has length 90 [2020-07-20 06:23:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:25,300 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 465 transitions. [2020-07-20 06:23:25,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 465 transitions. [2020-07-20 06:23:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:25,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:25,301 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 06:23:25,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 06:23:25,302 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -523963457, now seen corresponding path program 1 times [2020-07-20 06:23:25,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:25,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095659334] [2020-07-20 06:23:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:25,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095659334] [2020-07-20 06:23:25,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:25,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:25,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364225636] [2020-07-20 06:23:25,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:25,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:25,525 INFO L87 Difference]: Start difference. First operand 376 states and 465 transitions. Second operand 10 states. [2020-07-20 06:23:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:27,269 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions. [2020-07-20 06:23:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 06:23:27,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:27,276 INFO L225 Difference]: With dead ends: 915 [2020-07-20 06:23:27,276 INFO L226 Difference]: Without dead ends: 560 [2020-07-20 06:23:27,278 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 06:23:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-07-20 06:23:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 396. [2020-07-20 06:23:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-07-20 06:23:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2020-07-20 06:23:27,323 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 90 [2020-07-20 06:23:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:27,325 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2020-07-20 06:23:27,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2020-07-20 06:23:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:27,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:27,327 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 06:23:27,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 06:23:27,328 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -275816963, now seen corresponding path program 1 times [2020-07-20 06:23:27,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:27,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958047664] [2020-07-20 06:23:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:27,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958047664] [2020-07-20 06:23:27,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:27,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:27,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565817258] [2020-07-20 06:23:27,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:27,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:27,594 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand 10 states. [2020-07-20 06:23:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:29,337 INFO L93 Difference]: Finished difference Result 939 states and 1222 transitions. [2020-07-20 06:23:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 06:23:29,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:29,343 INFO L225 Difference]: With dead ends: 939 [2020-07-20 06:23:29,343 INFO L226 Difference]: Without dead ends: 564 [2020-07-20 06:23:29,345 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 06:23:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-07-20 06:23:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 406. [2020-07-20 06:23:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-07-20 06:23:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions. [2020-07-20 06:23:29,386 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 90 [2020-07-20 06:23:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:29,387 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions. [2020-07-20 06:23:29,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions. [2020-07-20 06:23:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:29,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:29,389 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 06:23:29,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 06:23:29,389 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash -348203521, now seen corresponding path program 1 times [2020-07-20 06:23:29,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:29,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971193083] [2020-07-20 06:23:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:29,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971193083] [2020-07-20 06:23:29,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:29,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554225037] [2020-07-20 06:23:29,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:29,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:29,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:29,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:29,565 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand 10 states. [2020-07-20 06:23:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:31,418 INFO L93 Difference]: Finished difference Result 1144 states and 1493 transitions. [2020-07-20 06:23:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 06:23:31,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-20 06:23:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:31,424 INFO L225 Difference]: With dead ends: 1144 [2020-07-20 06:23:31,425 INFO L226 Difference]: Without dead ends: 758 [2020-07-20 06:23:31,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2020-07-20 06:23:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2020-07-20 06:23:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 467. [2020-07-20 06:23:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-07-20 06:23:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2020-07-20 06:23:31,495 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 90 [2020-07-20 06:23:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:31,496 INFO L479 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2020-07-20 06:23:31,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2020-07-20 06:23:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 06:23:31,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:31,499 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 06:23:31,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 06:23:31,500 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times [2020-07-20 06:23:31,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:31,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767096410] [2020-07-20 06:23:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:31,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767096410] [2020-07-20 06:23:31,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:31,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 06:23:31,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791103452] [2020-07-20 06:23:31,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 06:23:31,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 06:23:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 06:23:31,634 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 7 states. [2020-07-20 06:23:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:33,301 INFO L93 Difference]: Finished difference Result 1503 states and 1877 transitions. [2020-07-20 06:23:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:23:33,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2020-07-20 06:23:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:33,309 INFO L225 Difference]: With dead ends: 1503 [2020-07-20 06:23:33,309 INFO L226 Difference]: Without dead ends: 1058 [2020-07-20 06:23:33,311 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 06:23:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2020-07-20 06:23:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 847. [2020-07-20 06:23:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-07-20 06:23:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1018 transitions. [2020-07-20 06:23:33,389 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1018 transitions. Word has length 90 [2020-07-20 06:23:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:33,390 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1018 transitions. [2020-07-20 06:23:33,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 06:23:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1018 transitions. [2020-07-20 06:23:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 06:23:33,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:33,392 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 06:23:33,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 06:23:33,392 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times [2020-07-20 06:23:33,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:33,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323991991] [2020-07-20 06:23:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:23:33,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323991991] [2020-07-20 06:23:33,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:33,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 06:23:33,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35081566] [2020-07-20 06:23:33,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 06:23:33,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 06:23:33,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 06:23:33,556 INFO L87 Difference]: Start difference. First operand 847 states and 1018 transitions. Second operand 7 states. [2020-07-20 06:23:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:35,249 INFO L93 Difference]: Finished difference Result 2813 states and 3701 transitions. [2020-07-20 06:23:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:23:35,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2020-07-20 06:23:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:35,263 INFO L225 Difference]: With dead ends: 2813 [2020-07-20 06:23:35,263 INFO L226 Difference]: Without dead ends: 1993 [2020-07-20 06:23:35,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 06:23:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2020-07-20 06:23:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1710. [2020-07-20 06:23:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2020-07-20 06:23:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2141 transitions. [2020-07-20 06:23:35,486 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2141 transitions. Word has length 91 [2020-07-20 06:23:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:35,486 INFO L479 AbstractCegarLoop]: Abstraction has 1710 states and 2141 transitions. [2020-07-20 06:23:35,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 06:23:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2141 transitions. [2020-07-20 06:23:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-20 06:23:35,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:35,489 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 06:23:35,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 06:23:35,490 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:35,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1387972843, now seen corresponding path program 1 times [2020-07-20 06:23:35,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:35,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091739685] [2020-07-20 06:23:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:35,640 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 06:23:35,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091739685] [2020-07-20 06:23:35,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:35,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:23:35,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290150446] [2020-07-20 06:23:35,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:23:35,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:35,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:23:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:35,642 INFO L87 Difference]: Start difference. First operand 1710 states and 2141 transitions. Second operand 9 states. [2020-07-20 06:23:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:37,084 INFO L93 Difference]: Finished difference Result 3845 states and 5084 transitions. [2020-07-20 06:23:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 06:23:37,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2020-07-20 06:23:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:37,098 INFO L225 Difference]: With dead ends: 3845 [2020-07-20 06:23:37,098 INFO L226 Difference]: Without dead ends: 2157 [2020-07-20 06:23:37,105 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 06:23:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2020-07-20 06:23:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1767. [2020-07-20 06:23:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-07-20 06:23:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2232 transitions. [2020-07-20 06:23:37,323 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2232 transitions. Word has length 111 [2020-07-20 06:23:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:37,324 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 2232 transitions. [2020-07-20 06:23:37,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:23:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2232 transitions. [2020-07-20 06:23:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-20 06:23:37,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:37,328 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 06:23:37,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 06:23:37,329 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times [2020-07-20 06:23:37,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:37,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255585810] [2020-07-20 06:23:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:37,537 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 06:23:37,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255585810] [2020-07-20 06:23:37,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:37,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 06:23:37,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832076258] [2020-07-20 06:23:37,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 06:23:37,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:37,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 06:23:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 06:23:37,540 INFO L87 Difference]: Start difference. First operand 1767 states and 2232 transitions. Second operand 8 states. [2020-07-20 06:23:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:40,105 INFO L93 Difference]: Finished difference Result 5835 states and 7942 transitions. [2020-07-20 06:23:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 06:23:40,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-07-20 06:23:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:40,126 INFO L225 Difference]: With dead ends: 5835 [2020-07-20 06:23:40,127 INFO L226 Difference]: Without dead ends: 3120 [2020-07-20 06:23:40,139 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 06:23:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2020-07-20 06:23:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2788. [2020-07-20 06:23:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2020-07-20 06:23:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3646 transitions. [2020-07-20 06:23:40,590 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3646 transitions. Word has length 111 [2020-07-20 06:23:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:40,590 INFO L479 AbstractCegarLoop]: Abstraction has 2788 states and 3646 transitions. [2020-07-20 06:23:40,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 06:23:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3646 transitions. [2020-07-20 06:23:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-07-20 06:23:40,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:40,598 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 06:23:40,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 06:23:40,599 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times [2020-07-20 06:23:40,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:40,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305295867] [2020-07-20 06:23:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:40,900 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 06:23:40,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305295867] [2020-07-20 06:23:40,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:40,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:23:40,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838979852] [2020-07-20 06:23:40,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:23:40,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:23:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:23:40,903 INFO L87 Difference]: Start difference. First operand 2788 states and 3646 transitions. Second operand 9 states. [2020-07-20 06:23:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:43,769 INFO L93 Difference]: Finished difference Result 8089 states and 11637 transitions. [2020-07-20 06:23:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 06:23:43,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2020-07-20 06:23:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:43,818 INFO L225 Difference]: With dead ends: 8089 [2020-07-20 06:23:43,818 INFO L226 Difference]: Without dead ends: 5323 [2020-07-20 06:23:43,847 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 06:23:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2020-07-20 06:23:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 4852. [2020-07-20 06:23:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2020-07-20 06:23:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6633 transitions. [2020-07-20 06:23:44,822 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6633 transitions. Word has length 155 [2020-07-20 06:23:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:44,823 INFO L479 AbstractCegarLoop]: Abstraction has 4852 states and 6633 transitions. [2020-07-20 06:23:44,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:23:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6633 transitions. [2020-07-20 06:23:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-20 06:23:44,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:44,832 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 06:23:44,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 06:23:44,833 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:44,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:44,834 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times [2020-07-20 06:23:44,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:44,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345682006] [2020-07-20 06:23:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:45,223 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 06:23:45,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345682006] [2020-07-20 06:23:45,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:45,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 06:23:45,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072412988] [2020-07-20 06:23:45,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 06:23:45,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:45,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 06:23:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:23:45,228 INFO L87 Difference]: Start difference. First operand 4852 states and 6633 transitions. Second operand 10 states. [2020-07-20 06:23:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:49,061 INFO L93 Difference]: Finished difference Result 12975 states and 19533 transitions. [2020-07-20 06:23:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 06:23:49,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2020-07-20 06:23:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:49,139 INFO L225 Difference]: With dead ends: 12975 [2020-07-20 06:23:49,140 INFO L226 Difference]: Without dead ends: 6726 [2020-07-20 06:23:49,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2020-07-20 06:23:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2020-07-20 06:23:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 6174. [2020-07-20 06:23:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2020-07-20 06:23:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 8297 transitions. [2020-07-20 06:23:50,264 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 8297 transitions. Word has length 156 [2020-07-20 06:23:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:50,267 INFO L479 AbstractCegarLoop]: Abstraction has 6174 states and 8297 transitions. [2020-07-20 06:23:50,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 06:23:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 8297 transitions. [2020-07-20 06:23:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-20 06:23:50,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:50,277 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 06:23:50,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 06:23:50,277 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1382123670, now seen corresponding path program 1 times [2020-07-20 06:23:50,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:50,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409572298] [2020-07-20 06:23:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:23:50,748 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 06:23:50,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409572298] [2020-07-20 06:23:50,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:23:50,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 06:23:50,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927382608] [2020-07-20 06:23:50,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 06:23:50,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:23:50,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 06:23:50,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:23:50,755 INFO L87 Difference]: Start difference. First operand 6174 states and 8297 transitions. Second operand 11 states. [2020-07-20 06:23:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:23:53,438 INFO L93 Difference]: Finished difference Result 12270 states and 16979 transitions. [2020-07-20 06:23:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 06:23:53,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2020-07-20 06:23:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:23:53,457 INFO L225 Difference]: With dead ends: 12270 [2020-07-20 06:23:53,457 INFO L226 Difference]: Without dead ends: 3143 [2020-07-20 06:23:53,483 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2020-07-20 06:23:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2020-07-20 06:23:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 2950. [2020-07-20 06:23:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2020-07-20 06:23:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3443 transitions. [2020-07-20 06:23:53,911 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3443 transitions. Word has length 207 [2020-07-20 06:23:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:23:53,912 INFO L479 AbstractCegarLoop]: Abstraction has 2950 states and 3443 transitions. [2020-07-20 06:23:53,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 06:23:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3443 transitions. [2020-07-20 06:23:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-20 06:23:53,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:23:53,918 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 06:23:53,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 06:23:53,918 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:23:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:23:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times [2020-07-20 06:23:53,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:23:53,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725794242] [2020-07-20 06:23:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@78a44ab6 [2020-07-20 06:23:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:23:53,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:23:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:23:53,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:23:54,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 06:23:54,071 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 06:23:54,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 06:23:54,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:23:54 BoogieIcfgContainer [2020-07-20 06:23:54,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 06:23:54,266 INFO L168 Benchmark]: Toolchain (without parser) took 42552.87 ms. Allocated memory was 144.7 MB in the beginning and 654.8 MB in the end (delta: 510.1 MB). Free memory was 102.2 MB in the beginning and 466.9 MB in the end (delta: -364.7 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:54,268 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 06:23:54,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.71 ms. Allocated memory is still 144.7 MB. Free memory was 101.8 MB in the beginning and 87.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:54,276 INFO L168 Benchmark]: Boogie Preprocessor took 240.73 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 87.5 MB in the beginning and 182.1 MB in the end (delta: -94.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:54,277 INFO L168 Benchmark]: RCFGBuilder took 598.85 ms. Allocated memory is still 205.0 MB. Free memory was 182.1 MB in the beginning and 145.4 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:54,280 INFO L168 Benchmark]: TraceAbstraction took 41341.66 ms. Allocated memory was 205.0 MB in the beginning and 654.8 MB in the end (delta: 449.8 MB). Free memory was 145.4 MB in the beginning and 466.9 MB in the end (delta: -321.6 MB). Peak memory consumption was 128.3 MB. Max. memory is 7.1 GB. [2020-07-20 06:23:54,286 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.26 ms. Allocated memory is still 144.7 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.71 ms. Allocated memory is still 144.7 MB. Free memory was 101.8 MB in the beginning and 87.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 240.73 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 87.5 MB in the beginning and 182.1 MB in the end (delta: -94.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 598.85 ms. Allocated memory is still 205.0 MB. Free memory was 182.1 MB in the beginning and 145.4 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41341.66 ms. Allocated memory was 205.0 MB in the beginning and 654.8 MB in the end (delta: 449.8 MB). Free memory was 145.4 MB in the beginning and 466.9 MB in the end (delta: -321.6 MB). Peak memory consumption was 128.3 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)=17, \old(E_2)=6, \old(M_E)=14, \old(m_i)=8, \old(m_pc)=12, \old(m_st)=13, \old(T1_E)=4, \old(t1_i)=16, \old(t1_pc)=9, \old(t1_st)=5, \old(T2_E)=15, \old(t2_i)=7, \old(t2_pc)=10, \old(t2_st)=11, 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=-2, 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=-2, 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=-2, tmp_ndt_2=3, 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=-2, tmp_ndt_2=3, 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=-2, tmp_ndt_2=3, 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: 41.0s, 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, 15839 SolverSat, 5836 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 486 SyntacticMatches, 2 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.4s 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.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 3916 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s 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...