./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:20:37,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:20:37,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:20:37,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:20:37,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:20:37,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:20:37,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:20:37,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:20:37,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:20:37,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:20:37,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:20:37,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:20:37,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:20:37,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:20:37,136 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:20:37,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:20:37,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:20:37,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:20:37,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:20:37,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:20:37,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:20:37,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:20:37,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:20:37,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:20:37,139 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2025-02-08 01:20:37,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:20:37,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:20:37,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:20:37,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:20:37,400 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:20:37,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-02-08 01:20:38,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/179df1677/dd85aac5834e4d879ccef7de6597d435/FLAG1ee6e6d39 [2025-02-08 01:20:38,766 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:20:38,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-02-08 01:20:38,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/179df1677/dd85aac5834e4d879ccef7de6597d435/FLAG1ee6e6d39 [2025-02-08 01:20:39,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/179df1677/dd85aac5834e4d879ccef7de6597d435 [2025-02-08 01:20:39,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:20:39,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:20:39,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:20:39,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:20:39,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:20:39,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51742a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39, skipping insertion in model container [2025-02-08 01:20:39,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:20:39,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2862,2875] [2025-02-08 01:20:39,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:20:39,214 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:20:39,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2862,2875] [2025-02-08 01:20:39,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:20:39,240 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:20:39,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39 WrapperNode [2025-02-08 01:20:39,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:20:39,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:20:39,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:20:39,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:20:39,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,266 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-02-08 01:20:39,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:20:39,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:20:39,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:20:39,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:20:39,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,284 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-08 01:20:39,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:20:39,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:20:39,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:20:39,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:20:39,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (1/1) ... [2025-02-08 01:20:39,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:20:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:39,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:20:39,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:20:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:20:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:20:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:20:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:20:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:20:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:20:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:20:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:20:39,357 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:20:39,424 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:20:39,426 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:20:39,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: ~p~0 := 1 + ~i~1#1; [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc #t~ret8#1; [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-1: havoc #t~mem7#1; [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-2: havoc #t~mem6#1; [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-1: havoc #t~post9#1; [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-3: SUMMARY for call write~int#1(#t~ret8#1, ~C~0.base, ~C~0.offset + 4 * ~i~1#1, 4); srcloc: null [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-2: ~i~1#1 := 1 + #t~post9#1; [2025-02-08 01:20:39,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-4: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 01:20:39,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-3: #t~post9#1 := ~i~1#1; [2025-02-08 01:20:39,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-5: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 01:20:39,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-6: havoc plus_~a#1, plus_~b#1; [2025-02-08 01:20:39,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-7: #t~ret8#1 := plus_#res#1; [2025-02-08 01:20:39,695 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:20:39,695 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:20:39,943 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L133 is not an error location. [2025-02-08 01:20:39,943 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:20:39,943 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:20:39,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:39 BoogieIcfgContainer [2025-02-08 01:20:39,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:20:39,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:20:39,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:20:39,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:20:39,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:20:39" (1/3) ... [2025-02-08 01:20:39,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:20:39, skipping insertion in model container [2025-02-08 01:20:39,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:39" (2/3) ... [2025-02-08 01:20:39,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:20:39, skipping insertion in model container [2025-02-08 01:20:39,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:39" (3/3) ... [2025-02-08 01:20:39,951 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-02-08 01:20:39,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:20:39,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:20:39,964 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:20:40,013 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:20:40,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 97 flow [2025-02-08 01:20:40,070 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-02-08 01:20:40,073 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:20:40,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 01:20:40,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 38 transitions, 97 flow [2025-02-08 01:20:40,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 86 flow [2025-02-08 01:20:40,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:20:40,096 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;@1aeec67c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:20:40,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:20:40,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:20:40,112 INFO L124 PetriNetUnfolderBase]: 6/33 cut-off events. [2025-02-08 01:20:40,112 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:20:40,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:40,112 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] [2025-02-08 01:20:40,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:40,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -911821182, now seen corresponding path program 1 times [2025-02-08 01:20:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226943593] [2025-02-08 01:20:40,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:40,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:20:40,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:20:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226943593] [2025-02-08 01:20:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226943593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:40,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:20:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582196470] [2025-02-08 01:20:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:40,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:20:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:40,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:20:40,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:20:40,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-08 01:20:40,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2025-02-08 01:20:40,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:40,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-08 01:20:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:40,725 INFO L124 PetriNetUnfolderBase]: 389/652 cut-off events. [2025-02-08 01:20:40,725 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 01:20:40,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 652 events. 389/652 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2645 event pairs, 284 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 1065. Up to 548 conditions per place. [2025-02-08 01:20:40,731 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 27 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-02-08 01:20:40,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 146 flow [2025-02-08 01:20:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:20:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:20:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-08 01:20:40,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 01:20:40,740 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 86 flow. Second operand 3 states and 57 transitions. [2025-02-08 01:20:40,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 146 flow [2025-02-08 01:20:40,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:20:40,747 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 86 flow [2025-02-08 01:20:40,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2025-02-08 01:20:40,751 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-02-08 01:20:40,752 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 86 flow [2025-02-08 01:20:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2025-02-08 01:20:40,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:40,752 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] [2025-02-08 01:20:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:20:40,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 490188248, now seen corresponding path program 1 times [2025-02-08 01:20:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031105672] [2025-02-08 01:20:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:40,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:20:40,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:20:40,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:40,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031105672] [2025-02-08 01:20:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031105672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:20:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91154772] [2025-02-08 01:20:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:20:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:20:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:20:40,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-08 01:20:40,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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) [2025-02-08 01:20:40,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:40,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-08 01:20:40,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:40,989 INFO L124 PetriNetUnfolderBase]: 389/654 cut-off events. [2025-02-08 01:20:40,990 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 01:20:40,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 654 events. 389/654 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2650 event pairs, 284 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 1218. Up to 547 conditions per place. [2025-02-08 01:20:40,994 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 25 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2025-02-08 01:20:40,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 152 flow [2025-02-08 01:20:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:20:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:20:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-02-08 01:20:40,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45394736842105265 [2025-02-08 01:20:40,995 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 86 flow. Second operand 4 states and 69 transitions. [2025-02-08 01:20:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 152 flow [2025-02-08 01:20:40,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 148 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:40,996 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 110 flow [2025-02-08 01:20:40,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-02-08 01:20:40,996 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-02-08 01:20:40,996 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 110 flow [2025-02-08 01:20:40,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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) [2025-02-08 01:20:40,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:40,997 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] [2025-02-08 01:20:40,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:20:40,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:40,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1502951519, now seen corresponding path program 1 times [2025-02-08 01:20:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431474546] [2025-02-08 01:20:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:20:41,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:20:41,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:41,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:20:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431474546] [2025-02-08 01:20:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431474546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:41,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:20:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238581497] [2025-02-08 01:20:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:41,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:20:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:41,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:20:41,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:20:41,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-08 01:20:41,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2025-02-08 01:20:41,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:41,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-08 01:20:41,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:41,344 INFO L124 PetriNetUnfolderBase]: 601/1036 cut-off events. [2025-02-08 01:20:41,344 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 01:20:41,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 1036 events. 601/1036 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4529 event pairs, 226 based on Foata normal form. 1/902 useless extension candidates. Maximal degree in co-relation 1872. Up to 425 conditions per place. [2025-02-08 01:20:41,351 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 40 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2025-02-08 01:20:41,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 227 flow [2025-02-08 01:20:41,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:20:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:20:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-08 01:20:41,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2025-02-08 01:20:41,352 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 110 flow. Second operand 3 states and 69 transitions. [2025-02-08 01:20:41,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 227 flow [2025-02-08 01:20:41,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:41,353 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 121 flow [2025-02-08 01:20:41,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-02-08 01:20:41,354 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-02-08 01:20:41,354 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 121 flow [2025-02-08 01:20:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2025-02-08 01:20:41,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:41,354 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] [2025-02-08 01:20:41,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:20:41,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 316624642, now seen corresponding path program 1 times [2025-02-08 01:20:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280965956] [2025-02-08 01:20:41,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:41,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:20:41,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:41,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:20:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280965956] [2025-02-08 01:20:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280965956] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692320738] [2025-02-08 01:20:41,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:41,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:41,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:20:41,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:20:41,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:20:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:41,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:20:41,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:20:41,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:20:41,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692320738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:41,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:41,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 01:20:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194998766] [2025-02-08 01:20:41,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:41,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:20:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:41,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:20:41,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:20:41,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 01:20:41,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 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) [2025-02-08 01:20:41,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:41,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 01:20:41,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:42,112 INFO L124 PetriNetUnfolderBase]: 936/1505 cut-off events. [2025-02-08 01:20:42,112 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-02-08 01:20:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 1505 events. 936/1505 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6332 event pairs, 506 based on Foata normal form. 0/1260 useless extension candidates. Maximal degree in co-relation 2280. Up to 815 conditions per place. [2025-02-08 01:20:42,117 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 34 selfloop transitions, 10 changer transitions 40/89 dead transitions. [2025-02-08 01:20:42,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 89 transitions, 441 flow [2025-02-08 01:20:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:20:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:20:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2025-02-08 01:20:42,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43157894736842106 [2025-02-08 01:20:42,118 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 121 flow. Second operand 10 states and 164 transitions. [2025-02-08 01:20:42,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 89 transitions, 441 flow [2025-02-08 01:20:42,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:42,120 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 177 flow [2025-02-08 01:20:42,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-02-08 01:20:42,120 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-02-08 01:20:42,120 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 177 flow [2025-02-08 01:20:42,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 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) [2025-02-08 01:20:42,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:42,121 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:42,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:20:42,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:42,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:42,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1459580617, now seen corresponding path program 2 times [2025-02-08 01:20:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:42,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939582214] [2025-02-08 01:20:42,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:42,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:42,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 33 statements. [2025-02-08 01:20:42,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:20:42,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:20:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939582214] [2025-02-08 01:20:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939582214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:42,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:42,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:20:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218536958] [2025-02-08 01:20:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:42,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:42,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:42,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 01:20:42,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-02-08 01:20:42,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:42,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 01:20:42,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:42,625 INFO L124 PetriNetUnfolderBase]: 1219/1920 cut-off events. [2025-02-08 01:20:42,625 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2025-02-08 01:20:42,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 1920 events. 1219/1920 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9402 event pairs, 550 based on Foata normal form. 13/1698 useless extension candidates. Maximal degree in co-relation 4085. Up to 1006 conditions per place. [2025-02-08 01:20:42,631 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 64 selfloop transitions, 3 changer transitions 13/85 dead transitions. [2025-02-08 01:20:42,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 459 flow [2025-02-08 01:20:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:20:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:20:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-02-08 01:20:42,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2025-02-08 01:20:42,632 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 177 flow. Second operand 5 states and 112 transitions. [2025-02-08 01:20:42,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 459 flow [2025-02-08 01:20:42,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 427 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-02-08 01:20:42,636 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 175 flow [2025-02-08 01:20:42,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-02-08 01:20:42,636 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2025-02-08 01:20:42,636 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 175 flow [2025-02-08 01:20:42,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-02-08 01:20:42,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:42,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:42,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:20:42,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:42,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash -148142437, now seen corresponding path program 3 times [2025-02-08 01:20:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544451865] [2025-02-08 01:20:42,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:20:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:42,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:42,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:42,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:20:42,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:20:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544451865] [2025-02-08 01:20:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544451865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:42,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:20:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298033715] [2025-02-08 01:20:42,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:42,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:42,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:42,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:42,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 01:20:42,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-02-08 01:20:42,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:42,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 01:20:42,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:42,993 INFO L124 PetriNetUnfolderBase]: 1177/1949 cut-off events. [2025-02-08 01:20:42,994 INFO L125 PetriNetUnfolderBase]: For 1141/1141 co-relation queries the response was YES. [2025-02-08 01:20:42,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 1949 events. 1177/1949 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10108 event pairs, 156 based on Foata normal form. 14/1844 useless extension candidates. Maximal degree in co-relation 4744. Up to 874 conditions per place. [2025-02-08 01:20:43,002 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 65 selfloop transitions, 2 changer transitions 13/85 dead transitions. [2025-02-08 01:20:43,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 490 flow [2025-02-08 01:20:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:20:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:20:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-02-08 01:20:43,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2025-02-08 01:20:43,005 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 175 flow. Second operand 5 states and 104 transitions. [2025-02-08 01:20:43,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 490 flow [2025-02-08 01:20:43,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 468 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 01:20:43,011 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 178 flow [2025-02-08 01:20:43,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-02-08 01:20:43,013 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-02-08 01:20:43,013 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 178 flow [2025-02-08 01:20:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-02-08 01:20:43,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:43,013 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:43,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:20:43,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:43,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash -940982099, now seen corresponding path program 4 times [2025-02-08 01:20:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:43,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182623780] [2025-02-08 01:20:43,014 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:20:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:43,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:43,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 33 statements. [2025-02-08 01:20:43,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:20:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:20:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182623780] [2025-02-08 01:20:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182623780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:43,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:43,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:20:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932215289] [2025-02-08 01:20:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:43,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:43,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:43,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 01:20:43,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-02-08 01:20:43,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:43,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 01:20:43,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:43,387 INFO L124 PetriNetUnfolderBase]: 1605/2539 cut-off events. [2025-02-08 01:20:43,388 INFO L125 PetriNetUnfolderBase]: For 1690/1690 co-relation queries the response was YES. [2025-02-08 01:20:43,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 2539 events. 1605/2539 cut-off events. For 1690/1690 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12927 event pairs, 496 based on Foata normal form. 26/2358 useless extension candidates. Maximal degree in co-relation 6262. Up to 1194 conditions per place. [2025-02-08 01:20:43,398 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 78 selfloop transitions, 16 changer transitions 3/102 dead transitions. [2025-02-08 01:20:43,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 572 flow [2025-02-08 01:20:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:20:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:20:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-02-08 01:20:43,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 01:20:43,399 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 178 flow. Second operand 8 states and 152 transitions. [2025-02-08 01:20:43,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 572 flow [2025-02-08 01:20:43,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 545 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 01:20:43,403 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 285 flow [2025-02-08 01:20:43,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-02-08 01:20:43,404 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2025-02-08 01:20:43,404 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 285 flow [2025-02-08 01:20:43,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-02-08 01:20:43,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:43,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:43,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:20:43,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:43,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1628601633, now seen corresponding path program 5 times [2025-02-08 01:20:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:43,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003153261] [2025-02-08 01:20:43,405 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:20:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:43,423 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:43,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:43,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:43,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:20:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003153261] [2025-02-08 01:20:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003153261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141983753] [2025-02-08 01:20:43,511 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:20:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:43,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:20:43,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:20:43,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:43,602 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:43,602 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:43,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:43,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:20:43,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:20:43,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:20:43,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141983753] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:43,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:20:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-02-08 01:20:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427297748] [2025-02-08 01:20:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:43,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:20:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:43,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:20:43,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:20:43,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 01:20:43,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2025-02-08 01:20:43,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:43,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 01:20:43,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:43,902 INFO L124 PetriNetUnfolderBase]: 1432/2368 cut-off events. [2025-02-08 01:20:43,903 INFO L125 PetriNetUnfolderBase]: For 3465/3499 co-relation queries the response was YES. [2025-02-08 01:20:43,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6256 conditions, 2368 events. 1432/2368 cut-off events. For 3465/3499 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12205 event pairs, 282 based on Foata normal form. 154/2378 useless extension candidates. Maximal degree in co-relation 6220. Up to 1534 conditions per place. [2025-02-08 01:20:43,908 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 0 selfloop transitions, 0 changer transitions 79/79 dead transitions. [2025-02-08 01:20:43,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 581 flow [2025-02-08 01:20:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:20:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:20:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-02-08 01:20:43,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2025-02-08 01:20:43,909 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 285 flow. Second operand 6 states and 88 transitions. [2025-02-08 01:20:43,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 581 flow [2025-02-08 01:20:43,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 549 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-08 01:20:43,914 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-02-08 01:20:43,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-02-08 01:20:43,914 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-02-08 01:20:43,914 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-02-08 01:20:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2025-02-08 01:20:43,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-08 01:20:43,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-08 01:20:43,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 01:20:43,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 01:20:43,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:20:44,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:44,122 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-02-08 01:20:44,124 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:20:44,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:20:44,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:20:44 BasicIcfg [2025-02-08 01:20:44,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:20:44,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:20:44,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:20:44,128 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:20:44,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:39" (3/4) ... [2025-02-08 01:20:44,130 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:20:44,132 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 01:20:44,132 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 01:20:44,132 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 01:20:44,136 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 157 nodes and edges [2025-02-08 01:20:44,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2025-02-08 01:20:44,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 01:20:44,137 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 01:20:44,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:20:44,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:20:44,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:20:44,200 INFO L158 Benchmark]: Toolchain (without parser) took 5126.72ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 134.9MB in the beginning and 92.5MB in the end (delta: 42.4MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2025-02-08 01:20:44,200 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:20:44,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.34ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 121.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:20:44,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.65ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:20:44,201 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 117.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:20:44,201 INFO L158 Benchmark]: IcfgBuilder took 641.04ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 127.9MB in the end (delta: -10.0MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2025-02-08 01:20:44,201 INFO L158 Benchmark]: TraceAbstraction took 4182.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 127.9MB in the beginning and 100.5MB in the end (delta: 27.4MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2025-02-08 01:20:44,201 INFO L158 Benchmark]: Witness Printer took 71.52ms. Allocated memory is still 243.3MB. Free memory was 100.5MB in the beginning and 92.5MB in the end (delta: 8.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:20:44,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.34ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 121.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.65ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 117.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 641.04ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 127.9MB in the end (delta: -10.0MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4182.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 127.9MB in the beginning and 100.5MB in the end (delta: 27.4MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * Witness Printer took 71.52ms. Allocated memory is still 243.3MB. Free memory was 100.5MB in the beginning and 92.5MB in the end (delta: 8.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 114]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 52 locations, 4 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: 4.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 3 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=7, InterpolantAutomatonStates: 44, 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, 1.1s InterpolantComputationTime, 292 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 791 SizeOfPredicates, 5 NumberOfNonLiveVariables, 579 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 61/68 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:20:44,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE