/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-7d8eed3 [2020-11-07 06:52:20,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:52:20,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:52:20,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:52:20,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:52:20,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:52:20,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:52:20,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:52:21,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:52:21,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:52:21,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:52:21,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:52:21,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:52:21,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:52:21,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:52:21,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:52:21,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:52:21,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:52:21,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:52:21,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:52:21,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:52:21,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:52:21,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:52:21,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:52:21,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:52:21,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:52:21,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:52:21,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:52:21,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:52:21,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:52:21,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:52:21,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:52:21,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:52:21,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:52:21,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:52:21,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:52:21,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:52:21,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:52:21,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:52:21,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:52:21,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:52:21,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:52:21,142 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:52:21,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:52:21,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:52:21,153 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:52:21,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:52:21,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:52:21,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:52:21,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:52:21,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:52:21,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:52:21,157 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:52:21,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:52:21,158 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:52:21,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:52:21,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:52:21,159 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:52:21,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:52:21,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:52:21,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:52:21,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:52:21,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:52:21,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:52:21,161 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 06:52:21,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:52:21,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:52:21,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:52:21,703 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:52:21,706 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:52:21,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-11-07 06:52:21,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9144258/130d1b95c7654c5b8d565ac95ba625d3/FLAG8c2d717a6 [2020-11-07 06:52:22,720 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:52:22,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-11-07 06:52:22,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9144258/130d1b95c7654c5b8d565ac95ba625d3/FLAG8c2d717a6 [2020-11-07 06:52:23,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9144258/130d1b95c7654c5b8d565ac95ba625d3 [2020-11-07 06:52:23,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:52:23,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:52:23,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:52:23,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:52:23,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:52:23,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fec80b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23, skipping insertion in model container [2020-11-07 06:52:23,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:52:23,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:52:23,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:52:23,339 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:52:23,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:52:23,422 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:52:23,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23 WrapperNode [2020-11-07 06:52:23,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:52:23,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:52:23,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:52:23,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:52:23,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... [2020-11-07 06:52:23,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:52:23,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:52:23,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:52:23,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:52:23,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:52:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:52:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:52:23,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:52:23,630 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-07 06:52:23,630 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-07 06:52:23,630 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-07 06:52:23,630 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-07 06:52:23,630 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-07 06:52:23,631 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-07 06:52:23,631 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-07 06:52:23,631 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-07 06:52:23,631 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-07 06:52:23,631 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-07 06:52:23,632 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-07 06:52:23,632 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-07 06:52:23,633 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-07 06:52:23,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-07 06:52:23,633 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-07 06:52:23,633 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-07 06:52:23,634 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-07 06:52:23,634 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-07 06:52:23,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:52:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:52:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:52:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:52:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:52:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:52:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-07 06:52:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-07 06:52:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-07 06:52:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-07 06:52:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-07 06:52:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-07 06:52:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-07 06:52:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-07 06:52:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-07 06:52:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-07 06:52:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-07 06:52:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-07 06:52:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-07 06:52:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-07 06:52:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-07 06:52:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-07 06:52:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-07 06:52:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-07 06:52:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:52:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:52:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:52:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:52:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:52:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:52:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:52:24,828 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:52:24,828 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-07 06:52:24,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:52:24 BoogieIcfgContainer [2020-11-07 06:52:24,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:52:24,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:52:24,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:52:24,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:52:24,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:52:23" (1/3) ... [2020-11-07 06:52:24,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e38aa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:52:24, skipping insertion in model container [2020-11-07 06:52:24,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:23" (2/3) ... [2020-11-07 06:52:24,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e38aa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:52:24, skipping insertion in model container [2020-11-07 06:52:24,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:52:24" (3/3) ... [2020-11-07 06:52:24,843 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-11-07 06:52:24,866 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:52:24,871 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:52:24,888 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:52:24,921 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:52:24,921 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:52:24,922 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:52:24,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:52:24,922 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:52:24,922 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:52:24,922 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:52:24,922 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:52:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2020-11-07 06:52:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 06:52:24,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:24,975 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, 1, 1, 1, 1] [2020-11-07 06:52:24,976 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1428806006, now seen corresponding path program 1 times [2020-11-07 06:52:24,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:25,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1828782356] [2020-11-07 06:52:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,656 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-07 06:52:25,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:52:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:52:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:52:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 06:52:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:25,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1828782356] [2020-11-07 06:52:25,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:25,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:52:25,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163491518] [2020-11-07 06:52:26,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:52:26,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:52:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:52:26,030 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 8 states. [2020-11-07 06:52:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:30,147 INFO L93 Difference]: Finished difference Result 814 states and 1170 transitions. [2020-11-07 06:52:30,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:52:30,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-11-07 06:52:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:30,211 INFO L225 Difference]: With dead ends: 814 [2020-11-07 06:52:30,212 INFO L226 Difference]: Without dead ends: 614 [2020-11-07 06:52:30,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:52:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-11-07 06:52:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 359. [2020-11-07 06:52:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-11-07 06:52:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 443 transitions. [2020-11-07 06:52:30,473 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 443 transitions. Word has length 111 [2020-11-07 06:52:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:30,475 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 443 transitions. [2020-11-07 06:52:30,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:52:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 443 transitions. [2020-11-07 06:52:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-07 06:52:30,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:30,482 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, 1, 1, 1, 1, 1] [2020-11-07 06:52:30,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:52:30,482 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2138316646, now seen corresponding path program 1 times [2020-11-07 06:52:30,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:30,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1366958423] [2020-11-07 06:52:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:52:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:52:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:52:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 06:52:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:30,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1366958423] [2020-11-07 06:52:30,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:30,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:52:30,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532865747] [2020-11-07 06:52:30,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:52:30,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:52:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:52:30,906 INFO L87 Difference]: Start difference. First operand 359 states and 443 transitions. Second operand 8 states. [2020-11-07 06:52:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:32,952 INFO L93 Difference]: Finished difference Result 846 states and 1094 transitions. [2020-11-07 06:52:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 06:52:32,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2020-11-07 06:52:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:32,961 INFO L225 Difference]: With dead ends: 846 [2020-11-07 06:52:32,961 INFO L226 Difference]: Without dead ends: 530 [2020-11-07 06:52:32,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:52:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-07 06:52:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 350. [2020-11-07 06:52:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-11-07 06:52:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 428 transitions. [2020-11-07 06:52:33,073 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 428 transitions. Word has length 112 [2020-11-07 06:52:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:33,074 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 428 transitions. [2020-11-07 06:52:33,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:52:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 428 transitions. [2020-11-07 06:52:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-07 06:52:33,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:33,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:33,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:52:33,077 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash 247926262, now seen corresponding path program 1 times [2020-11-07 06:52:33,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:33,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274045659] [2020-11-07 06:52:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:52:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:52:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:52:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 06:52:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:33,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274045659] [2020-11-07 06:52:33,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:33,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:52:33,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346443443] [2020-11-07 06:52:33,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:52:33,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:52:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:52:33,508 INFO L87 Difference]: Start difference. First operand 350 states and 428 transitions. Second operand 7 states. [2020-11-07 06:52:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:35,902 INFO L93 Difference]: Finished difference Result 1289 states and 1732 transitions. [2020-11-07 06:52:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:52:35,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2020-11-07 06:52:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:35,920 INFO L225 Difference]: With dead ends: 1289 [2020-11-07 06:52:35,920 INFO L226 Difference]: Without dead ends: 982 [2020-11-07 06:52:35,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:52:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2020-11-07 06:52:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 671. [2020-11-07 06:52:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-11-07 06:52:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 834 transitions. [2020-11-07 06:52:36,186 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 834 transitions. Word has length 116 [2020-11-07 06:52:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:36,189 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 834 transitions. [2020-11-07 06:52:36,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:52:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 834 transitions. [2020-11-07 06:52:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-11-07 06:52:36,197 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:36,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:36,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:52:36,199 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2027254963, now seen corresponding path program 1 times [2020-11-07 06:52:36,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:36,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [526438089] [2020-11-07 06:52:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:52:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:52:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:52:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 06:52:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:52:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:52:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 06:52:36,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [526438089] [2020-11-07 06:52:36,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:36,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:36,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023022690] [2020-11-07 06:52:36,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:36,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:36,535 INFO L87 Difference]: Start difference. First operand 671 states and 834 transitions. Second operand 10 states. [2020-11-07 06:52:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:46,254 INFO L93 Difference]: Finished difference Result 5678 states and 8246 transitions. [2020-11-07 06:52:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-11-07 06:52:46,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-11-07 06:52:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:46,305 INFO L225 Difference]: With dead ends: 5678 [2020-11-07 06:52:46,305 INFO L226 Difference]: Without dead ends: 5049 [2020-11-07 06:52:46,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=709, Invalid=2153, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 06:52:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2020-11-07 06:52:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 3835. [2020-11-07 06:52:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2020-11-07 06:52:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5100 transitions. [2020-11-07 06:52:47,311 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5100 transitions. Word has length 148 [2020-11-07 06:52:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:47,312 INFO L481 AbstractCegarLoop]: Abstraction has 3835 states and 5100 transitions. [2020-11-07 06:52:47,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5100 transitions. [2020-11-07 06:52:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-07 06:52:47,322 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:47,323 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, 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, 1, 1, 1, 1] [2020-11-07 06:52:47,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:52:47,324 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1954639290, now seen corresponding path program 1 times [2020-11-07 06:52:47,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:47,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507801712] [2020-11-07 06:52:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:52:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:52:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:52:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 06:52:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:52:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:52:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:52:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-07 06:52:47,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507801712] [2020-11-07 06:52:47,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:47,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 06:52:47,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056239852] [2020-11-07 06:52:47,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:52:47,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:52:47,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:47,853 INFO L87 Difference]: Start difference. First operand 3835 states and 5100 transitions. Second operand 13 states. [2020-11-07 06:52:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:54,977 INFO L93 Difference]: Finished difference Result 8370 states and 11748 transitions. [2020-11-07 06:52:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-07 06:52:54,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 190 [2020-11-07 06:52:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:55,018 INFO L225 Difference]: With dead ends: 8370 [2020-11-07 06:52:55,018 INFO L226 Difference]: Without dead ends: 3617 [2020-11-07 06:52:55,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=556, Invalid=1606, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 06:52:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2020-11-07 06:52:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 2523. [2020-11-07 06:52:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2020-11-07 06:52:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3198 transitions. [2020-11-07 06:52:55,808 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3198 transitions. Word has length 190 [2020-11-07 06:52:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:55,809 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 3198 transitions. [2020-11-07 06:52:55,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:52:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3198 transitions. [2020-11-07 06:52:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-11-07 06:52:55,814 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:55,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:55,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:52:55,815 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1717488635, now seen corresponding path program 1 times [2020-11-07 06:52:55,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:55,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230575028] [2020-11-07 06:52:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:52:55,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:52:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:52:55,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:52:56,019 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:52:56,022 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:52:56,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:52:56,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:52:56 BoogieIcfgContainer [2020-11-07 06:52:56,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:52:56,309 INFO L168 Benchmark]: Toolchain (without parser) took 33279.99 ms. Allocated memory was 159.4 MB in the beginning and 557.8 MB in the end (delta: 398.5 MB). Free memory was 136.5 MB in the beginning and 201.8 MB in the end (delta: -65.4 MB). Peak memory consumption was 334.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:56,310 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 125.8 MB. Free memory is still 102.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:52:56,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.97 ms. Allocated memory is still 159.4 MB. Free memory was 135.6 MB in the beginning and 123.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:56,312 INFO L168 Benchmark]: Boogie Preprocessor took 113.94 ms. Allocated memory is still 159.4 MB. Free memory was 123.0 MB in the beginning and 121.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:56,313 INFO L168 Benchmark]: RCFGBuilder took 1291.17 ms. Allocated memory is still 159.4 MB. Free memory was 121.0 MB in the beginning and 119.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:56,314 INFO L168 Benchmark]: TraceAbstraction took 31472.41 ms. Allocated memory was 159.4 MB in the beginning and 557.8 MB in the end (delta: 398.5 MB). Free memory was 118.9 MB in the beginning and 201.8 MB in the end (delta: -82.9 MB). Peak memory consumption was 316.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:56,318 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 125.8 MB. Free memory is still 102.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 388.97 ms. Allocated memory is still 159.4 MB. Free memory was 135.6 MB in the beginning and 123.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 113.94 ms. Allocated memory is still 159.4 MB. Free memory was 123.0 MB in the beginning and 121.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1291.17 ms. Allocated memory is still 159.4 MB. Free memory was 121.0 MB in the beginning and 119.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31472.41 ms. Allocated memory was 159.4 MB in the beginning and 557.8 MB in the end (delta: 398.5 MB). Free memory was 118.9 MB in the beginning and 201.8 MB in the end (delta: -82.9 MB). Peak memory consumption was 316.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=63, t1_pc=54, t1_st=51] [L18] int t1_pc = 0; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=63, t1_pc=0, t1_st=51] [L19] int m_st ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=63, t1_pc=0, t1_st=51] [L20] int t1_st ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=63, t1_pc=0, t1_st=0] [L21] int m_i ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=63, t1_pc=0, t1_st=0] [L22] int t1_i ; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=62, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0] [L23] int M_E = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0] [L24] int T1_E = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L25] int E_1 = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, 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] [L441] 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] [L445] 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] [L356] 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] [L357] 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] [L445] 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] [L446] 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] [L382] 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] [L383] 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] [L384] 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] [L388] 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] [L389] 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] [L390] 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] [L153] 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] [L154] 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] [L158] 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] [L159] 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] [L390] 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] [L391] 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] [L242] 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] [L247] 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] [L252] 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] [L391] 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] [L392] 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] [L285] 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] [L286] 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] [L290] 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] [L104] 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] [L107] 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] [L117] __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] [L119] 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] [L290] 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] [L290] 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] [L292] 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] [L298] 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] [L123] 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] [L126] 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] [L136] __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] [L138] 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] [L298] 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] [L298] 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] [L300] 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] [L392] 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] [L393] 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] [L265] 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] [L270] 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] [L275] 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] [L393] 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] [L396] 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] [L399] 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] [L400] 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] [L189] 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] [L193] 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] [L196] 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] [L168] 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] [L171] 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] [L172] __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] [L184] 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] [L196] 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] [L196] 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] [L198] 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] [L203] 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] [L204] 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] [L205] 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] [L206] 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] [L217] 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] [L218] 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] [L219] 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] [L220] 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] [L222] 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] [L223] 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] [L74] 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] [L85] 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] [L87] 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] [L88] 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] [L223] 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] [L193] 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] [L196] 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] [L168] 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] [L171] 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] [L172] __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] [L184] 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] [L196] 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] [L196] 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] [L198] 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] [L203] 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] [L204] 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] [L205] 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] [L206] 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] [L208] 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] [L209] 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] [L33] 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] [L44] 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] [L47] 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] [L48] 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] [L314] 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] [L285] 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] [L286] 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] [L290] 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] [L104] 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] [L107] 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] [L117] __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] [L119] 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] [L290] 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] [L290] 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] [L292] 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] [L298] 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] [L123] 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] [L126] 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] [L127] 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] [L128] __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] [L138] 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] [L298] 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] [L298] 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] [L300] 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] [L301] 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] [L314] 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] [L48] 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] [L49] 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] [L52] 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] [L54] 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] [L55] 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] [L209] 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] [L217] 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] [L218] 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] [L219] 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] [L220] 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] [L222] 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] [L223] 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] [L74] 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] [L77] 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] [L93] 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] [L13] CALL reach_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] [L3] __assert_fail("0", "transmitter.01.cil.c", 3, "reach_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 22 procedures, 213 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.1s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1327 SDtfs, 6016 SDslu, 687 SDs, 0 SdLazy, 8282 SolverSat, 2475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3835occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 3054 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 868 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 211514 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...