/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-3af5e1f [2020-09-04 13:47:59,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:47:59,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:47:59,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:47:59,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:47:59,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:47:59,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:47:59,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:47:59,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:47:59,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:47:59,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:47:59,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:47:59,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:47:59,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:47:59,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:47:59,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:47:59,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:47:59,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:47:59,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:47:59,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:47:59,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:47:59,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:47:59,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:47:59,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:47:59,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:47:59,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:47:59,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:47:59,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:47:59,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:47:59,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:47:59,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:47:59,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:47:59,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:47:59,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:47:59,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:47:59,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:47:59,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:47:59,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:47:59,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:47:59,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:47:59,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:47:59,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:47:59,740 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:47:59,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:47:59,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:47:59,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:47:59,742 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:47:59,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:47:59,743 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:47:59,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:47:59,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:47:59,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:47:59,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:47:59,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:47:59,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:47:59,744 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:47:59,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:47:59,744 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:47:59,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:47:59,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:47:59,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:47:59,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:47:59,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:47:59,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:47:59,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:47:59,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:47:59,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:47:59,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:47:59,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:47:59,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:47:59,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:47:59,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:48:00,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:48:00,232 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:48:00,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:48:00,239 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:48:00,239 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:48:00,240 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-09-04 13:48:00,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2d3ba1911/f6ffbb73de6545d3bc2e1de9933c6d3e/FLAG2169e0882 [2020-09-04 13:48:00,902 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:48:00,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-09-04 13:48:00,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2d3ba1911/f6ffbb73de6545d3bc2e1de9933c6d3e/FLAG2169e0882 [2020-09-04 13:48:01,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2d3ba1911/f6ffbb73de6545d3bc2e1de9933c6d3e [2020-09-04 13:48:01,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:48:01,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:48:01,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:48:01,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:48:01,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:48:01,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70996f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01, skipping insertion in model container [2020-09-04 13:48:01,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:48:01,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:48:01,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:48:01,695 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:48:01,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:48:01,849 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:48:01,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01 WrapperNode [2020-09-04 13:48:01,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:48:01,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:48:01,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:48:01,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:48:01,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... [2020-09-04 13:48:01,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:48:01,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:48:01,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:48:01,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:48:01,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:48:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:48:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 13:48:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 13:48:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 13:48:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 13:48:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 13:48:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 13:48:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 13:48:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 13:48:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 13:48:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 13:48:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 13:48:01,979 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 13:48:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 13:48:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 13:48:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 13:48:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 13:48:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 13:48:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 13:48:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:48:01,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 13:48:01,982 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 13:48:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 13:48:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 13:48:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 13:48:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 13:48:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 13:48:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 13:48:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 13:48:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 13:48:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 13:48:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 13:48:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 13:48:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 13:48:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:48:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:48:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:48:02,508 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:48:02,508 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 13:48:02,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:48:02 BoogieIcfgContainer [2020-09-04 13:48:02,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:48:02,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:48:02,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:48:02,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:48:02,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:48:01" (1/3) ... [2020-09-04 13:48:02,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9cb2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:48:02, skipping insertion in model container [2020-09-04 13:48:02,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:01" (2/3) ... [2020-09-04 13:48:02,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9cb2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:48:02, skipping insertion in model container [2020-09-04 13:48:02,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:48:02" (3/3) ... [2020-09-04 13:48:02,526 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-09-04 13:48:02,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:48:02,556 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:48:02,580 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:48:02,627 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:48:02,627 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:48:02,628 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:48:02,628 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:48:02,628 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:48:02,628 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:48:02,628 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:48:02,628 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:48:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-09-04 13:48:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:02,669 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:02,670 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-09-04 13:48:02,670 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2020-09-04 13:48:02,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:02,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026535638] [2020-09-04 13:48:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:03,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026535638] [2020-09-04 13:48:03,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:03,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:48:03,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255436808] [2020-09-04 13:48:03,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:48:03,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:48:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:03,414 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 9 states. [2020-09-04 13:48:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:05,733 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-09-04 13:48:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:48:05,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-09-04 13:48:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:05,768 INFO L225 Difference]: With dead ends: 522 [2020-09-04 13:48:05,768 INFO L226 Difference]: Without dead ends: 371 [2020-09-04 13:48:05,775 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-09-04 13:48:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-09-04 13:48:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2020-09-04 13:48:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-09-04 13:48:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2020-09-04 13:48:05,888 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 78 [2020-09-04 13:48:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:05,889 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2020-09-04 13:48:05,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:48:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2020-09-04 13:48:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:05,894 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:05,894 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-09-04 13:48:05,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:48:05,895 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash 211359051, now seen corresponding path program 1 times [2020-09-04 13:48:05,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:05,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306961238] [2020-09-04 13:48:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:06,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306961238] [2020-09-04 13:48:06,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:06,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:06,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191501774] [2020-09-04 13:48:06,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:06,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:06,183 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. Second operand 10 states. [2020-09-04 13:48:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:07,567 INFO L93 Difference]: Finished difference Result 599 states and 848 transitions. [2020-09-04 13:48:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:48:07,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-09-04 13:48:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:07,575 INFO L225 Difference]: With dead ends: 599 [2020-09-04 13:48:07,576 INFO L226 Difference]: Without dead ends: 361 [2020-09-04 13:48:07,579 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-09-04 13:48:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-09-04 13:48:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2020-09-04 13:48:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-09-04 13:48:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2020-09-04 13:48:07,636 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 78 [2020-09-04 13:48:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:07,636 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2020-09-04 13:48:07,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2020-09-04 13:48:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:07,639 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:07,640 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-09-04 13:48:07,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:48:07,640 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2119705461, now seen corresponding path program 1 times [2020-09-04 13:48:07,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:07,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512287782] [2020-09-04 13:48:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:07,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512287782] [2020-09-04 13:48:07,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:07,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:07,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527371814] [2020-09-04 13:48:07,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:07,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:07,867 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand 10 states. [2020-09-04 13:48:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:09,483 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2020-09-04 13:48:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:48:09,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-09-04 13:48:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:09,494 INFO L225 Difference]: With dead ends: 722 [2020-09-04 13:48:09,497 INFO L226 Difference]: Without dead ends: 484 [2020-09-04 13:48:09,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:48:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-09-04 13:48:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2020-09-04 13:48:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-09-04 13:48:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2020-09-04 13:48:09,592 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 78 [2020-09-04 13:48:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:09,594 INFO L479 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2020-09-04 13:48:09,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2020-09-04 13:48:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:09,606 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:09,606 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-09-04 13:48:09,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:48:09,606 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash -579817174, now seen corresponding path program 1 times [2020-09-04 13:48:09,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:09,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900355274] [2020-09-04 13:48:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:09,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900355274] [2020-09-04 13:48:09,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:09,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:09,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871991699] [2020-09-04 13:48:09,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:09,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:09,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:09,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:09,850 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand 10 states. [2020-09-04 13:48:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:11,353 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2020-09-04 13:48:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:48:11,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-09-04 13:48:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:11,358 INFO L225 Difference]: With dead ends: 744 [2020-09-04 13:48:11,358 INFO L226 Difference]: Without dead ends: 455 [2020-09-04 13:48:11,360 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-09-04 13:48:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-09-04 13:48:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 329. [2020-09-04 13:48:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-09-04 13:48:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2020-09-04 13:48:11,396 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 78 [2020-09-04 13:48:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:11,397 INFO L479 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2020-09-04 13:48:11,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2020-09-04 13:48:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:11,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:11,399 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-09-04 13:48:11,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:48:11,399 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash -156170452, now seen corresponding path program 1 times [2020-09-04 13:48:11,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:11,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217500784] [2020-09-04 13:48:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:11,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217500784] [2020-09-04 13:48:11,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:11,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:11,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075725715] [2020-09-04 13:48:11,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:11,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:11,643 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand 10 states. [2020-09-04 13:48:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:13,215 INFO L93 Difference]: Finished difference Result 774 states and 1027 transitions. [2020-09-04 13:48:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:48:13,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-09-04 13:48:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:13,219 INFO L225 Difference]: With dead ends: 774 [2020-09-04 13:48:13,220 INFO L226 Difference]: Without dead ends: 465 [2020-09-04 13:48:13,222 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-09-04 13:48:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-09-04 13:48:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2020-09-04 13:48:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-09-04 13:48:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2020-09-04 13:48:13,260 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 78 [2020-09-04 13:48:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:13,260 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2020-09-04 13:48:13,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2020-09-04 13:48:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:13,262 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:13,262 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-09-04 13:48:13,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:48:13,262 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 118589162, now seen corresponding path program 1 times [2020-09-04 13:48:13,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:13,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261300075] [2020-09-04 13:48:13,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:13,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261300075] [2020-09-04 13:48:13,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:13,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:13,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026179785] [2020-09-04 13:48:13,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:13,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:13,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:13,452 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand 10 states. [2020-09-04 13:48:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:15,098 INFO L93 Difference]: Finished difference Result 920 states and 1216 transitions. [2020-09-04 13:48:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 13:48:15,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-09-04 13:48:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:15,106 INFO L225 Difference]: With dead ends: 920 [2020-09-04 13:48:15,107 INFO L226 Difference]: Without dead ends: 600 [2020-09-04 13:48:15,109 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-09-04 13:48:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-09-04 13:48:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 375. [2020-09-04 13:48:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-09-04 13:48:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 445 transitions. [2020-09-04 13:48:15,161 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 445 transitions. Word has length 78 [2020-09-04 13:48:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:15,161 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 445 transitions. [2020-09-04 13:48:15,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 445 transitions. [2020-09-04 13:48:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 13:48:15,163 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:15,163 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-09-04 13:48:15,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:48:15,164 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2020-09-04 13:48:15,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:15,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519390926] [2020-09-04 13:48:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:15,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519390926] [2020-09-04 13:48:15,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:15,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:48:15,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618067351] [2020-09-04 13:48:15,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:48:15,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:48:15,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:48:15,353 INFO L87 Difference]: Start difference. First operand 375 states and 445 transitions. Second operand 7 states. [2020-09-04 13:48:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:16,873 INFO L93 Difference]: Finished difference Result 1208 states and 1535 transitions. [2020-09-04 13:48:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:48:16,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-09-04 13:48:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:16,881 INFO L225 Difference]: With dead ends: 1208 [2020-09-04 13:48:16,881 INFO L226 Difference]: Without dead ends: 853 [2020-09-04 13:48:16,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:48:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2020-09-04 13:48:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 751. [2020-09-04 13:48:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-09-04 13:48:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 921 transitions. [2020-09-04 13:48:16,955 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 921 transitions. Word has length 78 [2020-09-04 13:48:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:16,956 INFO L479 AbstractCegarLoop]: Abstraction has 751 states and 921 transitions. [2020-09-04 13:48:16,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:48:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 921 transitions. [2020-09-04 13:48:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 13:48:16,960 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:16,960 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-09-04 13:48:16,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:48:16,960 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash 972462964, now seen corresponding path program 1 times [2020-09-04 13:48:16,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:16,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766423042] [2020-09-04 13:48:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 13:48:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 13:48:17,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766423042] [2020-09-04 13:48:17,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261243933] [2020-09-04 13:48:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:48:17,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:48:17,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:17,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-09-04 13:48:17,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440531695] [2020-09-04 13:48:17,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:17,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:17,461 INFO L87 Difference]: Start difference. First operand 751 states and 921 transitions. Second operand 3 states. [2020-09-04 13:48:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:17,574 INFO L93 Difference]: Finished difference Result 2037 states and 2550 transitions. [2020-09-04 13:48:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:17,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-09-04 13:48:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:17,582 INFO L225 Difference]: With dead ends: 2037 [2020-09-04 13:48:17,582 INFO L226 Difference]: Without dead ends: 1033 [2020-09-04 13:48:17,586 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-09-04 13:48:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2020-09-04 13:48:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2020-09-04 13:48:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-09-04 13:48:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1261 transitions. [2020-09-04 13:48:17,702 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1261 transitions. Word has length 123 [2020-09-04 13:48:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:17,703 INFO L479 AbstractCegarLoop]: Abstraction has 1033 states and 1261 transitions. [2020-09-04 13:48:17,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1261 transitions. [2020-09-04 13:48:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 13:48:17,706 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:17,706 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-09-04 13:48:17,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-09-04 13:48:17,922 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:17,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1660958730, now seen corresponding path program 1 times [2020-09-04 13:48:17,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:17,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738798269] [2020-09-04 13:48:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 13:48:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 13:48:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-09-04 13:48:18,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738798269] [2020-09-04 13:48:18,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48220305] [2020-09-04 13:48:18,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:18,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:48:18,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:48:18,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:18,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:48:18,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506390577] [2020-09-04 13:48:18,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:18,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:18,575 INFO L87 Difference]: Start difference. First operand 1033 states and 1261 transitions. Second operand 3 states. [2020-09-04 13:48:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:18,709 INFO L93 Difference]: Finished difference Result 2478 states and 3187 transitions. [2020-09-04 13:48:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:18,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-09-04 13:48:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:18,722 INFO L225 Difference]: With dead ends: 2478 [2020-09-04 13:48:18,722 INFO L226 Difference]: Without dead ends: 1466 [2020-09-04 13:48:18,729 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-09-04 13:48:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-09-04 13:48:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1460. [2020-09-04 13:48:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2020-09-04 13:48:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1762 transitions. [2020-09-04 13:48:18,878 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1762 transitions. Word has length 158 [2020-09-04 13:48:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:18,880 INFO L479 AbstractCegarLoop]: Abstraction has 1460 states and 1762 transitions. [2020-09-04 13:48:18,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1762 transitions. [2020-09-04 13:48:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-09-04 13:48:18,886 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:18,886 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-09-04 13:48:19,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:19,102 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1638316670, now seen corresponding path program 1 times [2020-09-04 13:48:19,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:19,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084953853] [2020-09-04 13:48:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 13:48:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 13:48:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-09-04 13:48:19,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084953853] [2020-09-04 13:48:19,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629359179] [2020-09-04 13:48:19,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:48:19,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-09-04 13:48:19,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:19,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-09-04 13:48:19,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330965001] [2020-09-04 13:48:19,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:19,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:48:19,653 INFO L87 Difference]: Start difference. First operand 1460 states and 1762 transitions. Second operand 3 states. [2020-09-04 13:48:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:19,813 INFO L93 Difference]: Finished difference Result 2442 states and 2935 transitions. [2020-09-04 13:48:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:19,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-09-04 13:48:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:19,825 INFO L225 Difference]: With dead ends: 2442 [2020-09-04 13:48:19,825 INFO L226 Difference]: Without dead ends: 1459 [2020-09-04 13:48:19,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:48:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-09-04 13:48:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2020-09-04 13:48:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2020-09-04 13:48:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1719 transitions. [2020-09-04 13:48:20,092 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1719 transitions. Word has length 159 [2020-09-04 13:48:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:20,092 INFO L479 AbstractCegarLoop]: Abstraction has 1459 states and 1719 transitions. [2020-09-04 13:48:20,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1719 transitions. [2020-09-04 13:48:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-04 13:48:20,096 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:20,097 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-09-04 13:48:20,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-09-04 13:48:20,310 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1505336733, now seen corresponding path program 1 times [2020-09-04 13:48:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:20,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751976274] [2020-09-04 13:48:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:48:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 13:48:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-09-04 13:48:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-09-04 13:48:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-09-04 13:48:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-09-04 13:48:20,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751976274] [2020-09-04 13:48:20,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115243909] [2020-09-04 13:48:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:20,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:48:20,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-09-04 13:48:20,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:20,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-09-04 13:48:20,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583872293] [2020-09-04 13:48:20,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:20,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:20,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:20,734 INFO L87 Difference]: Start difference. First operand 1459 states and 1719 transitions. Second operand 3 states. [2020-09-04 13:48:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:20,875 INFO L93 Difference]: Finished difference Result 2891 states and 3468 transitions. [2020-09-04 13:48:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:20,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-09-04 13:48:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:20,887 INFO L225 Difference]: With dead ends: 2891 [2020-09-04 13:48:20,887 INFO L226 Difference]: Without dead ends: 1453 [2020-09-04 13:48:20,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-09-04 13:48:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2020-09-04 13:48:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2020-09-04 13:48:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1691 transitions. [2020-09-04 13:48:21,061 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1691 transitions. Word has length 177 [2020-09-04 13:48:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:21,062 INFO L479 AbstractCegarLoop]: Abstraction has 1453 states and 1691 transitions. [2020-09-04 13:48:21,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1691 transitions. [2020-09-04 13:48:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 13:48:21,068 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:21,068 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-09-04 13:48:21,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:21,283 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491229, now seen corresponding path program 1 times [2020-09-04 13:48:21,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:21,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166599659] [2020-09-04 13:48:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 13:48:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 13:48:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 13:48:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 13:48:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-09-04 13:48:21,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166599659] [2020-09-04 13:48:21,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688858215] [2020-09-04 13:48:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:21,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:48:21,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 13:48:21,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:21,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:48:21,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296395358] [2020-09-04 13:48:21,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:21,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:21,882 INFO L87 Difference]: Start difference. First operand 1453 states and 1691 transitions. Second operand 3 states. [2020-09-04 13:48:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:22,101 INFO L93 Difference]: Finished difference Result 3376 states and 3967 transitions. [2020-09-04 13:48:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-09-04 13:48:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:22,110 INFO L225 Difference]: With dead ends: 3376 [2020-09-04 13:48:22,110 INFO L226 Difference]: Without dead ends: 967 [2020-09-04 13:48:22,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2020-09-04 13:48:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2020-09-04 13:48:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-09-04 13:48:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1101 transitions. [2020-09-04 13:48:22,236 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1101 transitions. Word has length 178 [2020-09-04 13:48:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:22,238 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1101 transitions. [2020-09-04 13:48:22,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1101 transitions. [2020-09-04 13:48:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 13:48:22,243 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:22,243 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-09-04 13:48:22,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-09-04 13:48:22,456 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2020-09-04 13:48:22,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:22,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563181455] [2020-09-04 13:48:22,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 13:48:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 13:48:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:48:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 13:48:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 13:48:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-09-04 13:48:22,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563181455] [2020-09-04 13:48:22,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032495111] [2020-09-04 13:48:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:23,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 17 conjunts are in the unsatisfiable core [2020-09-04 13:48:23,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-09-04 13:48:23,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:48:23,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-09-04 13:48:23,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442116966] [2020-09-04 13:48:23,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:48:23,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:23,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:48:23,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:48:23,170 INFO L87 Difference]: Start difference. First operand 967 states and 1101 transitions. Second operand 12 states. [2020-09-04 13:48:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:25,766 INFO L93 Difference]: Finished difference Result 1223 states and 1418 transitions. [2020-09-04 13:48:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 13:48:25,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2020-09-04 13:48:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:25,775 INFO L225 Difference]: With dead ends: 1223 [2020-09-04 13:48:25,775 INFO L226 Difference]: Without dead ends: 1220 [2020-09-04 13:48:25,776 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-09-04 13:48:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-09-04 13:48:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1172. [2020-09-04 13:48:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2020-09-04 13:48:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2020-09-04 13:48:25,884 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 178 [2020-09-04 13:48:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:25,885 INFO L479 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2020-09-04 13:48:25,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:48:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2020-09-04 13:48:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-09-04 13:48:25,888 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:25,889 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-09-04 13:48:26,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:26,105 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:26,105 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2020-09-04 13:48:26,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:26,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838234048] [2020-09-04 13:48:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 13:48:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 13:48:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:48:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 13:48:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 13:48:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-09-04 13:48:26,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838234048] [2020-09-04 13:48:26,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006133058] [2020-09-04 13:48:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:48:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:26,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:48:26,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-09-04 13:48:26,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:26,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-09-04 13:48:26,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748737205] [2020-09-04 13:48:26,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:26,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:26,640 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 3 states. [2020-09-04 13:48:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:26,811 INFO L93 Difference]: Finished difference Result 1969 states and 2271 transitions. [2020-09-04 13:48:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:26,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-09-04 13:48:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:26,826 INFO L225 Difference]: With dead ends: 1969 [2020-09-04 13:48:26,826 INFO L226 Difference]: Without dead ends: 1186 [2020-09-04 13:48:26,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-09-04 13:48:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2020-09-04 13:48:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2020-09-04 13:48:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1353 transitions. [2020-09-04 13:48:26,985 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1353 transitions. Word has length 182 [2020-09-04 13:48:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:26,986 INFO L479 AbstractCegarLoop]: Abstraction has 1186 states and 1353 transitions. [2020-09-04 13:48:26,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1353 transitions. [2020-09-04 13:48:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-09-04 13:48:26,991 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:26,991 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-09-04 13:48:27,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-09-04 13:48:27,204 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2020-09-04 13:48:27,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:27,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25412812] [2020-09-04 13:48:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:48:27,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:48:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:48:27,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:48:27,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:48:27,440 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:48:27,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:48:27,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:48:27 BoogieIcfgContainer [2020-09-04 13:48:27,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:48:27,676 INFO L168 Benchmark]: Toolchain (without parser) took 26416.50 ms. Allocated memory was 140.0 MB in the beginning and 528.0 MB in the end (delta: 388.0 MB). Free memory was 103.0 MB in the beginning and 98.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 392.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:48:27,676 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:48:27,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.28 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 102.8 MB in the beginning and 180.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:48:27,678 INFO L168 Benchmark]: Boogie Preprocessor took 54.60 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 178.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:48:27,678 INFO L168 Benchmark]: RCFGBuilder took 609.54 ms. Allocated memory is still 202.4 MB. Free memory was 178.6 MB in the beginning and 146.0 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:48:27,679 INFO L168 Benchmark]: TraceAbstraction took 25155.26 ms. Allocated memory was 202.4 MB in the beginning and 528.0 MB in the end (delta: 325.6 MB). Free memory was 145.3 MB in the beginning and 98.5 MB in the end (delta: 46.8 MB). Peak memory consumption was 372.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:48:27,682 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 588.28 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 102.8 MB in the beginning and 180.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.60 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 178.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 609.54 ms. Allocated memory is still 202.4 MB. Free memory was 178.6 MB in the beginning and 146.0 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25155.26 ms. Allocated memory was 202.4 MB in the beginning and 528.0 MB in the end (delta: 325.6 MB). Free memory was 145.3 MB in the beginning and 98.5 MB in the end (delta: 46.8 MB). Peak memory consumption was 372.4 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)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \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=-2, tmp_ndt_2=-1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=-2, 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=-2, tmp_ndt_2=3, 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=-2, tmp_ndt_2=3, 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=-2, tmp_ndt_2=3, 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=-2, tmp_ndt_2=3, 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=-2, tmp_ndt_2=3, 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=-3, tmp_ndt_2=3, 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: 24.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2643 SDtfs, 5728 SDslu, 1410 SDs, 0 SdLazy, 7512 SolverSat, 2819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1789 GetRequests, 1600 SyntacticMatches, 6 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 3.4s 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1026 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 3039 NumberOfCodeBlocks, 3039 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2835 ConstructedInterpolants, 0 QuantifiedInterpolants, 844894 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...