./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd --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 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:11:03,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:11:03,415 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:11:03,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:11:03,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:11:03,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:11:03,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:11:03,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:11:03,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:11:03,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:11:03,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:11:03,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:11:03,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:11:03,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:11:03,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:11:03,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:11:03,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:11:03,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:11:03,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:11:03,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:11:03,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:11:03,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:11:03,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:11:03,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:11:03,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:11:03,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:11:03,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:11:03,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:11:03,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:11:03,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:11:03,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:11:03,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:11:03,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:11:03,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:11:03,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:11:03,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:11:03,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:11:03,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:11:03,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:11:03,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:11:03,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:11:03,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:11:03,487 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd 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 -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2024-11-13 15:11:03,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:11:03,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:11:03,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:11:03,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:11:03,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:11:03,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c Unable to find full path for "g++" [2024-11-13 15:11:06,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:11:07,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:11:07,022 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-11-13 15:11:07,051 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/data/93d391d6a/867506d02a9e43b6b1373318644fb108/FLAGffbfcf7e2 [2024-11-13 15:11:07,088 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/data/93d391d6a/867506d02a9e43b6b1373318644fb108 [2024-11-13 15:11:07,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:11:07,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:11:07,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:11:07,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:11:07,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:11:07,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:07,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c7d421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07, skipping insertion in model container [2024-11-13 15:11:07,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:07,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:11:07,489 WARN L250 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_9cb67fef-2cae-4397-b31f-6648166deb6b/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-11-13 15:11:07,656 WARN L250 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_9cb67fef-2cae-4397-b31f-6648166deb6b/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-11-13 15:11:07,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:11:07,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:11:07,804 WARN L250 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_9cb67fef-2cae-4397-b31f-6648166deb6b/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-11-13 15:11:07,848 WARN L250 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_9cb67fef-2cae-4397-b31f-6648166deb6b/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-11-13 15:11:07,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:11:07,940 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:11:07,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07 WrapperNode [2024-11-13 15:11:07,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:11:07,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:11:07,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:11:07,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:11:07,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:07,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,062 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 401 [2024-11-13 15:11:08,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:11:08,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:11:08,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:11:08,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:11:08,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,122 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-11-13 15:11:08,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:11:08,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:11:08,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:11:08,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:11:08,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (1/1) ... [2024-11-13 15:11:08,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:11:08,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:11:08,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:11:08,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:11:08,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:11:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-13 15:11:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-13 15:11:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-13 15:11:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-13 15:11:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-13 15:11:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-13 15:11:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-13 15:11:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-13 15:11:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-13 15:11:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-13 15:11:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-13 15:11:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-13 15:11:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-13 15:11:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-13 15:11:08,301 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-13 15:11:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-13 15:11:08,301 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-13 15:11:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-13 15:11:08,301 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-13 15:11:08,301 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-13 15:11:08,302 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-13 15:11:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-13 15:11:08,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:11:08,302 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-13 15:11:08,302 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-13 15:11:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-13 15:11:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-13 15:11:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:11:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:11:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-13 15:11:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-13 15:11:08,538 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:11:08,544 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:11:09,625 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-13 15:11:09,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:11:09,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:11:09,659 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-13 15:11:09,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:11:09 BoogieIcfgContainer [2024-11-13 15:11:09,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:11:09,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:11:09,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:11:09,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:11:09,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:11:07" (1/3) ... [2024-11-13 15:11:09,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a31f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:11:09, skipping insertion in model container [2024-11-13 15:11:09,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:11:07" (2/3) ... [2024-11-13 15:11:09,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a31f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:11:09, skipping insertion in model container [2024-11-13 15:11:09,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:11:09" (3/3) ... [2024-11-13 15:11:09,676 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-11-13 15:11:09,703 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:11:09,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c that has 15 procedures, 211 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2024-11-13 15:11:09,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:11:09,902 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;@13f711af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:11:09,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 15:11:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 164 states have (on average 1.524390243902439) internal successors, (250), 171 states have internal predecessors, (250), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-13 15:11:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:09,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:09,931 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-11-13 15:11:09,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1359247561, now seen corresponding path program 1 times [2024-11-13 15:11:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:09,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970512534] [2024-11-13 15:11:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 15:11:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:11:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:11:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:11:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:11:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:11:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:11:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:11:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:11:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970512534] [2024-11-13 15:11:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970512534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:11:11,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:11:11,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:11:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9740207] [2024-11-13 15:11:11,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:11:11,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:11:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:11:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:11:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:11:11,078 INFO L87 Difference]: Start difference. First operand has 211 states, 164 states have (on average 1.524390243902439) internal successors, (250), 171 states have internal predecessors, (250), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) 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-11-13 15:11:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:13,442 INFO L93 Difference]: Finished difference Result 541 states and 802 transitions. [2024-11-13 15:11:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:11:13,447 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-11-13 15:11:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:13,475 INFO L225 Difference]: With dead ends: 541 [2024-11-13 15:11:13,476 INFO L226 Difference]: Without dead ends: 337 [2024-11-13 15:11:13,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:11:13,494 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 544 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:13,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 721 Invalid, 766 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [148 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:11:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-13 15:11:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 297. [2024-11-13 15:11:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.4094827586206897) internal successors, (327), 239 states have internal predecessors, (327), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-11-13 15:11:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 411 transitions. [2024-11-13 15:11:13,664 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 411 transitions. Word has length 59 [2024-11-13 15:11:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 411 transitions. [2024-11-13 15:11:13,665 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-11-13 15:11:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 411 transitions. [2024-11-13 15:11:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:13,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:13,672 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-11-13 15:11:13,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:11:13,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:13,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1598576521, now seen corresponding path program 1 times [2024-11-13 15:11:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598026969] [2024-11-13 15:11:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 15:11:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:11:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:11:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:11:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:11:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:11:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:11:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:11:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:11:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598026969] [2024-11-13 15:11:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598026969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:11:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:11:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:11:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108389303] [2024-11-13 15:11:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:11:14,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:11:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:11:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:11:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:11:14,322 INFO L87 Difference]: Start difference. First operand 297 states and 411 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 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-11-13 15:11:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:16,447 INFO L93 Difference]: Finished difference Result 646 states and 890 transitions. [2024-11-13 15:11:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:11:16,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 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-11-13 15:11:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:16,457 INFO L225 Difference]: With dead ends: 646 [2024-11-13 15:11:16,457 INFO L226 Difference]: Without dead ends: 468 [2024-11-13 15:11:16,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:11:16,462 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 694 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:16,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 936 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:11:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-13 15:11:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 393. [2024-11-13 15:11:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 308 states have (on average 1.3993506493506493) internal successors, (431), 317 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2024-11-13 15:11:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 545 transitions. [2024-11-13 15:11:16,634 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 545 transitions. Word has length 59 [2024-11-13 15:11:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:16,637 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 545 transitions. [2024-11-13 15:11:16,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 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-11-13 15:11:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 545 transitions. [2024-11-13 15:11:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:16,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:16,647 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-11-13 15:11:16,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:11:16,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:16,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:16,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1802904437, now seen corresponding path program 1 times [2024-11-13 15:11:16,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:16,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550305106] [2024-11-13 15:11:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 15:11:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:11:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:11:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:11:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:11:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:11:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:11:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:11:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:11:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550305106] [2024-11-13 15:11:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550305106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:11:17,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:11:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:11:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102996017] [2024-11-13 15:11:17,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:11:17,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:11:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:11:17,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:11:17,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:11:17,035 INFO L87 Difference]: Start difference. First operand 393 states and 545 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-11-13 15:11:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:18,419 INFO L93 Difference]: Finished difference Result 693 states and 957 transitions. [2024-11-13 15:11:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:11:18,421 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-11-13 15:11:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:18,430 INFO L225 Difference]: With dead ends: 693 [2024-11-13 15:11:18,430 INFO L226 Difference]: Without dead ends: 425 [2024-11-13 15:11:18,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:11:18,437 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 208 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:18,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1129 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:11:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-13 15:11:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 398. [2024-11-13 15:11:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 312 states have (on average 1.3878205128205128) internal successors, (433), 321 states have internal predecessors, (433), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2024-11-13 15:11:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 548 transitions. [2024-11-13 15:11:18,541 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 548 transitions. Word has length 59 [2024-11-13 15:11:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:18,542 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 548 transitions. [2024-11-13 15:11:18,542 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-11-13 15:11:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 548 transitions. [2024-11-13 15:11:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:18,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:18,548 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-11-13 15:11:18,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:11:18,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1528144823, now seen corresponding path program 1 times [2024-11-13 15:11:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259868376] [2024-11-13 15:11:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 15:11:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:11:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:11:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:11:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:11:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:11:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:11:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:11:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:11:18,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259868376] [2024-11-13 15:11:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259868376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:11:18,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:11:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:11:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043348851] [2024-11-13 15:11:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:11:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:11:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:11:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:11:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:11:18,988 INFO L87 Difference]: Start difference. First operand 398 states and 548 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-11-13 15:11:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:21,863 INFO L93 Difference]: Finished difference Result 2066 states and 2826 transitions. [2024-11-13 15:11:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 15:11:21,864 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-11-13 15:11:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:21,877 INFO L225 Difference]: With dead ends: 2066 [2024-11-13 15:11:21,878 INFO L226 Difference]: Without dead ends: 1793 [2024-11-13 15:11:21,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 15:11:21,882 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1379 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:21,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 1294 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:11:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-11-13 15:11:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1535. [2024-11-13 15:11:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1209 states have (on average 1.3300248138957815) internal successors, (1608), 1238 states have internal predecessors, (1608), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2024-11-13 15:11:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2026 transitions. [2024-11-13 15:11:22,164 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2026 transitions. Word has length 59 [2024-11-13 15:11:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:22,169 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2026 transitions. [2024-11-13 15:11:22,169 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-11-13 15:11:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2026 transitions. [2024-11-13 15:11:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:22,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:22,174 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-11-13 15:11:22,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:11:22,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:22,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1795147786, now seen corresponding path program 1 times [2024-11-13 15:11:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036007374] [2024-11-13 15:11:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 15:11:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:11:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:11:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:11:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:11:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:11:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:11:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:11:22,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:11:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036007374] [2024-11-13 15:11:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036007374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:11:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:11:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:11:22,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708197699] [2024-11-13 15:11:22,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:11:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:11:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:11:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:11:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:11:22,452 INFO L87 Difference]: Start difference. First operand 1535 states and 2026 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-11-13 15:11:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:23,758 INFO L93 Difference]: Finished difference Result 3130 states and 4140 transitions. [2024-11-13 15:11:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:11:23,759 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-11-13 15:11:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:23,777 INFO L225 Difference]: With dead ends: 3130 [2024-11-13 15:11:23,777 INFO L226 Difference]: Without dead ends: 1720 [2024-11-13 15:11:23,784 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-11-13 15:11:23,785 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 308 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:23,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1009 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:11:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-11-13 15:11:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1580. [2024-11-13 15:11:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1245 states have (on average 1.3132530120481927) internal successors, (1635), 1274 states have internal predecessors, (1635), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2024-11-13 15:11:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2065 transitions. [2024-11-13 15:11:24,028 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2065 transitions. Word has length 59 [2024-11-13 15:11:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2065 transitions. [2024-11-13 15:11:24,029 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-11-13 15:11:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2065 transitions. [2024-11-13 15:11:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:24,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:24,032 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-11-13 15:11:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:11:24,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -10290548, now seen corresponding path program 1 times [2024-11-13 15:11:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366058027] [2024-11-13 15:11:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 15:11:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:11:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:11:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:11:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:11:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 15:11:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:11:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:11:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:11:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366058027] [2024-11-13 15:11:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366058027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:11:24,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:11:24,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:11:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699688828] [2024-11-13 15:11:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:11:24,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:11:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:11:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:11:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:11:24,434 INFO L87 Difference]: Start difference. First operand 1580 states and 2065 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 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-11-13 15:11:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:26,221 INFO L93 Difference]: Finished difference Result 3015 states and 3902 transitions. [2024-11-13 15:11:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:11:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 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-11-13 15:11:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:26,238 INFO L225 Difference]: With dead ends: 3015 [2024-11-13 15:11:26,238 INFO L226 Difference]: Without dead ends: 1779 [2024-11-13 15:11:26,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:11:26,245 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 692 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:26,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 702 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:11:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2024-11-13 15:11:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1558. [2024-11-13 15:11:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1231 states have (on average 1.3086921202274573) internal successors, (1611), 1254 states have internal predecessors, (1611), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2024-11-13 15:11:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2025 transitions. [2024-11-13 15:11:26,467 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2025 transitions. Word has length 59 [2024-11-13 15:11:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:26,470 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2025 transitions. [2024-11-13 15:11:26,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 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-11-13 15:11:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2025 transitions. [2024-11-13 15:11:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:11:26,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:26,473 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-11-13 15:11:26,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:11:26,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2004435254, now seen corresponding path program 1 times [2024-11-13 15:11:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:11:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724775944] [2024-11-13 15:11:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:11:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:11:26,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:11:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:11:26,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:11:26,593 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:11:26,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-13 15:11:26,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 15:11:26,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:11:26,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:11:26,818 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:11:26,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:11:26 BoogieIcfgContainer [2024-11-13 15:11:26,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:11:26,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:11:26,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:11:26,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:11:26,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:11:09" (3/4) ... [2024-11-13 15:11:26,833 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 15:11:27,014 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:11:27,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:11:27,016 INFO L158 Benchmark]: Toolchain (without parser) took 19920.79ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 91.9MB in the beginning and 178.7MB in the end (delta: -86.8MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-13 15:11:27,018 INFO L158 Benchmark]: CDTParser took 1.59ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:11:27,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 846.00ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 75.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:11:27,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.27ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:11:27,020 INFO L158 Benchmark]: Boogie Preprocessor took 104.34ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:11:27,021 INFO L158 Benchmark]: RCFGBuilder took 1485.84ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 42.3MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:11:27,023 INFO L158 Benchmark]: TraceAbstraction took 17165.56ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 41.8MB in the beginning and 187.1MB in the end (delta: -145.3MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-11-13 15:11:27,024 INFO L158 Benchmark]: Witness Printer took 184.17ms. Allocated memory is still 226.5MB. Free memory was 187.1MB in the beginning and 178.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:11:27,026 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 846.00ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 75.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.27ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 104.34ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1485.84ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 42.3MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17165.56ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 41.8MB in the beginning and 187.1MB in the end (delta: -145.3MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 184.17ms. Allocated memory is still 226.5MB. Free memory was 187.1MB in the beginning and 178.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L962] COND TRUE __VERIFIER_nondet_int() [L963] 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_M=2, M_E=2, T1_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, 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_M=2, M_E=2, T1_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, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L420] RET update_channels1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L70] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L85] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L89] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L104] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, 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_M=2, M_E=2, T1_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, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L260] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L276] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_M=2, M_E=2, T1_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, 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_M=2, M_E=2, T1_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, token=0] [L367] CALL error1() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L28] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_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, 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, 211 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3884 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3825 mSDsluCounter, 5791 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4565 mSDsCounter, 1003 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5054 IncrementalHoareTripleChecker+Invalid, 6057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1003 mSolverCounterUnsat, 1226 mSDtfsCounter, 5054 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1580occurred in iteration=5, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 761 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-11-13 15:11:27,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb67fef-2cae-4397-b31f-6648166deb6b/bin/uautomizer-verify-qhAvR1uOyd/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