./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a110ed0c6f4923a9ada85889b347db0ba056a7cf6869bb52e907ef3e34294094 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:45:50,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:45:50,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:45:50,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:45:50,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:45:50,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:45:50,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:45:50,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:45:50,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:45:50,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:45:50,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:45:50,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:45:50,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:45:50,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:45:50,203 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:45:50,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:45:50,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:45:50,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:45:50,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:45:50,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:45:50,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:45:50,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:45:50,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:45:50,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:45:50,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:45:50,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:45:50,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:45:50,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:45:50,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:45:50,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:45:50,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:45:50,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:45:50,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:45:50,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:45:50,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:45:50,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:45:50,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:45:50,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:45:50,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:45:50,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:45:50,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:45:50,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:45:50,221 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a110ed0c6f4923a9ada85889b347db0ba056a7cf6869bb52e907ef3e34294094 [2024-10-12 21:45:50,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:45:50,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:45:50,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:45:50,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:45:50,484 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:45:50,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2024-10-12 21:45:51,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:45:52,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:45:52,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2024-10-12 21:45:52,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95fcc5634/6133ec001e4b4cf4ae90be7564ffc38e/FLAG610b2e180 [2024-10-12 21:45:52,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95fcc5634/6133ec001e4b4cf4ae90be7564ffc38e [2024-10-12 21:45:52,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:45:52,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:45:52,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:45:52,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:45:52,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:45:52,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8aa745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52, skipping insertion in model container [2024-10-12 21:45:52,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:45:52,264 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c[914,927] [2024-10-12 21:45:52,300 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c[7125,7138] [2024-10-12 21:45:52,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:45:52,421 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:45:52,435 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c[914,927] [2024-10-12 21:45:52,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c[7125,7138] [2024-10-12 21:45:52,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:45:52,517 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:45:52,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52 WrapperNode [2024-10-12 21:45:52,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:45:52,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:45:52,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:45:52,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:45:52,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,578 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 949 [2024-10-12 21:45:52,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:45:52,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:45:52,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:45:52,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:45:52,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:45:52,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:45:52,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:45:52,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:45:52,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:45:52,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (1/1) ... [2024-10-12 21:45:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:45:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:45:52,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:45:52,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:45:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:45:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:45:52,749 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:45:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:45:52,751 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:45:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:45:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:45:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:45:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:45:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:45:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:45:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:45:52,752 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:45:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:45:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:45:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:45:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:45:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:45:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:45:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:45:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:45:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:45:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:45:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:45:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:45:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:45:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:45:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:45:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:45:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:45:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:45:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:45:52,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:45:52,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:45:53,629 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-10-12 21:45:53,629 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:45:53,727 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:45:53,727 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-12 21:45:53,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:45:53 BoogieIcfgContainer [2024-10-12 21:45:53,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:45:53,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:45:53,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:45:53,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:45:53,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:45:52" (1/3) ... [2024-10-12 21:45:53,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0c7ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:45:53, skipping insertion in model container [2024-10-12 21:45:53,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:45:52" (2/3) ... [2024-10-12 21:45:53,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0c7ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:45:53, skipping insertion in model container [2024-10-12 21:45:53,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:45:53" (3/3) ... [2024-10-12 21:45:53,737 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2024-10-12 21:45:53,749 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:45:53,750 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:45:53,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:45:53,830 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a9333c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:45:53,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:45:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 394 states, 338 states have (on average 1.7071005917159763) internal successors, (577), 345 states have internal predecessors, (577), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-12 21:45:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:45:53,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:53,857 INFO L215 NwaCegarLoop]: 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] [2024-10-12 21:45:53,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1088894603, now seen corresponding path program 1 times [2024-10-12 21:45:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027125496] [2024-10-12 21:45:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:45:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:54,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027125496] [2024-10-12 21:45:54,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027125496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:45:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633429285] [2024-10-12 21:45:54,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:45:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:54,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:45:54,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:45:54,383 INFO L87 Difference]: Start difference. First operand has 394 states, 338 states have (on average 1.7071005917159763) internal successors, (577), 345 states have internal predecessors, (577), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:45:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:55,669 INFO L93 Difference]: Finished difference Result 891 states and 1467 transitions. [2024-10-12 21:45:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:45:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-10-12 21:45:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:55,687 INFO L225 Difference]: With dead ends: 891 [2024-10-12 21:45:55,687 INFO L226 Difference]: Without dead ends: 515 [2024-10-12 21:45:55,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:45:55,696 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1025 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:55,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1324 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:45:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-12 21:45:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 477. [2024-10-12 21:45:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 403 states have (on average 1.5707196029776676) internal successors, (633), 410 states have internal predecessors, (633), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-10-12 21:45:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 735 transitions. [2024-10-12 21:45:55,776 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 735 transitions. Word has length 53 [2024-10-12 21:45:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:55,776 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 735 transitions. [2024-10-12 21:45:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:45:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 735 transitions. [2024-10-12 21:45:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:45:55,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:55,778 INFO L215 NwaCegarLoop]: 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] [2024-10-12 21:45:55,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:45:55,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:55,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1879957078, now seen corresponding path program 1 times [2024-10-12 21:45:55,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:55,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394306206] [2024-10-12 21:45:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:55,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:45:55,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394306206] [2024-10-12 21:45:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394306206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:45:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715327107] [2024-10-12 21:45:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:55,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:45:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:55,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:45:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:45:55,923 INFO L87 Difference]: Start difference. First operand 477 states and 735 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:45:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:56,993 INFO L93 Difference]: Finished difference Result 799 states and 1187 transitions. [2024-10-12 21:45:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:45:56,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-10-12 21:45:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:56,998 INFO L225 Difference]: With dead ends: 799 [2024-10-12 21:45:56,998 INFO L226 Difference]: Without dead ends: 636 [2024-10-12 21:45:56,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:45:57,000 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 1497 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:57,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1514 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:45:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-12 21:45:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 565. [2024-10-12 21:45:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 471 states have (on average 1.5477707006369428) internal successors, (729), 480 states have internal predecessors, (729), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2024-10-12 21:45:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 861 transitions. [2024-10-12 21:45:57,035 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 861 transitions. Word has length 53 [2024-10-12 21:45:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:57,035 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 861 transitions. [2024-10-12 21:45:57,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:45:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 861 transitions. [2024-10-12 21:45:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:45:57,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:57,038 INFO L215 NwaCegarLoop]: 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] [2024-10-12 21:45:57,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:45:57,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:57,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1456310356, now seen corresponding path program 1 times [2024-10-12 21:45:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909009187] [2024-10-12 21:45:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:45:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909009187] [2024-10-12 21:45:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909009187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:45:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534246977] [2024-10-12 21:45:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:57,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:45:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:45:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:45:57,190 INFO L87 Difference]: Start difference. First operand 565 states and 861 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:45:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:45:58,602 INFO L93 Difference]: Finished difference Result 840 states and 1248 transitions. [2024-10-12 21:45:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:45:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-12 21:45:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:45:58,606 INFO L225 Difference]: With dead ends: 840 [2024-10-12 21:45:58,606 INFO L226 Difference]: Without dead ends: 595 [2024-10-12 21:45:58,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:45:58,608 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 534 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:45:58,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2148 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:45:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-12 21:45:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 569. [2024-10-12 21:45:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 474 states have (on average 1.540084388185654) internal successors, (730), 483 states have internal predecessors, (730), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2024-10-12 21:45:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 863 transitions. [2024-10-12 21:45:58,632 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 863 transitions. Word has length 53 [2024-10-12 21:45:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:45:58,632 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 863 transitions. [2024-10-12 21:45:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:45:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 863 transitions. [2024-10-12 21:45:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:45:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:45:58,634 INFO L215 NwaCegarLoop]: 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] [2024-10-12 21:45:58,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:45:58,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:45:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:45:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -70106962, now seen corresponding path program 1 times [2024-10-12 21:45:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:45:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002708111] [2024-10-12 21:45:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:45:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:45:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:45:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:45:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:45:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:45:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:45:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:45:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:45:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:45:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:45:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:45:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002708111] [2024-10-12 21:45:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002708111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:45:58,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:45:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:45:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256992035] [2024-10-12 21:45:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:45:58,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:45:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:45:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:45:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:45:58,745 INFO L87 Difference]: Start difference. First operand 569 states and 863 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:00,038 INFO L93 Difference]: Finished difference Result 858 states and 1266 transitions. [2024-10-12 21:46:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:46:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-12 21:46:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:00,046 INFO L225 Difference]: With dead ends: 858 [2024-10-12 21:46:00,048 INFO L226 Difference]: Without dead ends: 609 [2024-10-12 21:46:00,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:00,049 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 537 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:00,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2147 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:46:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-12 21:46:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 581. [2024-10-12 21:46:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 483 states have (on average 1.5300207039337475) internal successors, (739), 492 states have internal predecessors, (739), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2024-10-12 21:46:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2024-10-12 21:46:00,101 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 53 [2024-10-12 21:46:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:00,104 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2024-10-12 21:46:00,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2024-10-12 21:46:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:46:00,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:00,105 INFO L215 NwaCegarLoop]: 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] [2024-10-12 21:46:00,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:46:00,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:00,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 352594864, now seen corresponding path program 1 times [2024-10-12 21:46:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480197909] [2024-10-12 21:46:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:46:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:46:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:46:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480197909] [2024-10-12 21:46:00,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480197909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:00,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:00,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:46:00,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257585589] [2024-10-12 21:46:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:00,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:46:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:46:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:00,320 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:01,221 INFO L93 Difference]: Finished difference Result 939 states and 1352 transitions. [2024-10-12 21:46:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:46:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-10-12 21:46:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:01,224 INFO L225 Difference]: With dead ends: 939 [2024-10-12 21:46:01,224 INFO L226 Difference]: Without dead ends: 680 [2024-10-12 21:46:01,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:46:01,225 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1490 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:01,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1345 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:46:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-12 21:46:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 591. [2024-10-12 21:46:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 491 states have (on average 1.5213849287169043) internal successors, (747), 500 states have internal predecessors, (747), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2024-10-12 21:46:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 883 transitions. [2024-10-12 21:46:01,252 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 883 transitions. Word has length 53 [2024-10-12 21:46:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:01,252 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 883 transitions. [2024-10-12 21:46:01,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 883 transitions. [2024-10-12 21:46:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 21:46:01,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:01,253 INFO L215 NwaCegarLoop]: 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] [2024-10-12 21:46:01,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:46:01,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:01,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash -668473490, now seen corresponding path program 1 times [2024-10-12 21:46:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588087683] [2024-10-12 21:46:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 21:46:01,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 21:46:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 21:46:01,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 21:46:01,307 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 21:46:01,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-12 21:46:01,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-12 21:46:01,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:46:01,311 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-12 21:46:01,430 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 21:46:01,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 09:46:01 BoogieIcfgContainer [2024-10-12 21:46:01,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 21:46:01,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 21:46:01,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 21:46:01,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 21:46:01,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:45:53" (3/4) ... [2024-10-12 21:46:01,440 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 21:46:01,541 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 21:46:01,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 21:46:01,542 INFO L158 Benchmark]: Toolchain (without parser) took 9450.06ms. Allocated memory was 186.6MB in the beginning and 375.4MB in the end (delta: 188.7MB). Free memory was 127.2MB in the beginning and 314.9MB in the end (delta: -187.7MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,542 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 21:46:01,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.43ms. Allocated memory is still 186.6MB. Free memory was 127.2MB in the beginning and 99.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.98ms. Allocated memory is still 186.6MB. Free memory was 99.9MB in the beginning and 95.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,543 INFO L158 Benchmark]: Boogie Preprocessor took 65.14ms. Allocated memory is still 186.6MB. Free memory was 95.3MB in the beginning and 89.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,543 INFO L158 Benchmark]: RCFGBuilder took 1082.60ms. Allocated memory was 186.6MB in the beginning and 304.1MB in the end (delta: 117.4MB). Free memory was 89.9MB in the beginning and 225.6MB in the end (delta: -135.7MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,543 INFO L158 Benchmark]: TraceAbstraction took 7705.77ms. Allocated memory was 304.1MB in the beginning and 375.4MB in the end (delta: 71.3MB). Free memory was 224.6MB in the beginning and 331.7MB in the end (delta: -107.1MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,544 INFO L158 Benchmark]: Witness Printer took 102.99ms. Allocated memory is still 375.4MB. Free memory was 331.7MB in the beginning and 314.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 21:46:01,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.43ms. Allocated memory is still 186.6MB. Free memory was 127.2MB in the beginning and 99.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.98ms. Allocated memory is still 186.6MB. Free memory was 99.9MB in the beginning and 95.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.14ms. Allocated memory is still 186.6MB. Free memory was 95.3MB in the beginning and 89.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1082.60ms. Allocated memory was 186.6MB in the beginning and 304.1MB in the end (delta: 117.4MB). Free memory was 89.9MB in the beginning and 225.6MB in the end (delta: -135.7MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7705.77ms. Allocated memory was 304.1MB in the beginning and 375.4MB in the end (delta: 71.3MB). Free memory was 224.6MB in the beginning and 331.7MB in the end (delta: -107.1MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. * Witness Printer took 102.99ms. Allocated memory is still 375.4MB. Free memory was 331.7MB in the beginning and 314.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int t9_pc = 0; [L510] int t10_pc = 0; [L511] int m_st ; [L512] int t1_st ; [L513] int t2_st ; [L514] int t3_st ; [L515] int t4_st ; [L516] int t5_st ; [L517] int t6_st ; [L518] int t7_st ; [L519] int t8_st ; [L520] int t9_st ; [L521] int t10_st ; [L522] int m_i ; [L523] int t1_i ; [L524] int t2_i ; [L525] int t3_i ; [L526] int t4_i ; [L527] int t5_i ; [L528] int t6_i ; [L529] int t7_i ; [L530] int t8_i ; [L531] int t9_i ; [L532] int t10_i ; [L533] int M_E = 2; [L534] int T1_E = 2; [L535] int T2_E = 2; [L536] int T3_E = 2; [L537] int T4_E = 2; [L538] int T5_E = 2; [L539] int T6_E = 2; [L540] int T7_E = 2; [L541] int T8_E = 2; [L542] int T9_E = 2; [L543] int T10_E = 2; [L544] int E_M = 2; [L545] int E_1 = 2; [L546] int E_2 = 2; [L547] int E_3 = 2; [L548] int E_4 = 2; [L549] int E_5 = 2; [L550] int E_6 = 2; [L551] int E_7 = 2; [L552] int E_8 = 2; [L553] int E_9 = 2; [L554] int E_10 = 2; [L567] int token ; [L569] int local ; [L2087] COND TRUE __VERIFIER_nondet_int() [L2088] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] CALL update_channels1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] RET update_channels1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] CALL activate_threads1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L70] int __retres1 ; VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L83] __retres1 = 0 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L89] int __retres1 ; VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L102] __retres1 = 0 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] RET activate_threads1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L427] COND TRUE 1 [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L347] COND TRUE 1 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L260] int __retres1 ; VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L367] CALL error1() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L28] reach_error() VAL [E_10=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 394 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5147 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5083 mSDsluCounter, 8478 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6880 mSDsCounter, 704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8204 IncrementalHoareTripleChecker+Invalid, 8908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 704 mSolverCounterUnsat, 1598 mSDtfsCounter, 8204 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=5, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 252 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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! [2024-10-12 21:46:01,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE