/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:35:42,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:35:42,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:35:42,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:35:42,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:35:42,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:35:42,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:35:42,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:35:42,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:35:42,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:35:42,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:35:42,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:35:42,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:35:42,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:35:42,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:35:42,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:35:42,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:35:42,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:35:42,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:35:42,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:35:42,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:35:42,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:35:42,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:35:42,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:35:42,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:35:42,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:35:42,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:35:42,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:35:42,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:35:42,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:35:42,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:35:42,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:35:42,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:35:42,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:35:42,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:35:42,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:35:42,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:35:42,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:35:42,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:35:42,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:35:42,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:35:42,425 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-07 11:35:42,468 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:35:42,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:35:42,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:35:42,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:35:42,471 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:35:42,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:35:42,471 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:35:42,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:35:42,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:35:42,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:35:42,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:35:42,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:35:42,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:35:42,473 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:35:42,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:35:42,473 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:35:42,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:35:42,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:35:42,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:35:42,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:35:42,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:35:42,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:35:42,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:35:42,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:35:42,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:35:42,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:35:42,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:35:42,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:35:42,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:35:42,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:35:42,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:35:42,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:35:42,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:35:42,954 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:35:42,955 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:35:42,957 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-07 11:35:43,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607301030/c05cb46e72a74f47a3a5abe979b577b4/FLAG2fab36c92 [2020-07-07 11:35:43,676 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:35:43,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-07 11:35:43,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607301030/c05cb46e72a74f47a3a5abe979b577b4/FLAG2fab36c92 [2020-07-07 11:35:44,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607301030/c05cb46e72a74f47a3a5abe979b577b4 [2020-07-07 11:35:44,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:35:44,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:35:44,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:35:44,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:35:44,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:35:44,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6ef254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44, skipping insertion in model container [2020-07-07 11:35:44,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:35:44,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:35:44,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:35:44,409 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:35:44,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:35:44,519 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:35:44,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44 WrapperNode [2020-07-07 11:35:44,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:35:44,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:35:44,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:35:44,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:35:44,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (1/1) ... [2020-07-07 11:35:44,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:35:44,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:35:44,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:35:44,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:35:44,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (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-07 11:35:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:35:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:35:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-07 11:35:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-07 11:35:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-07 11:35:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-07 11:35:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-07 11:35:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-07 11:35:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-07 11:35:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-07 11:35:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-07 11:35:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-07 11:35:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-07 11:35:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-07 11:35:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:35:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-07 11:35:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-07 11:35:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:35:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:35:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:35:45,375 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:35:45,375 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-07 11:35:45,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:35:45 BoogieIcfgContainer [2020-07-07 11:35:45,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:35:45,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:35:45,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:35:45,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:35:45,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:35:44" (1/3) ... [2020-07-07 11:35:45,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:35:45, skipping insertion in model container [2020-07-07 11:35:45,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:35:44" (2/3) ... [2020-07-07 11:35:45,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:35:45, skipping insertion in model container [2020-07-07 11:35:45,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:35:45" (3/3) ... [2020-07-07 11:35:45,394 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-07-07 11:35:45,405 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:35:45,416 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:35:45,430 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:35:45,473 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:35:45,474 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:35:45,474 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:35:45,474 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:35:45,474 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:35:45,474 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:35:45,474 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:35:45,475 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:35:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-07-07 11:35:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:45,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:45,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:45,520 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2020-07-07 11:35:45,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:45,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019692841] [2020-07-07 11:35:45,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:46,180 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-07 11:35:46,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019692841] [2020-07-07 11:35:46,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:46,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:35:46,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915960027] [2020-07-07 11:35:46,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:35:46,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:46,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:35:46,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:46,215 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 9 states. [2020-07-07 11:35:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:48,755 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-07-07 11:35:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:35:48,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-07-07 11:35:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:48,809 INFO L225 Difference]: With dead ends: 522 [2020-07-07 11:35:48,809 INFO L226 Difference]: Without dead ends: 371 [2020-07-07 11:35:48,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:35:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-07-07 11:35:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2020-07-07 11:35:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-07 11:35:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2020-07-07 11:35:48,943 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 78 [2020-07-07 11:35:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:48,944 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2020-07-07 11:35:48,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:35:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2020-07-07 11:35:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:48,948 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:48,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:48,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:35:48,950 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash 211359051, now seen corresponding path program 1 times [2020-07-07 11:35:48,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:48,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465833505] [2020-07-07 11:35:48,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:49,259 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-07 11:35:49,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465833505] [2020-07-07 11:35:49,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:49,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:49,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749487428] [2020-07-07 11:35:49,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:49,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:49,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:49,264 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. Second operand 10 states. [2020-07-07 11:35:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:50,693 INFO L93 Difference]: Finished difference Result 599 states and 848 transitions. [2020-07-07 11:35:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:35:50,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-07 11:35:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:50,700 INFO L225 Difference]: With dead ends: 599 [2020-07-07 11:35:50,700 INFO L226 Difference]: Without dead ends: 361 [2020-07-07 11:35:50,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:35:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-07-07 11:35:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2020-07-07 11:35:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-07 11:35:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2020-07-07 11:35:50,762 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 78 [2020-07-07 11:35:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:50,762 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2020-07-07 11:35:50,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2020-07-07 11:35:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:50,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:50,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:50,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:35:50,771 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:50,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2119705461, now seen corresponding path program 1 times [2020-07-07 11:35:50,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:50,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587728473] [2020-07-07 11:35:50,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:50,996 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-07 11:35:50,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587728473] [2020-07-07 11:35:50,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:50,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:50,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178882422] [2020-07-07 11:35:50,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:51,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:51,002 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand 10 states. [2020-07-07 11:35:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:52,761 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2020-07-07 11:35:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:35:52,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-07 11:35:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:52,767 INFO L225 Difference]: With dead ends: 722 [2020-07-07 11:35:52,767 INFO L226 Difference]: Without dead ends: 484 [2020-07-07 11:35:52,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:35:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-07-07 11:35:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2020-07-07 11:35:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-07-07 11:35:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2020-07-07 11:35:52,815 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 78 [2020-07-07 11:35:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:52,816 INFO L479 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2020-07-07 11:35:52,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2020-07-07 11:35:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:52,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:52,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:52,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:35:52,819 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash -579817174, now seen corresponding path program 1 times [2020-07-07 11:35:52,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:52,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836255828] [2020-07-07 11:35:52,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:53,002 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-07 11:35:53,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836255828] [2020-07-07 11:35:53,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:53,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:53,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568912019] [2020-07-07 11:35:53,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:53,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:53,005 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand 10 states. [2020-07-07 11:35:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:54,406 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2020-07-07 11:35:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:35:54,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-07 11:35:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:54,411 INFO L225 Difference]: With dead ends: 744 [2020-07-07 11:35:54,411 INFO L226 Difference]: Without dead ends: 455 [2020-07-07 11:35:54,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 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-07 11:35:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-07-07 11:35:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 329. [2020-07-07 11:35:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-07-07 11:35:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2020-07-07 11:35:54,452 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 78 [2020-07-07 11:35:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:54,452 INFO L479 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2020-07-07 11:35:54,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2020-07-07 11:35:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:54,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:54,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:54,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:35:54,456 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash -156170452, now seen corresponding path program 1 times [2020-07-07 11:35:54,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:54,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714957256] [2020-07-07 11:35:54,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:54,706 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-07 11:35:54,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714957256] [2020-07-07 11:35:54,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:54,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:54,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632849240] [2020-07-07 11:35:54,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:54,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:54,710 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand 10 states. [2020-07-07 11:35:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:56,635 INFO L93 Difference]: Finished difference Result 774 states and 1027 transitions. [2020-07-07 11:35:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:35:56,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-07 11:35:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:56,643 INFO L225 Difference]: With dead ends: 774 [2020-07-07 11:35:56,644 INFO L226 Difference]: Without dead ends: 465 [2020-07-07 11:35:56,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:35:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-07-07 11:35:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2020-07-07 11:35:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-07-07 11:35:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2020-07-07 11:35:56,752 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 78 [2020-07-07 11:35:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:56,752 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2020-07-07 11:35:56,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2020-07-07 11:35:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:56,757 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:56,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:56,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:35:56,760 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 118589162, now seen corresponding path program 1 times [2020-07-07 11:35:56,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:56,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244186807] [2020-07-07 11:35:56,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:57,025 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-07 11:35:57,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244186807] [2020-07-07 11:35:57,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:57,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:35:57,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944611679] [2020-07-07 11:35:57,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:35:57,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:35:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:57,029 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand 10 states. [2020-07-07 11:35:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:59,054 INFO L93 Difference]: Finished difference Result 920 states and 1216 transitions. [2020-07-07 11:35:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 11:35:59,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-07 11:35:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:59,064 INFO L225 Difference]: With dead ends: 920 [2020-07-07 11:35:59,064 INFO L226 Difference]: Without dead ends: 600 [2020-07-07 11:35:59,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-07 11:35:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-07-07 11:35:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 375. [2020-07-07 11:35:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-07 11:35:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 445 transitions. [2020-07-07 11:35:59,148 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 445 transitions. Word has length 78 [2020-07-07 11:35:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:59,149 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 445 transitions. [2020-07-07 11:35:59,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:35:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 445 transitions. [2020-07-07 11:35:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 11:35:59,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:59,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:59,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:35:59,153 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2020-07-07 11:35:59,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:59,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329047342] [2020-07-07 11:35:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:59,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-07 11:35:59,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329047342] [2020-07-07 11:35:59,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:59,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:35:59,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189352728] [2020-07-07 11:35:59,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:35:59,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:35:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:35:59,451 INFO L87 Difference]: Start difference. First operand 375 states and 445 transitions. Second operand 7 states. [2020-07-07 11:36:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:01,315 INFO L93 Difference]: Finished difference Result 1208 states and 1535 transitions. [2020-07-07 11:36:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:36:01,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-07-07 11:36:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:01,325 INFO L225 Difference]: With dead ends: 1208 [2020-07-07 11:36:01,326 INFO L226 Difference]: Without dead ends: 853 [2020-07-07 11:36:01,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:36:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2020-07-07 11:36:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 751. [2020-07-07 11:36:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-07-07 11:36:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 921 transitions. [2020-07-07 11:36:01,464 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 921 transitions. Word has length 78 [2020-07-07 11:36:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:01,465 INFO L479 AbstractCegarLoop]: Abstraction has 751 states and 921 transitions. [2020-07-07 11:36:01,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:36:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 921 transitions. [2020-07-07 11:36:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-07 11:36:01,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:01,470 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:01,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:36:01,471 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 972462964, now seen corresponding path program 1 times [2020-07-07 11:36:01,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:01,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745426720] [2020-07-07 11:36:01,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 11:36:01,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745426720] [2020-07-07 11:36:01,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477226489] [2020-07-07 11:36:01,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:36:02,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:36:02,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:02,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-07 11:36:02,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509475415] [2020-07-07 11:36:02,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:02,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:02,095 INFO L87 Difference]: Start difference. First operand 751 states and 921 transitions. Second operand 3 states. [2020-07-07 11:36:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:02,263 INFO L93 Difference]: Finished difference Result 2037 states and 2550 transitions. [2020-07-07 11:36:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:02,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-07-07 11:36:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:02,272 INFO L225 Difference]: With dead ends: 2037 [2020-07-07 11:36:02,273 INFO L226 Difference]: Without dead ends: 1033 [2020-07-07 11:36:02,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2020-07-07 11:36:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2020-07-07 11:36:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-07-07 11:36:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1261 transitions. [2020-07-07 11:36:02,433 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1261 transitions. Word has length 123 [2020-07-07 11:36:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:02,433 INFO L479 AbstractCegarLoop]: Abstraction has 1033 states and 1261 transitions. [2020-07-07 11:36:02,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1261 transitions. [2020-07-07 11:36:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-07-07 11:36:02,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:02,438 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:02,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-07 11:36:02,655 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1660958730, now seen corresponding path program 1 times [2020-07-07 11:36:02,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:02,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490181772] [2020-07-07 11:36:02,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-07 11:36:03,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490181772] [2020-07-07 11:36:03,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649028644] [2020-07-07 11:36:03,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:03,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:36:03,186 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:36:03,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:03,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:36:03,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467260834] [2020-07-07 11:36:03,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:03,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:03,254 INFO L87 Difference]: Start difference. First operand 1033 states and 1261 transitions. Second operand 3 states. [2020-07-07 11:36:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:03,477 INFO L93 Difference]: Finished difference Result 2478 states and 3187 transitions. [2020-07-07 11:36:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:03,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-07-07 11:36:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:03,495 INFO L225 Difference]: With dead ends: 2478 [2020-07-07 11:36:03,495 INFO L226 Difference]: Without dead ends: 1466 [2020-07-07 11:36:03,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-07-07 11:36:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1460. [2020-07-07 11:36:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2020-07-07 11:36:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1762 transitions. [2020-07-07 11:36:03,673 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1762 transitions. Word has length 158 [2020-07-07 11:36:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:03,675 INFO L479 AbstractCegarLoop]: Abstraction has 1460 states and 1762 transitions. [2020-07-07 11:36:03,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1762 transitions. [2020-07-07 11:36:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-07-07 11:36:03,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:03,681 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:03,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:03,897 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1638316670, now seen corresponding path program 1 times [2020-07-07 11:36:03,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:03,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13341787] [2020-07-07 11:36:03,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-07 11:36:04,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13341787] [2020-07-07 11:36:04,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690778032] [2020-07-07 11:36:04,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:04,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 11:36:04,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-07 11:36:04,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:04,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-07 11:36:04,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555128255] [2020-07-07 11:36:04,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:04,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:04,868 INFO L87 Difference]: Start difference. First operand 1460 states and 1762 transitions. Second operand 3 states. [2020-07-07 11:36:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:05,101 INFO L93 Difference]: Finished difference Result 2442 states and 2935 transitions. [2020-07-07 11:36:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:05,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-07-07 11:36:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:05,118 INFO L225 Difference]: With dead ends: 2442 [2020-07-07 11:36:05,118 INFO L226 Difference]: Without dead ends: 1459 [2020-07-07 11:36:05,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-07-07 11:36:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2020-07-07 11:36:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2020-07-07 11:36:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1719 transitions. [2020-07-07 11:36:05,369 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1719 transitions. Word has length 159 [2020-07-07 11:36:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:05,372 INFO L479 AbstractCegarLoop]: Abstraction has 1459 states and 1719 transitions. [2020-07-07 11:36:05,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1719 transitions. [2020-07-07 11:36:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-07 11:36:05,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:05,382 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:05,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 11:36:05,598 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1505336733, now seen corresponding path program 1 times [2020-07-07 11:36:05,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:05,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996215388] [2020-07-07 11:36:05,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-07-07 11:36:06,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996215388] [2020-07-07 11:36:06,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318286993] [2020-07-07 11:36:06,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,175 INFO L264 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:36:06,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-07-07 11:36:06,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:06,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-07 11:36:06,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227603520] [2020-07-07 11:36:06,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:06,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:06,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:06,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:06,255 INFO L87 Difference]: Start difference. First operand 1459 states and 1719 transitions. Second operand 3 states. [2020-07-07 11:36:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:06,458 INFO L93 Difference]: Finished difference Result 2891 states and 3468 transitions. [2020-07-07 11:36:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:06,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-07 11:36:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:06,473 INFO L225 Difference]: With dead ends: 2891 [2020-07-07 11:36:06,473 INFO L226 Difference]: Without dead ends: 1453 [2020-07-07 11:36:06,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-07-07 11:36:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2020-07-07 11:36:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2020-07-07 11:36:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1691 transitions. [2020-07-07 11:36:06,647 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1691 transitions. Word has length 177 [2020-07-07 11:36:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:06,648 INFO L479 AbstractCegarLoop]: Abstraction has 1453 states and 1691 transitions. [2020-07-07 11:36:06,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1691 transitions. [2020-07-07 11:36:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-07-07 11:36:06,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:06,654 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:06,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:06,868 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491229, now seen corresponding path program 1 times [2020-07-07 11:36:06,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:06,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122057754] [2020-07-07 11:36:06,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-07 11:36:07,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122057754] [2020-07-07 11:36:07,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598151688] [2020-07-07 11:36:07,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:07,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:36:07,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-07 11:36:07,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:07,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:36:07,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691812707] [2020-07-07 11:36:07,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:07,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:07,520 INFO L87 Difference]: Start difference. First operand 1453 states and 1691 transitions. Second operand 3 states. [2020-07-07 11:36:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:07,717 INFO L93 Difference]: Finished difference Result 3376 states and 3967 transitions. [2020-07-07 11:36:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:07,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-07-07 11:36:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:07,727 INFO L225 Difference]: With dead ends: 3376 [2020-07-07 11:36:07,728 INFO L226 Difference]: Without dead ends: 967 [2020-07-07 11:36:07,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2020-07-07 11:36:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2020-07-07 11:36:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-07 11:36:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1101 transitions. [2020-07-07 11:36:07,875 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1101 transitions. Word has length 178 [2020-07-07 11:36:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:07,880 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1101 transitions. [2020-07-07 11:36:07,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1101 transitions. [2020-07-07 11:36:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-07-07 11:36:07,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:07,885 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:08,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-07 11:36:08,101 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2020-07-07 11:36:08,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:08,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839581975] [2020-07-07 11:36:08,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-07 11:36:08,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839581975] [2020-07-07 11:36:08,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515462381] [2020-07-07 11:36:08,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:08,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-07 11:36:08,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-07 11:36:08,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:36:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-07 11:36:08,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144601755] [2020-07-07 11:36:08,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:36:08,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:36:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:08,901 INFO L87 Difference]: Start difference. First operand 967 states and 1101 transitions. Second operand 12 states. [2020-07-07 11:36:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:11,773 INFO L93 Difference]: Finished difference Result 1223 states and 1418 transitions. [2020-07-07 11:36:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 11:36:11,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2020-07-07 11:36:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:11,787 INFO L225 Difference]: With dead ends: 1223 [2020-07-07 11:36:11,787 INFO L226 Difference]: Without dead ends: 1220 [2020-07-07 11:36:11,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-07 11:36:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-07-07 11:36:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1172. [2020-07-07 11:36:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2020-07-07 11:36:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2020-07-07 11:36:11,984 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 178 [2020-07-07 11:36:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:11,985 INFO L479 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2020-07-07 11:36:11,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:36:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2020-07-07 11:36:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-07-07 11:36:11,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:11,992 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:12,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:12,209 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2020-07-07 11:36:12,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:12,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441186987] [2020-07-07 11:36:12,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-07-07 11:36:12,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441186987] [2020-07-07 11:36:12,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417846285] [2020-07-07 11:36:12,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:12,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:36:12,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-07 11:36:12,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:12,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-07 11:36:12,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121579892] [2020-07-07 11:36:12,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:12,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:12,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:12,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:12,777 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 3 states. [2020-07-07 11:36:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:12,955 INFO L93 Difference]: Finished difference Result 1969 states and 2271 transitions. [2020-07-07 11:36:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:12,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-07-07 11:36:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:12,969 INFO L225 Difference]: With dead ends: 1969 [2020-07-07 11:36:12,970 INFO L226 Difference]: Without dead ends: 1186 [2020-07-07 11:36:12,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-07-07 11:36:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2020-07-07 11:36:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2020-07-07 11:36:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1353 transitions. [2020-07-07 11:36:13,117 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1353 transitions. Word has length 182 [2020-07-07 11:36:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:13,119 INFO L479 AbstractCegarLoop]: Abstraction has 1186 states and 1353 transitions. [2020-07-07 11:36:13,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1353 transitions. [2020-07-07 11:36:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-07 11:36:13,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:13,124 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:13,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-07 11:36:13,338 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2020-07-07 11:36:13,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:13,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036193241] [2020-07-07 11:36:13,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:36:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:36:13,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:36:13,499 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:36:13,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 11:36:13,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:36:13 BoogieIcfgContainer [2020-07-07 11:36:13,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:36:13,773 INFO L168 Benchmark]: Toolchain (without parser) took 29693.75 ms. Allocated memory was 137.9 MB in the beginning and 544.2 MB in the end (delta: 406.3 MB). Free memory was 102.3 MB in the beginning and 253.4 MB in the end (delta: -151.1 MB). Peak memory consumption was 255.2 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:13,775 INFO L168 Benchmark]: CDTParser took 2.33 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 11:36:13,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.40 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 88.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:13,788 INFO L168 Benchmark]: Boogie Preprocessor took 146.04 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 88.5 MB in the beginning and 178.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:13,790 INFO L168 Benchmark]: RCFGBuilder took 715.91 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 146.0 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:13,791 INFO L168 Benchmark]: TraceAbstraction took 28378.19 ms. Allocated memory was 201.3 MB in the beginning and 544.2 MB in the end (delta: 342.9 MB). Free memory was 145.3 MB in the beginning and 253.4 MB in the end (delta: -108.1 MB). Peak memory consumption was 234.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:13,801 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.33 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 445.40 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 88.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.04 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 88.5 MB in the beginning and 178.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 715.91 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 146.0 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28378.19 ms. Allocated memory was 201.3 MB in the beginning and 544.2 MB in the end (delta: 342.9 MB). Free memory was 145.3 MB in the beginning and 253.4 MB in the end (delta: -108.1 MB). Peak memory consumption was 234.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=6, \old(M_E)=17, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=7, \old(t1_i)=16, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 [L391] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L479] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-1, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-1, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-1, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=-1, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=-1, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.0s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2642 SDtfs, 5731 SDslu, 1410 SDs, 0 SdLazy, 7496 SolverSat, 2817 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1790 GetRequests, 1600 SyntacticMatches, 7 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1460occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1026 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3039 NumberOfCodeBlocks, 3039 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2835 ConstructedInterpolants, 0 QuantifiedInterpolants, 844740 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4726 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 1132/1224 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...