./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:56:44,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:56:44,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:56:44,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:56:44,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:56:44,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:56:44,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:56:44,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:56:44,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:56:44,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:56:44,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:56:44,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:56:44,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:56:44,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:56:44,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:56:44,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:56:44,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:56:44,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:56:44,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:56:44,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:56:44,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:56:44,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:56:44,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:56:44,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:56:44,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:56:44,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:56:44,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:56:44,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:56:44,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:56:44,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:56:44,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:56:44,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:56:44,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:56:44,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:56:44,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:56:44,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:56:44,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:56:44,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:56:44,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:56:44,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:56:44,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:56:44,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:56:44,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2024-11-16 09:56:44,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:56:44,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:56:44,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:56:44,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:56:44,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:56:44,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-11-16 09:56:45,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:56:46,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:56:46,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-11-16 09:56:46,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573267d6c/e79960e0948d498cba192691c8d81dc7/FLAG862a5d8de [2024-11-16 09:56:46,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573267d6c/e79960e0948d498cba192691c8d81dc7 [2024-11-16 09:56:46,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:56:46,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:56:46,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:56:46,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:56:46,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:56:46,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316153df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46, skipping insertion in model container [2024-11-16 09:56:46,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:56:46,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-11-16 09:56:46,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-11-16 09:56:46,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:56:46,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:56:46,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2024-11-16 09:56:46,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2024-11-16 09:56:46,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:56:46,625 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:56:46,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46 WrapperNode [2024-11-16 09:56:46,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:56:46,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:56:46,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:56:46,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:56:46,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,677 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 401 [2024-11-16 09:56:46,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:56:46,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:56:46,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:56:46,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:56:46,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,709 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-16 09:56:46,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:56:46,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:56:46,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:56:46,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:56:46,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (1/1) ... [2024-11-16 09:56:46,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:56:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:56:46,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:56:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:56:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:56:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-16 09:56:46,806 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-16 09:56:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-16 09:56:46,808 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-16 09:56:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-16 09:56:46,808 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-16 09:56:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-16 09:56:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-16 09:56:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-16 09:56:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-16 09:56:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-16 09:56:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-16 09:56:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-16 09:56:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-16 09:56:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-16 09:56:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-16 09:56:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-16 09:56:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-16 09:56:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-16 09:56:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-16 09:56:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-16 09:56:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-16 09:56:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:56:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-16 09:56:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-16 09:56:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-16 09:56:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-16 09:56:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:56:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:56:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-16 09:56:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-16 09:56:46,926 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:56:46,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:56:47,444 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-16 09:56:47,444 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:56:47,465 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:56:47,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:56:47,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:56:47 BoogieIcfgContainer [2024-11-16 09:56:47,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:56:47,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:56:47,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:56:47,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:56:47,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:56:46" (1/3) ... [2024-11-16 09:56:47,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e16ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:56:47, skipping insertion in model container [2024-11-16 09:56:47,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:56:46" (2/3) ... [2024-11-16 09:56:47,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e16ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:56:47, skipping insertion in model container [2024-11-16 09:56:47,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:56:47" (3/3) ... [2024-11-16 09:56:47,474 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2024-11-16 09:56:47,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:56:47,487 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:56:47,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:56:47,554 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;@1299af2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:56:47,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:56:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 198 states have (on average 1.4343434343434343) internal successors, (284), 205 states have internal predecessors, (284), 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-16 09:56:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:47,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:47,571 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, 1, 1, 1, 1] [2024-11-16 09:56:47,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:47,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1607184327, now seen corresponding path program 1 times [2024-11-16 09:56:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159913067] [2024-11-16 09:56:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:56:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:56:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:56:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:56:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:56:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:56:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:56:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:48,222 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-16 09:56:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:56:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159913067] [2024-11-16 09:56:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159913067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:56:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:56:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:56:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677696468] [2024-11-16 09:56:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:56:48,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:56:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:56:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:56:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:56:48,261 INFO L87 Difference]: Start difference. First operand has 245 states, 198 states have (on average 1.4343434343434343) internal successors, (284), 205 states have internal predecessors, (284), 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 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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-16 09:56:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:56:49,234 INFO L93 Difference]: Finished difference Result 618 states and 879 transitions. [2024-11-16 09:56:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:56:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2024-11-16 09:56:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:56:49,248 INFO L225 Difference]: With dead ends: 618 [2024-11-16 09:56:49,248 INFO L226 Difference]: Without dead ends: 377 [2024-11-16 09:56:49,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:56:49,259 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 700 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:56:49,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 856 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:56:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-16 09:56:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 336. [2024-11-16 09:56:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 271 states have (on average 1.3505535055350553) internal successors, (366), 278 states have internal predecessors, (366), 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-16 09:56:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 450 transitions. [2024-11-16 09:56:49,360 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 450 transitions. Word has length 63 [2024-11-16 09:56:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:56:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 450 transitions. [2024-11-16 09:56:49,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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-16 09:56:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 450 transitions. [2024-11-16 09:56:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:49,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:49,366 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, 1, 1, 1, 1] [2024-11-16 09:56:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:56:49,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1983132092, now seen corresponding path program 1 times [2024-11-16 09:56:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37938700] [2024-11-16 09:56:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:56:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:56:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:56:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:56:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:56:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:56:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:56:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:49,588 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-16 09:56:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:56:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37938700] [2024-11-16 09:56:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37938700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:56:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:56:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:56:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514980656] [2024-11-16 09:56:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:56:49,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:56:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:56:49,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:56:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:56:49,596 INFO L87 Difference]: Start difference. First operand 336 states and 450 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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-16 09:56:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:56:50,532 INFO L93 Difference]: Finished difference Result 726 states and 970 transitions. [2024-11-16 09:56:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:56:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2024-11-16 09:56:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:56:50,540 INFO L225 Difference]: With dead ends: 726 [2024-11-16 09:56:50,541 INFO L226 Difference]: Without dead ends: 521 [2024-11-16 09:56:50,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:56:50,543 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 769 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 09:56:50,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1139 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 09:56:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-16 09:56:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 445. [2024-11-16 09:56:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 360 states have (on average 1.3416666666666666) internal successors, (483), 369 states have internal predecessors, (483), 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-16 09:56:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 597 transitions. [2024-11-16 09:56:50,627 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 597 transitions. Word has length 63 [2024-11-16 09:56:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:56:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 597 transitions. [2024-11-16 09:56:50,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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-16 09:56:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 597 transitions. [2024-11-16 09:56:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:50,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:50,630 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, 1, 1, 1, 1] [2024-11-16 09:56:50,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:56:50,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:50,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1990891451, now seen corresponding path program 1 times [2024-11-16 09:56:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:50,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772002667] [2024-11-16 09:56:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:56:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:56:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:56:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:56:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:56:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:56:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:56:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:50,857 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-16 09:56:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:56:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772002667] [2024-11-16 09:56:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772002667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:56:50,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:56:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:56:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054167932] [2024-11-16 09:56:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:56:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:56:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:56:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:56:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:56:50,864 INFO L87 Difference]: Start difference. First operand 445 states and 597 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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-16 09:56:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:56:51,534 INFO L93 Difference]: Finished difference Result 785 states and 1049 transitions. [2024-11-16 09:56:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:56:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2024-11-16 09:56:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:56:51,538 INFO L225 Difference]: With dead ends: 785 [2024-11-16 09:56:51,541 INFO L226 Difference]: Without dead ends: 477 [2024-11-16 09:56:51,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 09:56:51,544 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 309 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:56:51,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1185 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:56:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-16 09:56:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 450. [2024-11-16 09:56:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 364 states have (on average 1.3324175824175823) internal successors, (485), 373 states have internal predecessors, (485), 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-16 09:56:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 600 transitions. [2024-11-16 09:56:51,588 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 600 transitions. Word has length 63 [2024-11-16 09:56:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:56:51,588 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 600 transitions. [2024-11-16 09:56:51,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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-16 09:56:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2024-11-16 09:56:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:51,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:51,591 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, 1, 1, 1, 1] [2024-11-16 09:56:51,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:56:51,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -40591196, now seen corresponding path program 1 times [2024-11-16 09:56:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496489003] [2024-11-16 09:56:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:56:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:56:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:56:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:56:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:56:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:56:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:56:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:51,724 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-16 09:56:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:56:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496489003] [2024-11-16 09:56:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496489003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:56:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:56:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:56:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098861850] [2024-11-16 09:56:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:56:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:56:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:56:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:56:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:56:51,727 INFO L87 Difference]: Start difference. First operand 450 states and 600 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 09:56:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:56:53,413 INFO L93 Difference]: Finished difference Result 1984 states and 2604 transitions. [2024-11-16 09:56:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 09:56:53,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2024-11-16 09:56:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:56:53,424 INFO L225 Difference]: With dead ends: 1984 [2024-11-16 09:56:53,425 INFO L226 Difference]: Without dead ends: 1653 [2024-11-16 09:56:53,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 09:56:53,430 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1900 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:56:53,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 1678 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 09:56:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-16 09:56:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1484. [2024-11-16 09:56:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1212 states have (on average 1.2846534653465347) internal successors, (1557), 1236 states have internal predecessors, (1557), 140 states have call successors, (140), 111 states have call predecessors, (140), 130 states have return successors, (177), 139 states have call predecessors, (177), 137 states have call successors, (177) [2024-11-16 09:56:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1874 transitions. [2024-11-16 09:56:53,542 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1874 transitions. Word has length 63 [2024-11-16 09:56:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:56:53,543 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1874 transitions. [2024-11-16 09:56:53,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 09:56:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1874 transitions. [2024-11-16 09:56:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:53,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:53,545 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, 1, 1, 1, 1] [2024-11-16 09:56:53,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:56:53,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:53,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1795939559, now seen corresponding path program 1 times [2024-11-16 09:56:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895419697] [2024-11-16 09:56:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:56:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:56:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:56:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:56:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:56:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:56:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:56:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:53,695 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-16 09:56:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:56:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895419697] [2024-11-16 09:56:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895419697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:56:53,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:56:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:56:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139306210] [2024-11-16 09:56:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:56:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:56:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:56:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:56:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:56:53,698 INFO L87 Difference]: Start difference. First operand 1484 states and 1874 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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-16 09:56:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:56:54,412 INFO L93 Difference]: Finished difference Result 2945 states and 3717 transitions. [2024-11-16 09:56:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 09:56:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2024-11-16 09:56:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:56:54,420 INFO L225 Difference]: With dead ends: 2945 [2024-11-16 09:56:54,421 INFO L226 Difference]: Without dead ends: 1586 [2024-11-16 09:56:54,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:56:54,424 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 214 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:56:54,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1326 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 09:56:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-16 09:56:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1514. [2024-11-16 09:56:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1236 states have (on average 1.272653721682848) internal successors, (1573), 1260 states have internal predecessors, (1573), 140 states have call successors, (140), 111 states have call predecessors, (140), 136 states have return successors, (183), 145 states have call predecessors, (183), 137 states have call successors, (183) [2024-11-16 09:56:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1896 transitions. [2024-11-16 09:56:54,557 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1896 transitions. Word has length 63 [2024-11-16 09:56:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:56:54,557 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1896 transitions. [2024-11-16 09:56:54,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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-16 09:56:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1896 transitions. [2024-11-16 09:56:54,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:54,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:54,559 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, 1, 1, 1, 1] [2024-11-16 09:56:54,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:56:54,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:54,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1537413720, now seen corresponding path program 1 times [2024-11-16 09:56:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078136303] [2024-11-16 09:56:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:56:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:56:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:56:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:56:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:56:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:56:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:56:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:56:54,692 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-16 09:56:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:56:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078136303] [2024-11-16 09:56:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078136303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:56:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:56:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:56:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130159781] [2024-11-16 09:56:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:56:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:56:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:56:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:56:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:56:54,695 INFO L87 Difference]: Start difference. First operand 1514 states and 1896 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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-16 09:56:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:56:55,537 INFO L93 Difference]: Finished difference Result 2904 states and 3578 transitions. [2024-11-16 09:56:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:56:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2024-11-16 09:56:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:56:55,546 INFO L225 Difference]: With dead ends: 2904 [2024-11-16 09:56:55,546 INFO L226 Difference]: Without dead ends: 1771 [2024-11-16 09:56:55,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:56:55,551 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 718 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 09:56:55,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 853 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 09:56:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-11-16 09:56:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1448. [2024-11-16 09:56:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1186 states have (on average 1.2681281618887015) internal successors, (1504), 1205 states have internal predecessors, (1504), 134 states have call successors, (134), 106 states have call predecessors, (134), 126 states have return successors, (168), 138 states have call predecessors, (168), 131 states have call successors, (168) [2024-11-16 09:56:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1806 transitions. [2024-11-16 09:56:55,659 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1806 transitions. Word has length 63 [2024-11-16 09:56:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:56:55,661 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 1806 transitions. [2024-11-16 09:56:55,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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-16 09:56:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1806 transitions. [2024-11-16 09:56:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:56:55,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:56:55,664 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, 1, 1, 1, 1] [2024-11-16 09:56:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:56:55,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:56:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:56:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 719497287, now seen corresponding path program 1 times [2024-11-16 09:56:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:56:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118149911] [2024-11-16 09:56:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:56:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:56:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:56:55,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 09:56:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:56:55,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 09:56:55,718 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 09:56:55,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 09:56:55,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 09:56:55,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:56:55,723 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:56:55,811 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 09:56:55,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:56:55 BoogieIcfgContainer [2024-11-16 09:56:55,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 09:56:55,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 09:56:55,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 09:56:55,814 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 09:56:55,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:56:47" (3/4) ... [2024-11-16 09:56:55,815 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 09:56:55,911 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 09:56:55,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 09:56:55,912 INFO L158 Benchmark]: Toolchain (without parser) took 9752.55ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 90.8MB in the beginning and 162.8MB in the end (delta: -72.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,912 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 09:56:55,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.01ms. Allocated memory is still 159.4MB. Free memory was 90.5MB in the beginning and 127.3MB in the end (delta: -36.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.23ms. Allocated memory is still 159.4MB. Free memory was 127.3MB in the beginning and 124.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,913 INFO L158 Benchmark]: Boogie Preprocessor took 46.70ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 122.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,913 INFO L158 Benchmark]: IcfgBuilder took 739.44ms. Allocated memory is still 159.4MB. Free memory was 122.2MB in the beginning and 90.2MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,914 INFO L158 Benchmark]: TraceAbstraction took 8345.97ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 89.6MB in the beginning and 172.2MB in the end (delta: -82.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,914 INFO L158 Benchmark]: Witness Printer took 97.17ms. Allocated memory is still 255.9MB. Free memory was 172.2MB in the beginning and 162.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 09:56:55,915 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.01ms. Allocated memory is still 159.4MB. Free memory was 90.5MB in the beginning and 127.3MB in the end (delta: -36.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.23ms. Allocated memory is still 159.4MB. Free memory was 127.3MB in the beginning and 124.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.70ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 122.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 739.44ms. Allocated memory is still 159.4MB. Free memory was 122.2MB in the beginning and 90.2MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8345.97ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 89.6MB in the beginning and 172.2MB in the end (delta: -82.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 97.17ms. Allocated memory is still 255.9MB. Free memory was 172.2MB in the beginning and 162.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int 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, 245 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4670 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4610 mSDsluCounter, 7037 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5700 mSDsCounter, 1147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5126 IncrementalHoareTripleChecker+Invalid, 6273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1147 mSolverCounterUnsat, 1337 mSDtfsCounter, 5126 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1514occurred 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: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 708 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 744 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-16 09:56:55,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE