/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:24:58,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:24:58,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:24:58,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:24:58,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:24:58,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:24:58,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:24:58,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:24:58,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:24:58,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:24:58,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:24:58,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:24:58,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:24:58,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:24:58,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:24:58,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:24:58,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:24:58,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:24:59,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:24:59,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:24:59,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:24:59,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:24:59,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:24:59,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:24:59,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:24:59,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:24:59,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:24:59,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:24:59,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:24:59,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:24:59,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:24:59,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:24:59,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:24:59,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:24:59,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:24:59,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:24:59,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:24:59,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:24:59,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:24:59,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:24:59,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:24:59,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:24:59,086 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:24:59,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:24:59,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:24:59,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:24:59,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:24:59,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:24:59,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:24:59,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:24:59,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:24:59,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:24:59,094 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:24:59,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:24:59,095 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:24:59,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:24:59,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:24:59,097 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:24:59,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:24:59,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:24:59,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:59,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:24:59,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:24:59,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:24:59,099 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:24:59,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:24:59,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:24:59,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:24:59,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:24:59,695 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:24:59,696 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-09-04 23:24:59,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3cad40a36/6b45665e8cba49b884ef8fd73ad60bc5/FLAG4e7a192a8 [2020-09-04 23:25:00,520 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:25:00,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-09-04 23:25:00,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3cad40a36/6b45665e8cba49b884ef8fd73ad60bc5/FLAG4e7a192a8 [2020-09-04 23:25:00,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3cad40a36/6b45665e8cba49b884ef8fd73ad60bc5 [2020-09-04 23:25:00,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:25:00,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:25:00,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:25:00,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:25:00,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:25:00,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:25:00" (1/1) ... [2020-09-04 23:25:00,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d022c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:00, skipping insertion in model container [2020-09-04 23:25:00,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:25:00" (1/1) ... [2020-09-04 23:25:00,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:25:00,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:25:01,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:25:01,291 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:25:01,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:25:01,392 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:25:01,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01 WrapperNode [2020-09-04 23:25:01,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:25:01,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:25:01,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:25:01,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:25:01,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (1/1) ... [2020-09-04 23:25:01,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:25:01,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:25:01,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:25:01,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:25:01,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25: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 23:25:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:25:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:25:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 23:25:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 23:25:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 23:25:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 23:25:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 23:25:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 23:25:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 23:25:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 23:25:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 23:25:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 23:25:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 23:25:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 23:25:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 23:25:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 23:25:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 23:25:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 23:25:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 23:25:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 23:25:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:25:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:25:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:25:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 23:25:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 23:25:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 23:25:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 23:25:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 23:25:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 23:25:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 23:25:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 23:25:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 23:25:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 23:25:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 23:25:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 23:25:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 23:25:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 23:25:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 23:25:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 23:25:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 23:25:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 23:25:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:25:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:25:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:25:02,456 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:25:02,457 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-09-04 23:25:02,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:25:02 BoogieIcfgContainer [2020-09-04 23:25:02,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:25:02,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:25:02,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:25:02,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:25:02,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:25:00" (1/3) ... [2020-09-04 23:25:02,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed83fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:25:02, skipping insertion in model container [2020-09-04 23:25:02,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:25:01" (2/3) ... [2020-09-04 23:25:02,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed83fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:25:02, skipping insertion in model container [2020-09-04 23:25:02,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:25:02" (3/3) ... [2020-09-04 23:25:02,477 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-09-04 23:25:02,490 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:25:02,518 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:25:02,541 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:25:02,579 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:25:02,579 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:25:02,579 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:25:02,579 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:25:02,580 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:25:02,580 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:25:02,580 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:25:02,580 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:25:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2020-09-04 23:25:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-09-04 23:25:02,633 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:02,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:02,636 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 486796623, now seen corresponding path program 1 times [2020-09-04 23:25:02,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:02,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035656267] [2020-09-04 23:25:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 23:25:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:25:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:25:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:25:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,246 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 23:25:03,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035656267] [2020-09-04 23:25:03,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:03,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:25:03,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592761231] [2020-09-04 23:25:03,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:25:03,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:25:03,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:25:03,301 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 7 states. [2020-09-04 23:25:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:05,942 INFO L93 Difference]: Finished difference Result 708 states and 984 transitions. [2020-09-04 23:25:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:25:05,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2020-09-04 23:25:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:05,975 INFO L225 Difference]: With dead ends: 708 [2020-09-04 23:25:05,976 INFO L226 Difference]: Without dead ends: 516 [2020-09-04 23:25:05,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:25:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-09-04 23:25:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 347. [2020-09-04 23:25:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-09-04 23:25:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 433 transitions. [2020-09-04 23:25:06,190 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 433 transitions. Word has length 102 [2020-09-04 23:25:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:06,191 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 433 transitions. [2020-09-04 23:25:06,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:25:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 433 transitions. [2020-09-04 23:25:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-04 23:25:06,198 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:06,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:06,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:25:06,200 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2043764254, now seen corresponding path program 1 times [2020-09-04 23:25:06,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:06,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287725854] [2020-09-04 23:25:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 23:25:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:25:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:25:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:25:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,464 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 23:25:06,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287725854] [2020-09-04 23:25:06,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:06,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:25:06,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612023170] [2020-09-04 23:25:06,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:25:06,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:06,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:25:06,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:25:06,470 INFO L87 Difference]: Start difference. First operand 347 states and 433 transitions. Second operand 8 states. [2020-09-04 23:25:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:08,053 INFO L93 Difference]: Finished difference Result 815 states and 1061 transitions. [2020-09-04 23:25:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:25:08,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2020-09-04 23:25:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:08,072 INFO L225 Difference]: With dead ends: 815 [2020-09-04 23:25:08,073 INFO L226 Difference]: Without dead ends: 503 [2020-09-04 23:25:08,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-09-04 23:25:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-09-04 23:25:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 338. [2020-09-04 23:25:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-09-04 23:25:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 418 transitions. [2020-09-04 23:25:08,185 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 418 transitions. Word has length 103 [2020-09-04 23:25:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:08,187 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 418 transitions. [2020-09-04 23:25:08,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:25:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 418 transitions. [2020-09-04 23:25:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-04 23:25:08,195 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:08,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:08,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:25:08,196 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -891577735, now seen corresponding path program 1 times [2020-09-04 23:25:08,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:08,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430059708] [2020-09-04 23:25:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 23:25:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:25:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:25:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:25:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,480 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 23:25:08,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [430059708] [2020-09-04 23:25:08,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:08,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:25:08,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347777388] [2020-09-04 23:25:08,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:25:08,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:25:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:25:08,483 INFO L87 Difference]: Start difference. First operand 338 states and 418 transitions. Second operand 7 states. [2020-09-04 23:25:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:10,623 INFO L93 Difference]: Finished difference Result 1254 states and 1740 transitions. [2020-09-04 23:25:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:25:10,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2020-09-04 23:25:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:10,638 INFO L225 Difference]: With dead ends: 1254 [2020-09-04 23:25:10,639 INFO L226 Difference]: Without dead ends: 951 [2020-09-04 23:25:10,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:25:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2020-09-04 23:25:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 685. [2020-09-04 23:25:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-09-04 23:25:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 880 transitions. [2020-09-04 23:25:10,765 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 880 transitions. Word has length 107 [2020-09-04 23:25:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:10,766 INFO L479 AbstractCegarLoop]: Abstraction has 685 states and 880 transitions. [2020-09-04 23:25:10,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:25:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 880 transitions. [2020-09-04 23:25:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-04 23:25:10,769 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:10,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:25:10,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:25:10,770 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:10,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1602138582, now seen corresponding path program 1 times [2020-09-04 23:25:10,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:10,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981230412] [2020-09-04 23:25:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 23:25:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:25:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:25:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:25:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:11,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 23:25:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:11,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 23:25:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 23:25:11,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981230412] [2020-09-04 23:25:11,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:11,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:25:11,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008462871] [2020-09-04 23:25:11,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:25:11,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:25:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:25:11,038 INFO L87 Difference]: Start difference. First operand 685 states and 880 transitions. Second operand 8 states. [2020-09-04 23:25:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:13,846 INFO L93 Difference]: Finished difference Result 2592 states and 3797 transitions. [2020-09-04 23:25:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:25:13,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 139 [2020-09-04 23:25:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:13,875 INFO L225 Difference]: With dead ends: 2592 [2020-09-04 23:25:13,876 INFO L226 Difference]: Without dead ends: 1943 [2020-09-04 23:25:13,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:25:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2020-09-04 23:25:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1454. [2020-09-04 23:25:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2020-09-04 23:25:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1985 transitions. [2020-09-04 23:25:14,108 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1985 transitions. Word has length 139 [2020-09-04 23:25:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:14,109 INFO L479 AbstractCegarLoop]: Abstraction has 1454 states and 1985 transitions. [2020-09-04 23:25:14,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:25:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1985 transitions. [2020-09-04 23:25:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-09-04 23:25:14,118 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:14,119 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:14,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:25:14,119 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:14,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1051815898, now seen corresponding path program 1 times [2020-09-04 23:25:14,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:14,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [975420580] [2020-09-04 23:25:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 23:25:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:25:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:25:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-04 23:25:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 23:25:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 23:25:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 23:25:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 23:25:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-09-04 23:25:14,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [975420580] [2020-09-04 23:25:14,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:14,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:14,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540461241] [2020-09-04 23:25:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:14,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:14,499 INFO L87 Difference]: Start difference. First operand 1454 states and 1985 transitions. Second operand 10 states. [2020-09-04 23:25:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:17,054 INFO L93 Difference]: Finished difference Result 3752 states and 5602 transitions. [2020-09-04 23:25:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 23:25:17,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2020-09-04 23:25:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:17,079 INFO L225 Difference]: With dead ends: 3752 [2020-09-04 23:25:17,079 INFO L226 Difference]: Without dead ends: 2339 [2020-09-04 23:25:17,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2020-09-04 23:25:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2020-09-04 23:25:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1810. [2020-09-04 23:25:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2020-09-04 23:25:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2415 transitions. [2020-09-04 23:25:17,364 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2415 transitions. Word has length 182 [2020-09-04 23:25:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:17,366 INFO L479 AbstractCegarLoop]: Abstraction has 1810 states and 2415 transitions. [2020-09-04 23:25:17,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2415 transitions. [2020-09-04 23:25:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-09-04 23:25:17,377 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:17,378 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:17,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:25:17,379 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1421271293, now seen corresponding path program 1 times [2020-09-04 23:25:17,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:17,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472748902] [2020-09-04 23:25:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:25:17,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:25:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:25:17,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:25:17,555 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:25:17,555 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:25:17,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:25:17,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:25:17 BoogieIcfgContainer [2020-09-04 23:25:17,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:25:17,808 INFO L168 Benchmark]: Toolchain (without parser) took 16941.24 ms. Allocated memory was 136.3 MB in the beginning and 458.8 MB in the end (delta: 322.4 MB). Free memory was 100.8 MB in the beginning and 425.5 MB in the end (delta: -324.7 MB). Peak memory consumption was 343.8 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:17,812 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 136.3 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 23:25:17,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.83 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 87.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:17,820 INFO L168 Benchmark]: Boogie Preprocessor took 198.77 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 87.4 MB in the beginning and 176.8 MB in the end (delta: -89.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:17,823 INFO L168 Benchmark]: RCFGBuilder took 870.69 ms. Allocated memory is still 199.8 MB. Free memory was 176.8 MB in the beginning and 142.6 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:17,824 INFO L168 Benchmark]: TraceAbstraction took 15335.53 ms. Allocated memory was 199.8 MB in the beginning and 458.8 MB in the end (delta: 259.0 MB). Free memory was 142.6 MB in the beginning and 425.5 MB in the end (delta: -283.0 MB). Peak memory consumption was 322.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:17,833 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.53 ms. Allocated memory is still 136.3 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 522.83 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 87.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.77 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 87.4 MB in the beginning and 176.8 MB in the end (delta: -89.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.69 ms. Allocated memory is still 199.8 MB. Free memory was 176.8 MB in the beginning and 142.6 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15335.53 ms. Allocated memory was 199.8 MB in the beginning and 458.8 MB in the end (delta: 259.0 MB). Free memory was 142.6 MB in the beginning and 425.5 MB in the end (delta: -283.0 MB). Peak memory consumption was 322.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=10, m_i=5, m_pc=0, m_st=8, T1_E=3, t1_i=11, t1_pc=7, t1_st=4] [L16] int t1_pc = 0; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=10, m_i=5, m_pc=0, m_st=8, T1_E=3, t1_i=11, t1_pc=0, t1_st=4] [L17] int m_st ; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=10, m_i=5, m_pc=0, m_st=0, T1_E=3, t1_i=11, t1_pc=0, t1_st=4] [L18] int t1_st ; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=10, m_i=5, m_pc=0, m_st=0, T1_E=3, t1_i=11, t1_pc=0, t1_st=0] [L19] int m_i ; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=10, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=11, t1_pc=0, t1_st=0] [L20] int t1_i ; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=10, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=0, t1_pc=0, t1_st=0] [L21] int M_E = 2; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=0, t1_pc=0, t1_st=0] [L22] int T1_E = 2; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=6, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L23] int E_1 = 2; VAL [\old(E_1)=6, \old(M_E)=10, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=11, \old(t1_pc)=7, \old(t1_st)=4, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L381] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L382] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L202] int tmp_ndt_1; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L203] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __VERIFIER_nondet_int()=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L216] int tmp_ndt_2; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L217] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __VERIFIER_nondet_int()=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L218] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L202] int tmp_ndt_1; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1] [L203] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __VERIFIER_nondet_int()=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L204] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1] [L298] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1] [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, 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] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L216] int tmp_ndt_2; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1] [L217] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __VERIFIER_nondet_int()=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L218] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 201 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.9s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1068 SDtfs, 5005 SDslu, 218 SDs, 0 SdLazy, 4071 SolverSat, 1865 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1810occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 5 MinimizatonAttempts, 1618 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 628 ConstructedInterpolants, 0 QuantifiedInterpolants, 158183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 80/80 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...