./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:47,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:47,108 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:02:47,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:47,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:47,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:47,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:47,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:47,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:47,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:47,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:47,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:47,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:47,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:47,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:47,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:47,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:47,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:47,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:47,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:47,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:47,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:47,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:47,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:47,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:47,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:47,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:47,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:47,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:47,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:47,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:47,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:47,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:47,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:47,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:47,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:47,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:47,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:47,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:47,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:47,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:47,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:47,182 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_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/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_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2024-10-31 22:02:47,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:47,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:47,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:47,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:47,512 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:47,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c Unable to find full path for "g++" [2024-10-31 22:02:49,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:49,820 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:49,821 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2024-10-31 22:02:49,833 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/data/62a610b62/2ef48ad56f7740f5bf61108f5f36cc0a/FLAG7eb18efdb [2024-10-31 22:02:49,847 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/data/62a610b62/2ef48ad56f7740f5bf61108f5f36cc0a [2024-10-31 22:02:49,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:49,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:49,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:49,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:49,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:49,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:49" (1/1) ... [2024-10-31 22:02:49,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e37cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:49, skipping insertion in model container [2024-10-31 22:02:49,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:49" (1/1) ... [2024-10-31 22:02:49,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:50,102 WARN L251 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_29bce914-a706-4cb5-878e-5ce82be394c9/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2024-10-31 22:02:50,157 WARN L251 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_29bce914-a706-4cb5-878e-5ce82be394c9/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2024-10-31 22:02:50,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:50,209 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:50,222 WARN L251 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_29bce914-a706-4cb5-878e-5ce82be394c9/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2024-10-31 22:02:50,245 WARN L251 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_29bce914-a706-4cb5-878e-5ce82be394c9/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2024-10-31 22:02:50,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:50,303 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:50,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50 WrapperNode [2024-10-31 22:02:50,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:50,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:50,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:50,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:50,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,360 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 469 [2024-10-31 22:02:50,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:50,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:50,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:50,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:50,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:02:50,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:50,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:50,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:50,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:50,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:50,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:50,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-31 22:02:50,520 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-31 22:02:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-31 22:02:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-31 22:02:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-31 22:02:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-31 22:02:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-31 22:02:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-31 22:02:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-31 22:02:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-31 22:02:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-31 22:02:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-31 22:02:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-31 22:02:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-31 22:02:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-31 22:02:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-31 22:02:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-31 22:02:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-31 22:02:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-31 22:02:50,523 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-31 22:02:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-31 22:02:50,523 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-31 22:02:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:02:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-31 22:02:50,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-31 22:02:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-31 22:02:50,524 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-31 22:02:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:50,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-31 22:02:50,524 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-31 22:02:50,625 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:50,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:51,230 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-31 22:02:51,230 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:51,253 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:51,253 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-31 22:02:51,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:51 BoogieIcfgContainer [2024-10-31 22:02:51,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:51,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:51,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:51,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:51,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:49" (1/3) ... [2024-10-31 22:02:51,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6991cde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:51, skipping insertion in model container [2024-10-31 22:02:51,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50" (2/3) ... [2024-10-31 22:02:51,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6991cde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:51, skipping insertion in model container [2024-10-31 22:02:51,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:51" (3/3) ... [2024-10-31 22:02:51,264 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2024-10-31 22:02:51,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:51,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:02:51,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:51,405 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67636dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:51,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 22:02:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 189 states have (on average 1.5449735449735449) internal successors, (292), 196 states have internal predecessors, (292), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-31 22:02:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:02:51,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:51,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:51,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:51,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 249389548, now seen corresponding path program 1 times [2024-10-31 22:02:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907971711] [2024-10-31 22:02:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:02:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:02:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:02:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:02:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:51,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:51,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907971711] [2024-10-31 22:02:51,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907971711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:51,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:51,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:02:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451112256] [2024-10-31 22:02:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:51,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:02:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:02:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:02:51,993 INFO L87 Difference]: Start difference. First operand has 237 states, 189 states have (on average 1.5449735449735449) internal successors, (292), 196 states have internal predecessors, (292), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 22:02:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:52,877 INFO L93 Difference]: Finished difference Result 475 states and 709 transitions. [2024-10-31 22:02:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:02:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-31 22:02:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:52,895 INFO L225 Difference]: With dead ends: 475 [2024-10-31 22:02:52,895 INFO L226 Difference]: Without dead ends: 245 [2024-10-31 22:02:52,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:02:52,906 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 352 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:52,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 746 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:02:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-31 22:02:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2024-10-31 22:02:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 181 states have (on average 1.441988950276243) internal successors, (261), 186 states have internal predecessors, (261), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:02:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 320 transitions. [2024-10-31 22:02:53,014 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 320 transitions. Word has length 59 [2024-10-31 22:02:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:53,015 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 320 transitions. [2024-10-31 22:02:53,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 22:02:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 320 transitions. [2024-10-31 22:02:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:02:53,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:53,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:53,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:53,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:53,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash 730469806, now seen corresponding path program 1 times [2024-10-31 22:02:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175596745] [2024-10-31 22:02:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:02:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:02:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:02:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:02:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175596745] [2024-10-31 22:02:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175596745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:53,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:53,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:02:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212765945] [2024-10-31 22:02:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:53,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:02:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:02:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:53,388 INFO L87 Difference]: Start difference. First operand 227 states and 320 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 22:02:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:54,453 INFO L93 Difference]: Finished difference Result 452 states and 636 transitions. [2024-10-31 22:02:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:02:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-31 22:02:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:54,461 INFO L225 Difference]: With dead ends: 452 [2024-10-31 22:02:54,461 INFO L226 Difference]: Without dead ends: 363 [2024-10-31 22:02:54,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:02:54,464 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 461 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:54,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1058 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:02:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-31 22:02:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2024-10-31 22:02:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 257 states have (on average 1.4202334630350195) internal successors, (365), 264 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2024-10-31 22:02:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2024-10-31 22:02:54,537 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 59 [2024-10-31 22:02:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:54,537 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2024-10-31 22:02:54,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-31 22:02:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2024-10-31 22:02:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:02:54,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:54,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:54,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1493119437, now seen corresponding path program 1 times [2024-10-31 22:02:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537543043] [2024-10-31 22:02:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:02:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:02:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:02:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:02:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537543043] [2024-10-31 22:02:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537543043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937387241] [2024-10-31 22:02:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:02:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:02:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:54,791 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:55,710 INFO L93 Difference]: Finished difference Result 536 states and 743 transitions. [2024-10-31 22:02:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:02:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-31 22:02:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:55,714 INFO L225 Difference]: With dead ends: 536 [2024-10-31 22:02:55,714 INFO L226 Difference]: Without dead ends: 358 [2024-10-31 22:02:55,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:02:55,717 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 368 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:55,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1149 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:02:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-31 22:02:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2024-10-31 22:02:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 261 states have (on average 1.4099616858237547) internal successors, (368), 268 states have internal predecessors, (368), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2024-10-31 22:02:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 455 transitions. [2024-10-31 22:02:55,756 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 455 transitions. Word has length 59 [2024-10-31 22:02:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:55,756 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 455 transitions. [2024-10-31 22:02:55,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 455 transitions. [2024-10-31 22:02:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:02:55,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:55,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:55,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:55,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:55,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1767879051, now seen corresponding path program 1 times [2024-10-31 22:02:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:55,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685838134] [2024-10-31 22:02:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:02:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:02:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:02:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:02:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685838134] [2024-10-31 22:02:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685838134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939878704] [2024-10-31 22:02:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:55,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:02:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:02:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:55,982 INFO L87 Difference]: Start difference. First operand 328 states and 455 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:02:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:58,196 INFO L93 Difference]: Finished difference Result 1508 states and 2053 transitions. [2024-10-31 22:02:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-31 22:02:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2024-10-31 22:02:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:58,210 INFO L225 Difference]: With dead ends: 1508 [2024-10-31 22:02:58,211 INFO L226 Difference]: Without dead ends: 1325 [2024-10-31 22:02:58,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-31 22:02:58,216 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1438 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:58,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1472 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 22:02:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-31 22:02:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1076. [2024-10-31 22:02:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 852 states have (on average 1.3497652582159625) internal successors, (1150), 869 states have internal predecessors, (1150), 120 states have call successors, (120), 89 states have call predecessors, (120), 102 states have return successors, (158), 120 states have call predecessors, (158), 117 states have call successors, (158) [2024-10-31 22:02:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1428 transitions. [2024-10-31 22:02:58,392 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1428 transitions. Word has length 59 [2024-10-31 22:02:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:58,393 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1428 transitions. [2024-10-31 22:02:58,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:02:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1428 transitions. [2024-10-31 22:02:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:02:58,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:58,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:58,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:58,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 796204364, now seen corresponding path program 1 times [2024-10-31 22:02:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481944612] [2024-10-31 22:02:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-31 22:02:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-31 22:02:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 22:02:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:02:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:02:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:58,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481944612] [2024-10-31 22:02:58,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481944612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:58,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:58,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631881263] [2024-10-31 22:02:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:58,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:02:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:58,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:02:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:58,621 INFO L87 Difference]: Start difference. First operand 1076 states and 1428 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:59,743 INFO L93 Difference]: Finished difference Result 2201 states and 2912 transitions. [2024-10-31 22:02:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:02:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-31 22:02:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:59,752 INFO L225 Difference]: With dead ends: 2201 [2024-10-31 22:02:59,752 INFO L226 Difference]: Without dead ends: 1270 [2024-10-31 22:02:59,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:02:59,756 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 251 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:59,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1284 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:02:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-31 22:02:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1106. [2024-10-31 22:02:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 876 states have (on average 1.3333333333333333) internal successors, (1168), 893 states have internal predecessors, (1168), 120 states have call successors, (120), 89 states have call predecessors, (120), 108 states have return successors, (166), 126 states have call predecessors, (166), 117 states have call successors, (166) [2024-10-31 22:02:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1454 transitions. [2024-10-31 22:02:59,880 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1454 transitions. Word has length 59 [2024-10-31 22:02:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:59,880 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1454 transitions. [2024-10-31 22:02:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1454 transitions. [2024-10-31 22:02:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:02:59,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:59,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:59,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:59,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1009233970, now seen corresponding path program 1 times [2024-10-31 22:02:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204893349] [2024-10-31 22:02:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:59,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:59,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:59,945 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:59,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-31 22:02:59,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-31 22:02:59,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:59,952 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-31 22:03:00,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:03:00,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:03:00 BoogieIcfgContainer [2024-10-31 22:03:00,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:03:00,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:03:00,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:03:00,049 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:03:00,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:51" (3/4) ... [2024-10-31 22:03:00,052 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:03:00,158 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:03:00,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:03:00,159 INFO L158 Benchmark]: Toolchain (without parser) took 10308.01ms. Allocated memory was 127.9MB in the beginning and 249.6MB in the end (delta: 121.6MB). Free memory was 89.7MB in the beginning and 90.7MB in the end (delta: -913.9kB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,159 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 127.9MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:03:00,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.38ms. Allocated memory is still 127.9MB. Free memory was 89.7MB in the beginning and 69.7MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.19ms. Allocated memory is still 127.9MB. Free memory was 69.7MB in the beginning and 67.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,160 INFO L158 Benchmark]: Boogie Preprocessor took 59.25ms. Allocated memory is still 127.9MB. Free memory was 67.0MB in the beginning and 63.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,161 INFO L158 Benchmark]: RCFGBuilder took 832.64ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 63.5MB in the beginning and 109.0MB in the end (delta: -45.5MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,161 INFO L158 Benchmark]: TraceAbstraction took 8791.16ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 109.0MB in the beginning and 101.1MB in the end (delta: 7.8MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,161 INFO L158 Benchmark]: Witness Printer took 109.99ms. Allocated memory is still 249.6MB. Free memory was 101.1MB in the beginning and 90.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-31 22:03:00,163 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.33ms. Allocated memory is still 127.9MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.38ms. Allocated memory is still 127.9MB. Free memory was 89.7MB in the beginning and 69.7MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.19ms. Allocated memory is still 127.9MB. Free memory was 69.7MB in the beginning and 67.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.25ms. Allocated memory is still 127.9MB. Free memory was 67.0MB in the beginning and 63.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 832.64ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 63.5MB in the beginning and 109.0MB in the end (delta: -45.5MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8791.16ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 109.0MB in the beginning and 101.1MB in the end (delta: 7.8MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 109.99ms. Allocated memory is still 249.6MB. Free memory was 101.1MB in the beginning and 90.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L85] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L104] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 237 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2905 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2870 mSDsluCounter, 5709 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4590 mSDsCounter, 717 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4310 IncrementalHoareTripleChecker+Invalid, 5027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 717 mSolverCounterUnsat, 1119 mSDtfsCounter, 4310 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1106occurred in iteration=5, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 501 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-31 22:03:00,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29bce914-a706-4cb5-878e-5ce82be394c9/bin/uautomizer-verify-4GaUIPS5ZU/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