./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya --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 e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:10:48,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:10:48,975 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:10:48,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:10:48,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:10:49,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:10:49,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:10:49,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:10:49,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:10:49,008 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:10:49,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:10:49,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:10:49,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:10:49,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:10:49,011 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:10:49,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:10:49,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:10:49,013 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:10:49,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:10:49,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:10:49,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:10:49,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:10:49,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:10:49,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:10:49,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:10:49,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:10:49,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:10:49,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:10:49,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:10:49,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:10:49,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:10:49,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:10:49,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:10:49,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:10:49,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:10:49,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:10:49,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:10:49,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:10:49,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:10:49,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:10:49,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:10:49,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:10:49,024 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_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/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_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya 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 -> e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 [2023-11-29 01:10:49,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:10:49,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:10:49,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:10:49,267 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:10:49,267 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:10:49,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2023-11-29 01:10:52,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:10:52,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:10:52,249 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2023-11-29 01:10:52,265 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/data/cee31d61f/16504229383744fa815d392c13fc0565/FLAG330fc124b [2023-11-29 01:10:52,282 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/data/cee31d61f/16504229383744fa815d392c13fc0565 [2023-11-29 01:10:52,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:10:52,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:10:52,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:10:52,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:10:52,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:10:52,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a3161d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52, skipping insertion in model container [2023-11-29 01:10:52,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:10:52,570 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_48639919-3e6d-4270-a488-e84ec6176493/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[914,927] [2023-11-29 01:10:52,627 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_48639919-3e6d-4270-a488-e84ec6176493/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[7125,7138] [2023-11-29 01:10:52,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:10:52,709 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:10:52,722 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_48639919-3e6d-4270-a488-e84ec6176493/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[914,927] [2023-11-29 01:10:52,739 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_48639919-3e6d-4270-a488-e84ec6176493/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[7125,7138] [2023-11-29 01:10:52,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:10:52,797 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:10:52,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52 WrapperNode [2023-11-29 01:10:52,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:10:52,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:10:52,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:10:52,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:10:52,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,863 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 711 [2023-11-29 01:10:52,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:10:52,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:10:52,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:10:52,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:10:52,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,900 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:10:52,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:10:52,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:10:52,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:10:52,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:10:52,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:10:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:10:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:10:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 01:10:53,008 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 01:10:53,008 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 01:10:53,008 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 01:10:53,008 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 01:10:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 01:10:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 01:10:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 01:10:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 01:10:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 01:10:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 01:10:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 01:10:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 01:10:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 01:10:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 01:10:53,011 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 01:10:53,011 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 01:10:53,011 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 01:10:53,011 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 01:10:53,011 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 01:10:53,011 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 01:10:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 01:10:53,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:10:53,012 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 01:10:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 01:10:53,012 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 01:10:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 01:10:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:10:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:10:53,013 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 01:10:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 01:10:53,137 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:10:53,139 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:10:53,759 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:10:53,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:10:53,815 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-29 01:10:53,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:53 BoogieIcfgContainer [2023-11-29 01:10:53,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:10:53,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:10:53,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:10:53,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:10:53,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:10:52" (1/3) ... [2023-11-29 01:10:53,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:10:53, skipping insertion in model container [2023-11-29 01:10:53,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (2/3) ... [2023-11-29 01:10:53,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:10:53, skipping insertion in model container [2023-11-29 01:10:53,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:53" (3/3) ... [2023-11-29 01:10:53,825 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2023-11-29 01:10:53,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:10:53,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 01:10:53,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:10:53,905 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;@39989ced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:10:53,905 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 01:10:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 250 states have (on average 1.684) internal successors, (421), 257 states have internal predecessors, (421), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-29 01:10:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:10:53,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:53,920 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] [2023-11-29 01:10:53,921 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:53,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 110080447, now seen corresponding path program 1 times [2023-11-29 01:10:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029514028] [2023-11-29 01:10:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:10:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:10:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:10:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,372 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-29 01:10:54,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029514028] [2023-11-29 01:10:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029514028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384101678] [2023-11-29 01:10:54,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:54,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:54,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:54,412 INFO L87 Difference]: Start difference. First operand has 302 states, 250 states have (on average 1.684) internal successors, (421), 257 states have internal predecessors, (421), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:10:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:55,776 INFO L93 Difference]: Finished difference Result 711 states and 1147 transitions. [2023-11-29 01:10:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:10:55,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-11-29 01:10:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:55,796 INFO L225 Difference]: With dead ends: 711 [2023-11-29 01:10:55,796 INFO L226 Difference]: Without dead ends: 423 [2023-11-29 01:10:55,803 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-29 01:10:55,807 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 798 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:55,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1174 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:10:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-11-29 01:10:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 385. [2023-11-29 01:10:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 315 states have (on average 1.5396825396825398) internal successors, (485), 322 states have internal predecessors, (485), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2023-11-29 01:10:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 579 transitions. [2023-11-29 01:10:55,906 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 579 transitions. Word has length 53 [2023-11-29 01:10:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:55,907 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 579 transitions. [2023-11-29 01:10:55,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:10:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 579 transitions. [2023-11-29 01:10:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:10:55,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:55,912 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] [2023-11-29 01:10:55,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:10:55,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:55,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:55,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1436196062, now seen corresponding path program 1 times [2023-11-29 01:10:55,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:55,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059964501] [2023-11-29 01:10:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:55,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:10:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:10:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:10:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,123 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-29 01:10:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059964501] [2023-11-29 01:10:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059964501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:56,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044583609] [2023-11-29 01:10:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:56,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:56,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:56,128 INFO L87 Difference]: Start difference. First operand 385 states and 579 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:10:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:57,397 INFO L93 Difference]: Finished difference Result 707 states and 1031 transitions. [2023-11-29 01:10:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:10:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-11-29 01:10:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:57,406 INFO L225 Difference]: With dead ends: 707 [2023-11-29 01:10:57,406 INFO L226 Difference]: Without dead ends: 544 [2023-11-29 01:10:57,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:10:57,409 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 932 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:57,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1405 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:10:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2023-11-29 01:10:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 473. [2023-11-29 01:10:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 383 states have (on average 1.516971279373368) internal successors, (581), 392 states have internal predecessors, (581), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2023-11-29 01:10:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 705 transitions. [2023-11-29 01:10:57,463 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 705 transitions. Word has length 53 [2023-11-29 01:10:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:57,464 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 705 transitions. [2023-11-29 01:10:57,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:10:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 705 transitions. [2023-11-29 01:10:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:10:57,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:57,467 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] [2023-11-29 01:10:57,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:10:57,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:57,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1859842784, now seen corresponding path program 1 times [2023-11-29 01:10:57,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220952729] [2023-11-29 01:10:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:57,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:10:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:10:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:10:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,634 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-29 01:10:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220952729] [2023-11-29 01:10:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220952729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:57,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:10:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137648849] [2023-11-29 01:10:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:57,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:10:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:57,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:10:57,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:10:57,638 INFO L87 Difference]: Start difference. First operand 473 states and 705 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 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-29 01:10:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:59,618 INFO L93 Difference]: Finished difference Result 1725 states and 2467 transitions. [2023-11-29 01:10:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:10:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 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 53 [2023-11-29 01:10:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:59,630 INFO L225 Difference]: With dead ends: 1725 [2023-11-29 01:10:59,630 INFO L226 Difference]: Without dead ends: 1462 [2023-11-29 01:10:59,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 01:10:59,634 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 2449 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:59,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2463 Valid, 1638 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 01:10:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2023-11-29 01:10:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1296. [2023-11-29 01:10:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1023 states have (on average 1.4203323558162269) internal successors, (1453), 1047 states have internal predecessors, (1453), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2023-11-29 01:10:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1776 transitions. [2023-11-29 01:10:59,757 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1776 transitions. Word has length 53 [2023-11-29 01:10:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:59,757 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 1776 transitions. [2023-11-29 01:10:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 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-29 01:10:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1776 transitions. [2023-11-29 01:10:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:10:59,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:59,760 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] [2023-11-29 01:10:59,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:10:59,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:59,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1796340033, now seen corresponding path program 1 times [2023-11-29 01:10:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:59,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664351735] [2023-11-29 01:10:59,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:10:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:10:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:10:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:10:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:10:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,903 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-29 01:10:59,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:59,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664351735] [2023-11-29 01:10:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664351735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:10:59,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604485767] [2023-11-29 01:10:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:10:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:10:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:10:59,906 INFO L87 Difference]: Start difference. First operand 1296 states and 1776 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 01:11:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:01,060 INFO L93 Difference]: Finished difference Result 2532 states and 3433 transitions. [2023-11-29 01:11:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:11:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2023-11-29 01:11:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:01,071 INFO L225 Difference]: With dead ends: 2532 [2023-11-29 01:11:01,071 INFO L226 Difference]: Without dead ends: 1452 [2023-11-29 01:11:01,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:11:01,076 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 387 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:01,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1611 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:11:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2023-11-29 01:11:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1320. [2023-11-29 01:11:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1041 states have (on average 1.4053794428434199) internal successors, (1463), 1065 states have internal predecessors, (1463), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2023-11-29 01:11:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1792 transitions. [2023-11-29 01:11:01,273 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1792 transitions. Word has length 53 [2023-11-29 01:11:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:01,273 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1792 transitions. [2023-11-29 01:11:01,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 01:11:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1792 transitions. [2023-11-29 01:11:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:11:01,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:01,275 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] [2023-11-29 01:11:01,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:11:01,276 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:11:01,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1373638207, now seen corresponding path program 1 times [2023-11-29 01:11:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:01,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121430639] [2023-11-29 01:11:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:11:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:11:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:11:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:11:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:11:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:11:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:11:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:01,453 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-29 01:11:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121430639] [2023-11-29 01:11:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121430639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:11:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764905771] [2023-11-29 01:11:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:11:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:11:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:11:01,456 INFO L87 Difference]: Start difference. First operand 1320 states and 1792 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:11:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:02,677 INFO L93 Difference]: Finished difference Result 2570 states and 3395 transitions. [2023-11-29 01:11:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:11:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-11-29 01:11:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:11:02,688 INFO L225 Difference]: With dead ends: 2570 [2023-11-29 01:11:02,688 INFO L226 Difference]: Without dead ends: 1673 [2023-11-29 01:11:02,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:11:02,693 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 901 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:11:02,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1170 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:11:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2023-11-29 01:11:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1265. [2023-11-29 01:11:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1002 states have (on average 1.403193612774451) internal successors, (1406), 1021 states have internal predecessors, (1406), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2023-11-29 01:11:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1714 transitions. [2023-11-29 01:11:02,810 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1714 transitions. Word has length 53 [2023-11-29 01:11:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:11:02,810 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1714 transitions. [2023-11-29 01:11:02,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:11:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1714 transitions. [2023-11-29 01:11:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 01:11:02,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:11:02,812 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] [2023-11-29 01:11:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:11:02,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:11:02,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1900260735, now seen corresponding path program 1 times [2023-11-29 01:11:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:02,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353474036] [2023-11-29 01:11:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:02,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:02,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:02,876 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:11:02,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 01:11:02,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 01:11:02,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:11:02,881 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 01:11:02,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:11:02,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-29 01:11:02,948 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 01:11:02,955 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 01:11:02,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:11:02 BoogieIcfgContainer [2023-11-29 01:11:02,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:11:02,978 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:11:02,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:11:02,978 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:11:02,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:53" (3/4) ... [2023-11-29 01:11:02,979 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 01:11:03,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-29 01:11:03,004 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 01:11:03,008 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 01:11:03,085 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:11:03,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:11:03,086 INFO L158 Benchmark]: Toolchain (without parser) took 10799.85ms. Allocated memory was 123.7MB in the beginning and 232.8MB in the end (delta: 109.1MB). Free memory was 62.7MB in the beginning and 168.1MB in the end (delta: -105.4MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2023-11-29 01:11:03,087 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:11:03,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.42ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 62.5MB in the beginning and 110.4MB in the end (delta: -47.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-11-29 01:11:03,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 106.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:11:03,088 INFO L158 Benchmark]: Boogie Preprocessor took 73.59ms. Allocated memory is still 159.4MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:11:03,089 INFO L158 Benchmark]: RCFGBuilder took 877.25ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 107.7MB in the end (delta: -5.4MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2023-11-29 01:11:03,089 INFO L158 Benchmark]: TraceAbstraction took 9158.87ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 106.9MB in the beginning and 179.6MB in the end (delta: -72.7MB). Peak memory consumption was 228.3kB. Max. memory is 16.1GB. [2023-11-29 01:11:03,089 INFO L158 Benchmark]: Witness Printer took 107.98ms. Allocated memory is still 232.8MB. Free memory was 179.6MB in the beginning and 168.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:11:03,091 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.14ms. Allocated memory is still 123.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.42ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 62.5MB in the beginning and 110.4MB in the end (delta: -47.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 106.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.59ms. Allocated memory is still 159.4MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 877.25ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 107.7MB in the end (delta: -5.4MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9158.87ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 106.9MB in the beginning and 179.6MB in the end (delta: -72.7MB). Peak memory consumption was 228.3kB. Max. memory is 16.1GB. * Witness Printer took 107.98ms. Allocated memory is still 232.8MB. Free memory was 179.6MB in the beginning and 168.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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 t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int m_st ; [L508] int t1_st ; [L509] int t2_st ; [L510] int t3_st ; [L511] int t4_st ; [L512] int t5_st ; [L513] int t6_st ; [L514] int m_i ; [L515] int t1_i ; [L516] int t2_i ; [L517] int t3_i ; [L518] int t4_i ; [L519] int t5_i ; [L520] int t6_i ; [L521] int M_E = 2; [L522] int T1_E = 2; [L523] int T2_E = 2; [L524] int T3_E = 2; [L525] int T4_E = 2; [L526] int T5_E = 2; [L527] int T6_E = 2; [L528] int E_M = 2; [L529] int E_1 = 2; [L530] int E_2 = 2; [L531] int E_3 = 2; [L532] int E_4 = 2; [L533] int E_5 = 2; [L534] int E_6 = 2; [L543] int token ; [L545] int local ; [L1587] COND TRUE __VERIFIER_nondet_int() [L1588] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, 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_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, 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_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L427] COND TRUE 1 [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, 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_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, 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, 302 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5537 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5467 mSDsluCounter, 6998 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5728 mSDsCounter, 1036 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6787 IncrementalHoareTripleChecker+Invalid, 7823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1036 mSolverCounterUnsat, 1270 mSDtfsCounter, 6787 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1320occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 5 MinimizatonAttempts, 815 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 578 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-29 01:11:03,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48639919-3e6d-4270-a488-e84ec6176493/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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