./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/parallel-parallel-sum-equiv.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:52:02,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:52:02,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:52:02,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:52:02,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:52:02,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:52:02,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:52:02,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:52:02,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:52:02,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:52:02,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:52:02,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:52:02,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:52:02,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:52:02,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:52:02,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:52:02,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:02,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:02,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:02,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:52:02,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:52:02,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:52:02,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:52:02,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:52:02,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:52:02,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:52:02,147 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 ! overflow) ) 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 -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-01-10 06:52:02,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:52:02,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:52:02,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:52:02,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:52:02,377 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:52:02,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-01-10 06:52:03,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e47f850/936c8c20e867481eb5e4752e88f1ebb6/FLAGfa074789c [2025-01-10 06:52:04,069 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:52:04,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-01-10 06:52:04,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e47f850/936c8c20e867481eb5e4752e88f1ebb6/FLAGfa074789c [2025-01-10 06:52:04,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e47f850/936c8c20e867481eb5e4752e88f1ebb6 [2025-01-10 06:52:04,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:52:04,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:52:04,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:04,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:52:04,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:52:04,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04, skipping insertion in model container [2025-01-10 06:52:04,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:52:04,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:04,275 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:52:04,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:04,316 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:52:04,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04 WrapperNode [2025-01-10 06:52:04,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:04,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:04,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:52:04,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:52:04,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,355 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 299 [2025-01-10 06:52:04,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:04,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:52:04,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:52:04,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:52:04,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,383 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 06:52:04,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:52:04,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:52:04,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:52:04,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:52:04,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (1/1) ... [2025-01-10 06:52:04,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:04,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:04,429 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-01-10 06:52:04,431 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-01-10 06:52:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:52:04,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:52:04,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:52:04,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:52:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 06:52:04,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 06:52:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:52:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:52:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:52:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:52:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:52:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:52:04,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:52:04,448 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:52:04,519 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:52:04,521 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:52:04,943 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:52:04,943 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:52:05,326 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:52:05,327 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 06:52:05,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:05 BoogieIcfgContainer [2025-01-10 06:52:05,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:52:05,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:52:05,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:52:05,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:52:05,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:52:04" (1/3) ... [2025-01-10 06:52:05,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61aef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:05, skipping insertion in model container [2025-01-10 06:52:05,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:04" (2/3) ... [2025-01-10 06:52:05,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61aef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:05, skipping insertion in model container [2025-01-10 06:52:05,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:05" (3/3) ... [2025-01-10 06:52:05,333 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-01-10 06:52:05,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:52:05,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 78 locations, 1 initial locations, 4 loop locations, and 28 error locations. [2025-01-10 06:52:05,345 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:52:05,460 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-01-10 06:52:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 89 transitions, 218 flow [2025-01-10 06:52:05,551 INFO L124 PetriNetUnfolderBase]: 9/82 cut-off events. [2025-01-10 06:52:05,553 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:52:05,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 9/82 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 238 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 77. Up to 3 conditions per place. [2025-01-10 06:52:05,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 89 transitions, 218 flow [2025-01-10 06:52:05,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 80 transitions, 187 flow [2025-01-10 06:52:05,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:52:05,573 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;@7204914e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:52:05,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-01-10 06:52:05,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:52:05,575 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 06:52:05,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:52:05,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:05,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 06:52:05,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:05,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash 33231, now seen corresponding path program 1 times [2025-01-10 06:52:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541847067] [2025-01-10 06:52:05,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:05,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:52:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:52:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:05,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541847067] [2025-01-10 06:52:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541847067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:05,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:05,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:52:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674501047] [2025-01-10 06:52:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:05,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:05,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:05,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-01-10 06:52:05,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-01-10 06:52:05,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:05,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-01-10 06:52:05,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:09,816 INFO L124 PetriNetUnfolderBase]: 38606/51831 cut-off events. [2025-01-10 06:52:09,817 INFO L125 PetriNetUnfolderBase]: For 2048/2048 co-relation queries the response was YES. [2025-01-10 06:52:09,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106322 conditions, 51831 events. 38606/51831 cut-off events. For 2048/2048 co-relation queries the response was YES. Maximal size of possible extension queue 1956. Compared 299779 event pairs, 35504 based on Foata normal form. 1/32779 useless extension candidates. Maximal degree in co-relation 106226. Up to 51795 conditions per place. [2025-01-10 06:52:10,121 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 62 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-01-10 06:52:10,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 293 flow [2025-01-10 06:52:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-01-10 06:52:10,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3882783882783883 [2025-01-10 06:52:10,133 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 187 flow. Second operand 3 states and 106 transitions. [2025-01-10 06:52:10,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 293 flow [2025-01-10 06:52:10,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 276 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:52:10,167 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 152 flow [2025-01-10 06:52:10,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-01-10 06:52:10,171 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -12 predicate places. [2025-01-10 06:52:10,173 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 152 flow [2025-01-10 06:52:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-01-10 06:52:10,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:10,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:52:10,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:52:10,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1031178, now seen corresponding path program 1 times [2025-01-10 06:52:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:10,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723398295] [2025-01-10 06:52:10,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:10,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:10,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:52:10,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:52:10,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:10,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723398295] [2025-01-10 06:52:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723398295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:10,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:10,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:52:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043618772] [2025-01-10 06:52:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:10,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:10,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:10,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:10,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:10,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-01-10 06:52:10,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-01-10 06:52:10,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:10,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-01-10 06:52:10,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:12,718 INFO L124 PetriNetUnfolderBase]: 31282/42029 cut-off events. [2025-01-10 06:52:12,719 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-01-10 06:52:12,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85179 conditions, 42029 events. 31282/42029 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 236710 event pairs, 28582 based on Foata normal form. 0/27750 useless extension candidates. Maximal degree in co-relation 85173. Up to 41993 conditions per place. [2025-01-10 06:52:12,926 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 58 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2025-01-10 06:52:12,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 262 flow [2025-01-10 06:52:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-01-10 06:52:12,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2025-01-10 06:52:12,929 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 152 flow. Second operand 3 states and 96 transitions. [2025-01-10 06:52:12,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 262 flow [2025-01-10 06:52:12,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:12,930 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 145 flow [2025-01-10 06:52:12,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-01-10 06:52:12,932 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -15 predicate places. [2025-01-10 06:52:12,933 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 145 flow [2025-01-10 06:52:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-01-10 06:52:12,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:12,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:52:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:52:12,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 990994470, now seen corresponding path program 1 times [2025-01-10 06:52:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148620224] [2025-01-10 06:52:12,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:12,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:52:12,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:52:12,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:12,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148620224] [2025-01-10 06:52:13,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148620224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:13,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:13,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:13,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754060692] [2025-01-10 06:52:13,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:13,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:13,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:13,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-01-10 06:52:13,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-01-10 06:52:13,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:13,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-01-10 06:52:13,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:15,156 INFO L124 PetriNetUnfolderBase]: 31283/42033 cut-off events. [2025-01-10 06:52:15,157 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-01-10 06:52:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85189 conditions, 42033 events. 31283/42033 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 236686 event pairs, 28582 based on Foata normal form. 1/27778 useless extension candidates. Maximal degree in co-relation 85182. Up to 41997 conditions per place. [2025-01-10 06:52:15,304 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 60 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-01-10 06:52:15,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 279 flow [2025-01-10 06:52:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-10 06:52:15,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3021978021978022 [2025-01-10 06:52:15,308 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 145 flow. Second operand 4 states and 110 transitions. [2025-01-10 06:52:15,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 279 flow [2025-01-10 06:52:15,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:15,310 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 173 flow [2025-01-10 06:52:15,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-01-10 06:52:15,311 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -11 predicate places. [2025-01-10 06:52:15,311 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 173 flow [2025-01-10 06:52:15,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-01-10 06:52:15,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:15,311 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:15,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:52:15,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:15,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash -887944483, now seen corresponding path program 1 times [2025-01-10 06:52:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493419968] [2025-01-10 06:52:15,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:15,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:52:15,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:52:15,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:15,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493419968] [2025-01-10 06:52:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493419968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:15,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343451766] [2025-01-10 06:52:15,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:15,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:15,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:15,445 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-01-10 06:52:15,450 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-01-10 06:52:15,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:52:15,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:52:15,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:15,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:15,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:15,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:15,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343451766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:15,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:52:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038127937] [2025-01-10 06:52:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:15,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:52:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:15,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:52:15,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:52:15,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-01-10 06:52:15,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-01-10 06:52:15,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:15,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-01-10 06:52:15,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:18,050 INFO L124 PetriNetUnfolderBase]: 31283/42032 cut-off events. [2025-01-10 06:52:18,050 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2025-01-10 06:52:18,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85200 conditions, 42032 events. 31283/42032 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 1482. Compared 236728 event pairs, 28582 based on Foata normal form. 1/27778 useless extension candidates. Maximal degree in co-relation 85191. Up to 41992 conditions per place. [2025-01-10 06:52:18,237 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 56 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-01-10 06:52:18,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 295 flow [2025-01-10 06:52:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:52:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:52:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-01-10 06:52:18,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2025-01-10 06:52:18,239 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 173 flow. Second operand 6 states and 130 transitions. [2025-01-10 06:52:18,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 295 flow [2025-01-10 06:52:18,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:18,240 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 180 flow [2025-01-10 06:52:18,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-01-10 06:52:18,241 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2025-01-10 06:52:18,241 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 180 flow [2025-01-10 06:52:18,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-01-10 06:52:18,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:18,242 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:52:18,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:52:18,446 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-01-10 06:52:18,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1756474198, now seen corresponding path program 1 times [2025-01-10 06:52:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:18,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999541706] [2025-01-10 06:52:18,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:18,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:52:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:52:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:18,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999541706] [2025-01-10 06:52:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999541706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963399019] [2025-01-10 06:52:18,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:18,543 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-01-10 06:52:18,545 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-01-10 06:52:18,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:52:18,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:52:18,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:18,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:18,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:18,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:18,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:52:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963399019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:52:18,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:52:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:52:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68360197] [2025-01-10 06:52:18,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:52:18,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:52:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:18,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:52:18,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:52:18,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-01-10 06:52:18,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 180 flow. Second operand has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 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-01-10 06:52:18,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:18,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-01-10 06:52:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:21,316 INFO L124 PetriNetUnfolderBase]: 31286/42044 cut-off events. [2025-01-10 06:52:21,316 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-01-10 06:52:21,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85244 conditions, 42044 events. 31286/42044 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 236626 event pairs, 28582 based on Foata normal form. 3/27790 useless extension candidates. Maximal degree in co-relation 85235. Up to 41999 conditions per place. [2025-01-10 06:52:21,547 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 59 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2025-01-10 06:52:21,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 378 flow [2025-01-10 06:52:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:52:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:52:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2025-01-10 06:52:21,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2032967032967033 [2025-01-10 06:52:21,552 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 180 flow. Second operand 10 states and 185 transitions. [2025-01-10 06:52:21,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 378 flow [2025-01-10 06:52:21,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 332 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:21,554 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 232 flow [2025-01-10 06:52:21,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2025-01-10 06:52:21,558 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-01-10 06:52:21,559 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 232 flow [2025-01-10 06:52:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 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-01-10 06:52:21,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:21,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:21,569 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-01-10 06:52:21,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:21,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:21,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1455420299, now seen corresponding path program 1 times [2025-01-10 06:52:21,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156044089] [2025-01-10 06:52:21,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:21,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:52:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:52:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:21,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156044089] [2025-01-10 06:52:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156044089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61836915] [2025-01-10 06:52:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:21,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:21,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:21,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:21,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:21,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-01-10 06:52:21,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-10 06:52:21,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:21,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-01-10 06:52:21,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:25,328 INFO L124 PetriNetUnfolderBase]: 44938/60298 cut-off events. [2025-01-10 06:52:25,328 INFO L125 PetriNetUnfolderBase]: For 536/536 co-relation queries the response was YES. [2025-01-10 06:52:25,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121932 conditions, 60298 events. 44938/60298 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 1995. Compared 354065 event pairs, 28644 based on Foata normal form. 0/41185 useless extension candidates. Maximal degree in co-relation 121921. Up to 42056 conditions per place. [2025-01-10 06:52:25,610 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 113 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-01-10 06:52:25,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 121 transitions, 557 flow [2025-01-10 06:52:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-01-10 06:52:25,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-01-10 06:52:25,612 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 232 flow. Second operand 3 states and 143 transitions. [2025-01-10 06:52:25,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 121 transitions, 557 flow [2025-01-10 06:52:25,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 546 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:25,616 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 233 flow [2025-01-10 06:52:25,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-01-10 06:52:25,617 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2025-01-10 06:52:25,618 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 233 flow [2025-01-10 06:52:25,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-10 06:52:25,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:25,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:25,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:52:25,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2126609822, now seen corresponding path program 1 times [2025-01-10 06:52:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410605809] [2025-01-10 06:52:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:25,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:52:25,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:52:25,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:25,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:25,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410605809] [2025-01-10 06:52:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410605809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:25,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:25,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:52:25,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841380668] [2025-01-10 06:52:25,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:25,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:52:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:25,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:52:25,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:52:25,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-01-10 06:52:25,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-01-10 06:52:25,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:25,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-01-10 06:52:25,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:30,646 INFO L124 PetriNetUnfolderBase]: 61880/83378 cut-off events. [2025-01-10 06:52:30,647 INFO L125 PetriNetUnfolderBase]: For 6715/6715 co-relation queries the response was YES. [2025-01-10 06:52:30,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173630 conditions, 83378 events. 61880/83378 cut-off events. For 6715/6715 co-relation queries the response was YES. Maximal size of possible extension queue 2217. Compared 505079 event pairs, 44489 based on Foata normal form. 767/58755 useless extension candidates. Maximal degree in co-relation 173617. Up to 60229 conditions per place. [2025-01-10 06:52:31,077 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 145 selfloop transitions, 4 changer transitions 8/163 dead transitions. [2025-01-10 06:52:31,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 163 transitions, 737 flow [2025-01-10 06:52:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:52:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:52:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-01-10 06:52:31,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2025-01-10 06:52:31,079 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 233 flow. Second operand 5 states and 203 transitions. [2025-01-10 06:52:31,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 163 transitions, 737 flow [2025-01-10 06:52:31,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 163 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:31,082 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 250 flow [2025-01-10 06:52:31,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-01-10 06:52:31,083 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-01-10 06:52:31,083 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 250 flow [2025-01-10 06:52:31,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-01-10 06:52:31,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:31,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:31,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:52:31,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:52:31,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1315117221, now seen corresponding path program 1 times [2025-01-10 06:52:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92424878] [2025-01-10 06:52:31,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:31,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:52:31,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:52:31,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:31,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92424878] [2025-01-10 06:52:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92424878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:31,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564913223] [2025-01-10 06:52:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:31,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:31,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:31,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-01-10 06:52:31,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 250 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-01-10 06:52:31,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:31,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-01-10 06:52:31,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand