./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1 --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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:25:11,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:25:11,898 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:25:11,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:25:11,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:25:11,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:25:11,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:25:11,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:25:11,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:25:11,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:25:11,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:25:11,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:25:11,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:25:11,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:25:11,929 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:25:11,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:25:11,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:25:11,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:25:11,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:25:11,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:25:11,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:25:11,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:25:11,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:25:11,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:25:11,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:25:11,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:25:11,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:25:11,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:25:11,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:25:11,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:25:11,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:25:11,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:25:11,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:25:11,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-12-02 14:25:12,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:25:12,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:25:12,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:25:12,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:25:12,196 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:25:12,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-12-02 14:25:15,211 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/data/945ff8e56/0f528d941f8948a984d1fc2ccde1025a/FLAG18fa3c054 [2024-12-02 14:25:15,527 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:25:15,528 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-12-02 14:25:15,552 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/data/945ff8e56/0f528d941f8948a984d1fc2ccde1025a/FLAG18fa3c054 [2024-12-02 14:25:15,567 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/data/945ff8e56/0f528d941f8948a984d1fc2ccde1025a [2024-12-02 14:25:15,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:25:15,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:25:15,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:25:15,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:25:15,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:25:15,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:25:15" (1/1) ... [2024-12-02 14:25:15,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56db74b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:15, skipping insertion in model container [2024-12-02 14:25:15,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:25:15" (1/1) ... [2024-12-02 14:25:15,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:25:15,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-12-02 14:25:15,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:25:16,002 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:25:16,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-12-02 14:25:16,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:25:16,111 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:25:16,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16 WrapperNode [2024-12-02 14:25:16,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:25:16,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:25:16,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:25:16,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:25:16,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,157 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-12-02 14:25:16,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:25:16,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:25:16,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:25:16,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:25:16,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,183 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-12-02 14:25:16,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:25:16,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:25:16,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:25:16,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:25:16,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (1/1) ... [2024-12-02 14:25:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:25:16,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:25:16,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:25:16,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:25:16,267 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-12-02 14:25:16,267 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-12-02 14:25:16,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 14:25:16,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:25:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 14:25:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 14:25:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:25:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:25:16,270 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 14:25:16,520 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:25:16,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:25:16,778 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 14:25:16,778 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:25:16,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:25:16,930 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:25:16,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:25:16 BoogieIcfgContainer [2024-12-02 14:25:16,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:25:16,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:25:16,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:25:16,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:25:16,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:25:15" (1/3) ... [2024-12-02 14:25:16,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fada3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:25:16, skipping insertion in model container [2024-12-02 14:25:16,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:25:16" (2/3) ... [2024-12-02 14:25:16,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fada3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:25:16, skipping insertion in model container [2024-12-02 14:25:16,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:25:16" (3/3) ... [2024-12-02 14:25:16,942 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-12-02 14:25:16,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:25:16,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2024-12-02 14:25:16,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 14:25:17,019 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-02 14:25:17,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-12-02 14:25:17,100 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-12-02 14:25:17,102 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-12-02 14:25:17,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 148 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2024-12-02 14:25:17,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-12-02 14:25:17,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-12-02 14:25:17,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:25:17,132 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;@3315bdbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:25:17,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-12-02 14:25:17,137 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 14:25:17,137 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-12-02 14:25:17,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:25:17,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:17,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 14:25:17,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash 12997494, now seen corresponding path program 1 times [2024-12-02 14:25:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:17,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728360149] [2024-12-02 14:25:17,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:25:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:25:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728360149] [2024-12-02 14:25:17,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728360149] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:17,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:17,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:25:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864723708] [2024-12-02 14:25:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:25:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:17,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:25:17,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:25:17,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:17,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:17,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:17,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:17,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:18,013 INFO L124 PetriNetUnfolderBase]: 466/824 cut-off events. [2024-12-02 14:25:18,013 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-12-02 14:25:18,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 824 events. 466/824 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3433 event pairs, 345 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 1539. Up to 602 conditions per place. [2024-12-02 14:25:18,021 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-12-02 14:25:18,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2024-12-02 14:25:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:25:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:25:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-12-02 14:25:18,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-12-02 14:25:18,037 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2024-12-02 14:25:18,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2024-12-02 14:25:18,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 14:25:18,047 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2024-12-02 14:25:18,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-12-02 14:25:18,053 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-12-02 14:25:18,053 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2024-12-02 14:25:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:18,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:18,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 14:25:18,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:25:18,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash -394243086, now seen corresponding path program 1 times [2024-12-02 14:25:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961302479] [2024-12-02 14:25:18,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:25:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:25:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:18,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961302479] [2024-12-02 14:25:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961302479] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:25:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628131700] [2024-12-02 14:25:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:18,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:25:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:18,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:25:18,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:25:18,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:18,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:18,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:18,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:18,598 INFO L124 PetriNetUnfolderBase]: 466/811 cut-off events. [2024-12-02 14:25:18,599 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-12-02 14:25:18,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 811 events. 466/811 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3345 event pairs, 199 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 813. Up to 578 conditions per place. [2024-12-02 14:25:18,605 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2024-12-02 14:25:18,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 257 flow [2024-12-02 14:25:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:25:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 14:25:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-12-02 14:25:18,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2024-12-02 14:25:18,608 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 107 transitions. [2024-12-02 14:25:18,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 257 flow [2024-12-02 14:25:18,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:25:18,611 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2024-12-02 14:25:18,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-12-02 14:25:18,612 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-12-02 14:25:18,613 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2024-12-02 14:25:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:18,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:18,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:25:18,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:25:18,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:18,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash 959577463, now seen corresponding path program 1 times [2024-12-02 14:25:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:18,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049276498] [2024-12-02 14:25:18,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:25:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:25:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049276498] [2024-12-02 14:25:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049276498] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:18,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:25:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880821127] [2024-12-02 14:25:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:25:18,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:18,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:25:18,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:25:18,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:18,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:18,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:18,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:18,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:19,310 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-12-02 14:25:19,310 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-12-02 14:25:19,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1095 events. 602/1095 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5228 event pairs, 251 based on Foata normal form. 69/1163 useless extension candidates. Maximal degree in co-relation 332. Up to 575 conditions per place. [2024-12-02 14:25:19,316 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 47 selfloop transitions, 12 changer transitions 4/67 dead transitions. [2024-12-02 14:25:19,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2024-12-02 14:25:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:25:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:25:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-12-02 14:25:19,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-12-02 14:25:19,318 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2024-12-02 14:25:19,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2024-12-02 14:25:19,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:25:19,321 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 166 flow [2024-12-02 14:25:19,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-12-02 14:25:19,323 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-12-02 14:25:19,323 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 166 flow [2024-12-02 14:25:19,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:19,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:19,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:25:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:25:19,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1835591283, now seen corresponding path program 1 times [2024-12-02 14:25:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386957184] [2024-12-02 14:25:19,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:25:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:25:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:19,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386957184] [2024-12-02 14:25:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386957184] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:19,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:19,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:25:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991787229] [2024-12-02 14:25:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:19,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:25:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:19,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:25:19,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:25:19,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-12-02 14:25:19,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:19,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:19,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-12-02 14:25:19,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:19,661 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2024-12-02 14:25:19,661 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-12-02 14:25:19,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 408 events. 225/408 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1458 event pairs, 39 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 983. Up to 217 conditions per place. [2024-12-02 14:25:19,665 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-12-02 14:25:19,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 290 flow [2024-12-02 14:25:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:25:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:25:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-12-02 14:25:19,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2024-12-02 14:25:19,667 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 166 flow. Second operand 4 states and 131 transitions. [2024-12-02 14:25:19,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 290 flow [2024-12-02 14:25:19,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:25:19,670 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 104 flow [2024-12-02 14:25:19,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-12-02 14:25:19,671 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2024-12-02 14:25:19,671 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 104 flow [2024-12-02 14:25:19,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:19,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:19,672 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:19,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:25:19,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -640282583, now seen corresponding path program 1 times [2024-12-02 14:25:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446886159] [2024-12-02 14:25:19,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:25:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:25:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:20,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446886159] [2024-12-02 14:25:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446886159] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 14:25:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936869575] [2024-12-02 14:25:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:20,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 14:25:20,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:20,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 14:25:20,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:25:20,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:20,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:20,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:20,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:21,149 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2024-12-02 14:25:21,150 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-12-02 14:25:21,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 492 events. 263/492 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1813 event pairs, 19 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 280. Up to 147 conditions per place. [2024-12-02 14:25:21,153 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2024-12-02 14:25:21,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 429 flow [2024-12-02 14:25:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:25:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-12-02 14:25:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-12-02 14:25:21,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28194444444444444 [2024-12-02 14:25:21,156 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 104 flow. Second operand 12 states and 203 transitions. [2024-12-02 14:25:21,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 429 flow [2024-12-02 14:25:21,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:25:21,159 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 207 flow [2024-12-02 14:25:21,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=207, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-12-02 14:25:21,160 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-12-02 14:25:21,160 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 207 flow [2024-12-02 14:25:21,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:21,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:21,160 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:25:21,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:21,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1263566219, now seen corresponding path program 2 times [2024-12-02 14:25:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65110850] [2024-12-02 14:25:21,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:25:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:21,222 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:25:21,222 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:25:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65110850] [2024-12-02 14:25:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65110850] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:22,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:22,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 14:25:22,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617226069] [2024-12-02 14:25:22,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:22,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:25:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:22,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:25:22,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:25:22,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:22,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 207 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:22,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:22,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:22,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:23,078 INFO L124 PetriNetUnfolderBase]: 447/860 cut-off events. [2024-12-02 14:25:23,078 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2024-12-02 14:25:23,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 860 events. 447/860 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4103 event pairs, 33 based on Foata normal form. 2/862 useless extension candidates. Maximal degree in co-relation 2452. Up to 186 conditions per place. [2024-12-02 14:25:23,084 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 91 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2024-12-02 14:25:23,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 807 flow [2024-12-02 14:25:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 14:25:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-12-02 14:25:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2024-12-02 14:25:23,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2024-12-02 14:25:23,087 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 207 flow. Second operand 15 states and 260 transitions. [2024-12-02 14:25:23,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 807 flow [2024-12-02 14:25:23,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:25:23,097 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 451 flow [2024-12-02 14:25:23,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=451, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-12-02 14:25:23,098 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-12-02 14:25:23,098 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 451 flow [2024-12-02 14:25:23,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:23,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:23,099 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:25:23,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash 916898611, now seen corresponding path program 3 times [2024-12-02 14:25:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043971910] [2024-12-02 14:25:23,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:25:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:23,145 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:25:23,145 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:25:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043971910] [2024-12-02 14:25:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043971910] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:23,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:23,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 14:25:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402404259] [2024-12-02 14:25:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:25:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:23,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:25:23,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:25:24,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:24,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:24,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:24,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:24,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:24,937 INFO L124 PetriNetUnfolderBase]: 662/1279 cut-off events. [2024-12-02 14:25:24,937 INFO L125 PetriNetUnfolderBase]: For 2981/2981 co-relation queries the response was YES. [2024-12-02 14:25:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1279 events. 662/1279 cut-off events. For 2981/2981 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6752 event pairs, 61 based on Foata normal form. 1/1280 useless extension candidates. Maximal degree in co-relation 4209. Up to 277 conditions per place. [2024-12-02 14:25:24,944 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 104 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-12-02 14:25:24,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1242 flow [2024-12-02 14:25:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 14:25:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-12-02 14:25:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2024-12-02 14:25:24,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28627450980392155 [2024-12-02 14:25:24,946 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 451 flow. Second operand 17 states and 292 transitions. [2024-12-02 14:25:24,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1242 flow [2024-12-02 14:25:24,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1233 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:25:24,959 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 813 flow [2024-12-02 14:25:24,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=813, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-12-02 14:25:24,960 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-12-02 14:25:24,960 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 813 flow [2024-12-02 14:25:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:24,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:24,960 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:24,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:25:24,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:24,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 259965645, now seen corresponding path program 4 times [2024-12-02 14:25:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788065523] [2024-12-02 14:25:24,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 14:25:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:25,003 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 14:25:25,003 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:25:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788065523] [2024-12-02 14:25:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788065523] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 14:25:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844124210] [2024-12-02 14:25:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:25,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:25:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:25:25,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:25:25,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:25,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 813 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:25,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:25,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:25,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:26,255 INFO L124 PetriNetUnfolderBase]: 662/1277 cut-off events. [2024-12-02 14:25:26,256 INFO L125 PetriNetUnfolderBase]: For 5019/5019 co-relation queries the response was YES. [2024-12-02 14:25:26,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 1277 events. 662/1277 cut-off events. For 5019/5019 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6773 event pairs, 71 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 4663. Up to 417 conditions per place. [2024-12-02 14:25:26,262 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 102 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2024-12-02 14:25:26,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 1455 flow [2024-12-02 14:25:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 14:25:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-12-02 14:25:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 291 transitions. [2024-12-02 14:25:26,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2852941176470588 [2024-12-02 14:25:26,265 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 813 flow. Second operand 17 states and 291 transitions. [2024-12-02 14:25:26,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 1455 flow [2024-12-02 14:25:26,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 161 transitions, 1411 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-12-02 14:25:26,289 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 1007 flow [2024-12-02 14:25:26,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1007, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2024-12-02 14:25:26,290 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-12-02 14:25:26,290 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 1007 flow [2024-12-02 14:25:26,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:26,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:26,291 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:26,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:25:26,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:26,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1799234892, now seen corresponding path program 1 times [2024-12-02 14:25:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029861138] [2024-12-02 14:25:26,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:25:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:25:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029861138] [2024-12-02 14:25:27,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029861138] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:27,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:27,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 14:25:27,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217656886] [2024-12-02 14:25:27,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:27,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:25:27,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:27,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:25:27,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:25:27,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:27,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 1007 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:27,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:27,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:27,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:28,658 INFO L124 PetriNetUnfolderBase]: 826/1579 cut-off events. [2024-12-02 14:25:28,659 INFO L125 PetriNetUnfolderBase]: For 8484/8484 co-relation queries the response was YES. [2024-12-02 14:25:28,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1579 events. 826/1579 cut-off events. For 8484/8484 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8790 event pairs, 261 based on Foata normal form. 1/1580 useless extension candidates. Maximal degree in co-relation 5535. Up to 966 conditions per place. [2024-12-02 14:25:28,670 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 97 selfloop transitions, 71 changer transitions 33/202 dead transitions. [2024-12-02 14:25:28,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2318 flow [2024-12-02 14:25:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 14:25:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-12-02 14:25:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 305 transitions. [2024-12-02 14:25:28,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2675438596491228 [2024-12-02 14:25:28,672 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 1007 flow. Second operand 19 states and 305 transitions. [2024-12-02 14:25:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2318 flow [2024-12-02 14:25:28,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2254 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-12-02 14:25:28,714 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1639 flow [2024-12-02 14:25:28,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1639, PETRI_PLACES=117, PETRI_TRANSITIONS=135} [2024-12-02 14:25:28,714 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-12-02 14:25:28,714 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1639 flow [2024-12-02 14:25:28,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:28,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:28,715 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:28,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:25:28,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 752657800, now seen corresponding path program 2 times [2024-12-02 14:25:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646465774] [2024-12-02 14:25:28,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:25:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:28,752 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:25:28,752 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:25:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:29,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646465774] [2024-12-02 14:25:29,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646465774] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:29,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:29,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 14:25:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345365561] [2024-12-02 14:25:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:29,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:25:29,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:29,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:25:29,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:25:29,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:29,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 135 transitions, 1639 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:29,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:29,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:29,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:30,958 INFO L124 PetriNetUnfolderBase]: 935/1824 cut-off events. [2024-12-02 14:25:30,958 INFO L125 PetriNetUnfolderBase]: For 11899/11899 co-relation queries the response was YES. [2024-12-02 14:25:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1824 events. 935/1824 cut-off events. For 11899/11899 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10811 event pairs, 328 based on Foata normal form. 2/1826 useless extension candidates. Maximal degree in co-relation 8081. Up to 1234 conditions per place. [2024-12-02 14:25:30,969 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 121 selfloop transitions, 88 changer transitions 32/242 dead transitions. [2024-12-02 14:25:30,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 242 transitions, 3006 flow [2024-12-02 14:25:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 14:25:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-12-02 14:25:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 355 transitions. [2024-12-02 14:25:30,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2689393939393939 [2024-12-02 14:25:30,971 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1639 flow. Second operand 22 states and 355 transitions. [2024-12-02 14:25:30,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 242 transitions, 3006 flow [2024-12-02 14:25:31,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 242 transitions, 2758 flow, removed 105 selfloop flow, removed 7 redundant places. [2024-12-02 14:25:31,018 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 2184 flow [2024-12-02 14:25:31,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2184, PETRI_PLACES=137, PETRI_TRANSITIONS=170} [2024-12-02 14:25:31,019 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2024-12-02 14:25:31,019 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 2184 flow [2024-12-02 14:25:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:31,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:31,019 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:31,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:25:31,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash 637342284, now seen corresponding path program 3 times [2024-12-02 14:25:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947941295] [2024-12-02 14:25:31,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:25:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:31,059 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:25:31,060 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:25:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:25:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:25:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947941295] [2024-12-02 14:25:31,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947941295] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:25:31,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:25:31,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 14:25:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003489879] [2024-12-02 14:25:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:25:31,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:25:31,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:25:31,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:25:31,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:25:31,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-12-02 14:25:31,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 170 transitions, 2184 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:31,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:25:31,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-12-02 14:25:31,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:25:32,782 INFO L124 PetriNetUnfolderBase]: 973/1984 cut-off events. [2024-12-02 14:25:32,782 INFO L125 PetriNetUnfolderBase]: For 13732/13732 co-relation queries the response was YES. [2024-12-02 14:25:32,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 1984 events. 973/1984 cut-off events. For 13732/13732 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12351 event pairs, 423 based on Foata normal form. 2/1986 useless extension candidates. Maximal degree in co-relation 8912. Up to 864 conditions per place. [2024-12-02 14:25:32,793 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 165 selfloop transitions, 82 changer transitions 31/279 dead transitions. [2024-12-02 14:25:32,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 279 transitions, 3754 flow [2024-12-02 14:25:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 14:25:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-12-02 14:25:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 357 transitions. [2024-12-02 14:25:32,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27045454545454545 [2024-12-02 14:25:32,796 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 2184 flow. Second operand 22 states and 357 transitions. [2024-12-02 14:25:32,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 279 transitions, 3754 flow [2024-12-02 14:25:32,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 279 transitions, 3512 flow, removed 57 selfloop flow, removed 12 redundant places. [2024-12-02 14:25:32,860 INFO L231 Difference]: Finished difference. Result has 149 places, 183 transitions, 2435 flow [2024-12-02 14:25:32,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2435, PETRI_PLACES=149, PETRI_TRANSITIONS=183} [2024-12-02 14:25:32,861 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 96 predicate places. [2024-12-02 14:25:32,861 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 183 transitions, 2435 flow [2024-12-02 14:25:32,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:25:32,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:25:32,861 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 14:25:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:25:32,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-12-02 14:25:32,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:25:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 716253294, now seen corresponding path program 4 times [2024-12-02 14:25:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:25:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058809141] [2024-12-02 14:25:32,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 14:25:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:25:32,902 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 14:25:32,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 14:25:32,902 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:25:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:25:32,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:25:32,954 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:25:32,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-12-02 14:25:32,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-12-02 14:25:32,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-12-02 14:25:32,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-12-02 14:25:32,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-12-02 14:25:32,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-12-02 14:25:32,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-12-02 14:25:32,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-12-02 14:25:32,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:25:32,959 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1] [2024-12-02 14:25:33,014 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 14:25:33,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:25:33,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:25:33 BasicIcfg [2024-12-02 14:25:33,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:25:33,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:25:33,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:25:33,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:25:33,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:25:16" (3/4) ... [2024-12-02 14:25:33,022 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:25:33,082 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 21. [2024-12-02 14:25:33,138 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:25:33,138 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:25:33,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:25:33,140 INFO L158 Benchmark]: Toolchain (without parser) took 17568.74ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 113.7MB in the beginning and 367.5MB in the end (delta: -253.7MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-12-02 14:25:33,140 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:25:33,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.10ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 83.0MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 14:25:33,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.47ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:25:33,141 INFO L158 Benchmark]: Boogie Preprocessor took 46.69ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 77.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:25:33,141 INFO L158 Benchmark]: RCFGBuilder took 725.56ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 99.2MB in the end (delta: -21.9MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-12-02 14:25:33,141 INFO L158 Benchmark]: TraceAbstraction took 16086.58ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 98.6MB in the beginning and 380.0MB in the end (delta: -281.5MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. [2024-12-02 14:25:33,142 INFO L158 Benchmark]: Witness Printer took 117.88ms. Allocated memory is still 419.4MB. Free memory was 380.0MB in the beginning and 367.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:25:33,144 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.43ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.10ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 83.0MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.47ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.69ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 77.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 725.56ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 99.2MB in the end (delta: -21.9MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16086.58ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 98.6MB in the beginning and 380.0MB in the end (delta: -281.5MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. * Witness Printer took 117.88ms. Allocated memory is still 419.4MB. Free memory was 380.0MB in the beginning and 367.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3901] 0 struct device *my_dev; [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); [L3954] COND TRUE 0 ret==0 [L3955] 0 int probe_ret; [L3956] 0 struct my_data data; [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] EXPR 0 data->shared.a [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); [L3928] COND FALSE 0 !(\read(res)) [L3931] 0 my_dev = &data->dev [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=0] [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=-1] [L3935] 0 return 0; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result=0, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=-1] [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1=-2, t2=-1] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3917] 1 return 0; [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3917] 2 return 0; [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, data={5:0}, expression=1, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3887] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-2, t2=-1] - UnprovableResult [Line: 3887]: 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. - UnprovableResult [Line: 3887]: 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. - UnprovableResult [Line: 3887]: 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. - UnprovableResult [Line: 3887]: 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. - UnprovableResult [Line: 3887]: 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. - UnprovableResult [Line: 3933]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3934]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 60 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1276 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1201 mSDsluCounter, 754 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3727 IncrementalHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 36 mSDtfsCounter, 3727 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2435occurred in iteration=11, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 14:25:33,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a626ed7e-a351-49fa-bf66-47adc29b42a2/bin/uautomizer-verify-84ZbGMXZE1/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