./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl --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 c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:25:24,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:25:24,548 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:25:24,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:25:24,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:25:24,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:25:24,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:25:24,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:25:24,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:25:24,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:25:24,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:25:24,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:25:24,611 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:25:24,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:25:24,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:25:24,613 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:25:24,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:25:24,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:25:24,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:25:24,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:25:24,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:25:24,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:25:24,616 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:25:24,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:25:24,617 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:25:24,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:25:24,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:25:24,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:25:24,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:24,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:25:24,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:25:24,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:25:24,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:25:24,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:25:24,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:25:24,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:25:24,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:25:24,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:25:24,630 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:25:24,631 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl 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 -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2023-11-12 02:25:24,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:25:24,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:25:24,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:25:24,971 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:25:24,975 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:25:24,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-11-12 02:25:28,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:25:28,316 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:25:28,317 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-11-12 02:25:28,331 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/data/46c3b89da/127352c8a5914386bff94a0e36838d19/FLAGa050822eb [2023-11-12 02:25:28,350 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/data/46c3b89da/127352c8a5914386bff94a0e36838d19 [2023-11-12 02:25:28,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:25:28,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:25:28,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:28,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:25:28,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:25:28,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a50920b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28, skipping insertion in model container [2023-11-12 02:25:28,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,424 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:25:28,606 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2023-11-12 02:25:28,666 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2023-11-12 02:25:28,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:28,721 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:25:28,735 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2023-11-12 02:25:28,788 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2023-11-12 02:25:28,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:28,848 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:25:28,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28 WrapperNode [2023-11-12 02:25:28,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:28,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:28,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:25:28,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:25:28,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,914 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 471 [2023-11-12 02:25:28,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:28,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:25:28,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:25:28,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:25:28,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:25:28,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:25:28,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:25:28,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:25:28,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (1/1) ... [2023-11-12 02:25:28,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:28,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:29,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:25:29,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:25:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:25:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-12 02:25:29,050 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-12 02:25:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-12 02:25:29,051 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-12 02:25:29,051 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-12 02:25:29,051 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-12 02:25:29,051 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-12 02:25:29,051 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-12 02:25:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-12 02:25:29,052 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-12 02:25:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-12 02:25:29,052 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-12 02:25:29,052 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-12 02:25:29,053 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-12 02:25:29,053 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-12 02:25:29,053 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-12 02:25:29,053 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-12 02:25:29,053 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-12 02:25:29,054 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-12 02:25:29,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-12 02:25:29,054 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-12 02:25:29,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-12 02:25:29,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:25:29,055 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-12 02:25:29,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-12 02:25:29,055 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-12 02:25:29,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-12 02:25:29,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:25:29,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:25:29,056 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-12 02:25:29,056 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-12 02:25:29,173 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:25:29,178 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:25:29,791 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:25:29,801 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:25:29,801 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-12 02:25:29,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:29 BoogieIcfgContainer [2023-11-12 02:25:29,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:25:29,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:25:29,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:25:29,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:25:29,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:25:28" (1/3) ... [2023-11-12 02:25:29,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fc839f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:29, skipping insertion in model container [2023-11-12 02:25:29,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:28" (2/3) ... [2023-11-12 02:25:29,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fc839f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:29, skipping insertion in model container [2023-11-12 02:25:29,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:29" (3/3) ... [2023-11-12 02:25:29,812 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-11-12 02:25:29,832 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:25:29,832 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:25:29,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:25:29,913 INFO L357 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, mHoare=true, 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;@61c614b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:25:29,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-12 02:25:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 189 states have (on average 1.5449735449735449) internal successors, (292), 196 states have internal predecessors, (292), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-12 02:25:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-12 02:25:29,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:29,940 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:29,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:29,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 249389548, now seen corresponding path program 1 times [2023-11-12 02:25:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888874760] [2023-11-12 02:25:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:25:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:25:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:25:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:25:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:25:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:30,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888874760] [2023-11-12 02:25:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888874760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:30,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:25:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701085290] [2023-11-12 02:25:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:30,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:25:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:30,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:25:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:25:30,447 INFO L87 Difference]: Start difference. First operand has 237 states, 189 states have (on average 1.5449735449735449) internal successors, (292), 196 states have internal predecessors, (292), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-12 02:25:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:31,281 INFO L93 Difference]: Finished difference Result 475 states and 709 transitions. [2023-11-12 02:25:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:31,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-11-12 02:25:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:31,298 INFO L225 Difference]: With dead ends: 475 [2023-11-12 02:25:31,298 INFO L226 Difference]: Without dead ends: 245 [2023-11-12 02:25:31,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:25:31,308 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 463 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:31,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 601 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:25:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-12 02:25:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2023-11-12 02:25:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 181 states have (on average 1.441988950276243) internal successors, (261), 186 states have internal predecessors, (261), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-12 02:25:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 320 transitions. [2023-11-12 02:25:31,381 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 320 transitions. Word has length 59 [2023-11-12 02:25:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:31,382 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 320 transitions. [2023-11-12 02:25:31,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-12 02:25:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 320 transitions. [2023-11-12 02:25:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-12 02:25:31,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:31,387 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:31,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:25:31,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:31,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash 730469806, now seen corresponding path program 1 times [2023-11-12 02:25:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674402450] [2023-11-12 02:25:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:25:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:25:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:25:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:25:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:25:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:31,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674402450] [2023-11-12 02:25:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674402450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:31,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:31,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:25:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93481109] [2023-11-12 02:25:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:31,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:25:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:25:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:25:31,754 INFO L87 Difference]: Start difference. First operand 227 states and 320 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-11-12 02:25:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:32,755 INFO L93 Difference]: Finished difference Result 452 states and 636 transitions. [2023-11-12 02:25:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:25:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2023-11-12 02:25:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:32,761 INFO L225 Difference]: With dead ends: 452 [2023-11-12 02:25:32,762 INFO L226 Difference]: Without dead ends: 363 [2023-11-12 02:25:32,763 INFO L412 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 [2023-11-12 02:25:32,764 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 770 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:32,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 778 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:25:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-12 02:25:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2023-11-12 02:25:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 257 states have (on average 1.4202334630350195) internal successors, (365), 264 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-11-12 02:25:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2023-11-12 02:25:32,819 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 59 [2023-11-12 02:25:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:32,819 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2023-11-12 02:25:32,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-11-12 02:25:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2023-11-12 02:25:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-12 02:25:32,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:32,823 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:32,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:25:32,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:32,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1493119437, now seen corresponding path program 1 times [2023-11-12 02:25:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529020269] [2023-11-12 02:25:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:25:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:25:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:25:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:25:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:25:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529020269] [2023-11-12 02:25:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529020269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:25:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869802446] [2023-11-12 02:25:33,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:33,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:25:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:25:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:25:33,028 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-11-12 02:25:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:33,880 INFO L93 Difference]: Finished difference Result 538 states and 746 transitions. [2023-11-12 02:25:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:25:33,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2023-11-12 02:25:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:33,885 INFO L225 Difference]: With dead ends: 538 [2023-11-12 02:25:33,885 INFO L226 Difference]: Without dead ends: 360 [2023-11-12 02:25:33,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:25:33,888 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 377 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:33,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1150 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:25:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-11-12 02:25:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 328. [2023-11-12 02:25:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 261 states have (on average 1.4099616858237547) internal successors, (368), 268 states have internal predecessors, (368), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-11-12 02:25:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 455 transitions. [2023-11-12 02:25:33,928 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 455 transitions. Word has length 59 [2023-11-12 02:25:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:33,929 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 455 transitions. [2023-11-12 02:25:33,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-11-12 02:25:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 455 transitions. [2023-11-12 02:25:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-12 02:25:33,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:33,932 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:33,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:25:33,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:33,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1767879051, now seen corresponding path program 1 times [2023-11-12 02:25:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:33,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982423346] [2023-11-12 02:25:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:25:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:25:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:25:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:25:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:25:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982423346] [2023-11-12 02:25:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982423346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:34,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:25:34,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691254579] [2023-11-12 02:25:34,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:34,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:25:34,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:34,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:25:34,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:25:34,110 INFO L87 Difference]: Start difference. First operand 328 states and 455 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-12 02:25:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:35,998 INFO L93 Difference]: Finished difference Result 1242 states and 1683 transitions. [2023-11-12 02:25:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-12 02:25:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2023-11-12 02:25:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:36,009 INFO L225 Difference]: With dead ends: 1242 [2023-11-12 02:25:36,009 INFO L226 Difference]: Without dead ends: 1047 [2023-11-12 02:25:36,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-12 02:25:36,020 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 1925 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:36,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 1500 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 02:25:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-11-12 02:25:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 909. [2023-11-12 02:25:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 723 states have (on average 1.359612724757953) internal successors, (983), 738 states have internal predecessors, (983), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2023-11-12 02:25:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1196 transitions. [2023-11-12 02:25:36,132 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1196 transitions. Word has length 59 [2023-11-12 02:25:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:36,134 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 1196 transitions. [2023-11-12 02:25:36,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-12 02:25:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1196 transitions. [2023-11-12 02:25:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-12 02:25:36,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:36,139 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:36,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:25:36,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:36,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash 796204364, now seen corresponding path program 1 times [2023-11-12 02:25:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668162221] [2023-11-12 02:25:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:25:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:25:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:25:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:25:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:25:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668162221] [2023-11-12 02:25:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668162221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:36,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:25:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102105060] [2023-11-12 02:25:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:36,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:25:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:25:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:25:36,362 INFO L87 Difference]: Start difference. First operand 909 states and 1196 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-11-12 02:25:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:37,258 INFO L93 Difference]: Finished difference Result 1791 states and 2340 transitions. [2023-11-12 02:25:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:25:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2023-11-12 02:25:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:37,265 INFO L225 Difference]: With dead ends: 1791 [2023-11-12 02:25:37,265 INFO L226 Difference]: Without dead ends: 1021 [2023-11-12 02:25:37,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:25:37,268 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 259 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:37,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1284 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:25:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2023-11-12 02:25:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 929. [2023-11-12 02:25:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 739 states have (on average 1.3450608930987822) internal successors, (994), 754 states have internal predecessors, (994), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2023-11-12 02:25:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1211 transitions. [2023-11-12 02:25:37,343 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1211 transitions. Word has length 59 [2023-11-12 02:25:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:37,344 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1211 transitions. [2023-11-12 02:25:37,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-11-12 02:25:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1211 transitions. [2023-11-12 02:25:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-12 02:25:37,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:37,345 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:37,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:37,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:37,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1009233970, now seen corresponding path program 1 times [2023-11-12 02:25:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462679560] [2023-11-12 02:25:37,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:25:37,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:25:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:25:37,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:25:37,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:25:37,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-12 02:25:37,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-12 02:25:37,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:25:37,424 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-12 02:25:37,429 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:25:37,506 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-12 02:25:37,519 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-12 02:25:37,522 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-12 02:25:37,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:25:37 BoogieIcfgContainer [2023-11-12 02:25:37,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:25:37,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:25:37,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:25:37,559 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:25:37,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:29" (3/4) ... [2023-11-12 02:25:37,562 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:25:37,584 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-12 02:25:37,586 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-12 02:25:37,588 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-12 02:25:37,671 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:25:37,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:25:37,672 INFO L158 Benchmark]: Toolchain (without parser) took 9312.81ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 120.8MB in the beginning and 60.2MB in the end (delta: 60.6MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,674 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:37,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.03ms. Allocated memory is still 151.0MB. Free memory was 120.6MB in the beginning and 104.3MB in the end (delta: 16.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.14ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 101.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,675 INFO L158 Benchmark]: Boogie Preprocessor took 46.10ms. Allocated memory is still 151.0MB. Free memory was 101.5MB in the beginning and 98.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,675 INFO L158 Benchmark]: RCFGBuilder took 841.88ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 99.0MB in the end (delta: -347.1kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,676 INFO L158 Benchmark]: TraceAbstraction took 7751.95ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 97.9MB in the beginning and 67.5MB in the end (delta: 30.3MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,676 INFO L158 Benchmark]: Witness Printer took 113.06ms. Allocated memory is still 182.5MB. Free memory was 67.5MB in the beginning and 60.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:25:37,680 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.28ms. Allocated memory is still 125.8MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.03ms. Allocated memory is still 151.0MB. Free memory was 120.6MB in the beginning and 104.3MB in the end (delta: 16.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.14ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 101.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.10ms. Allocated memory is still 151.0MB. Free memory was 101.5MB in the beginning and 98.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 841.88ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 99.0MB in the end (delta: -347.1kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7751.95ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 97.9MB in the beginning and 67.5MB in the end (delta: 30.3MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 113.06ms. Allocated memory is still 182.5MB. Free memory was 67.5MB in the beginning and 60.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, 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=0, 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=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] 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 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, kernel_st=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, kernel_st=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, kernel_st=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L85] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L104] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, kernel_st=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, kernel_st=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, kernel_st=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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, __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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_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, 237 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3830 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3794 mSDsluCounter, 5313 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4244 mSDsCounter, 945 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4142 IncrementalHoareTripleChecker+Invalid, 5087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 945 mSolverCounterUnsat, 1069 mSDtfsCounter, 4142 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=929occurred in iteration=5, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 320 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 540 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! [2023-11-12 02:25:37,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f664886-dcf3-4616-8d93-54a13b3eec23/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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