./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 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/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-?-48c9605-m [2025-02-08 14:10:21,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:10:21,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:10:21,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:10:21,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:10:21,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:10:21,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:10:21,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:10:21,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:10:21,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:10:21,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:10:21,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:10:21,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:10:21,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:10:21,713 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:10:21,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:10:21,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:10:21,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:10:21,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:10:21,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:10:21,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:10:21,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:10:21,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:10:21,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:10:21,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:10:21,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:10:21,715 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:10:21,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:10:21,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:10:21,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:10:21,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:10:21,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:10:21,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:10:21,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:10:21,716 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-02-08 14:10:21,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:10:21,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:10:21,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:10:21,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:10:21,986 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:10:21,987 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-02-08 14:10:23,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb1a51309/109c307a27d64b378bafc32f526a70d8/FLAGc6bee497c [2025-02-08 14:10:23,565 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:10:23,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-02-08 14:10:23,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb1a51309/109c307a27d64b378bafc32f526a70d8/FLAGc6bee497c [2025-02-08 14:10:23,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb1a51309/109c307a27d64b378bafc32f526a70d8 [2025-02-08 14:10:23,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:10:23,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:10:23,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:10:23,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:10:23,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:10:23,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a002295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23, skipping insertion in model container [2025-02-08 14:10:23,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:10:23,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:10:23,763 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:10:23,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:10:23,793 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:10:23,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23 WrapperNode [2025-02-08 14:10:23,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:10:23,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:10:23,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:10:23,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:10:23,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,822 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 299 [2025-02-08 14:10:23,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:10:23,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:10:23,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:10:23,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:10:23,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,844 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-02-08 14:10:23,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:10:23,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:10:23,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:10:23,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:10:23,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (1/1) ... [2025-02-08 14:10:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:10:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:23,882 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 14:10:23,890 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 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:10:23,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:10:23,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:10:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:10:23,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 14:10:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:10:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:10:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:10:23,905 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 14:10:23,975 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:10:23,976 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:10:24,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: [2025-02-08 14:10:24,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~ret4#1; [2025-02-08 14:10:24,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: ~s_2~0 := #t~ret4#1; [2025-02-08 14:10:24,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 14:10:24,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:24,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc plus_#t~short33#1, plus_#t~short34#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:24,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: #t~ret4#1 := plus_#res#1; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc #t~ret8#1; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: ~s_2~0 := #t~ret8#1; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-4: havoc plus_#t~short33#1, plus_#t~short34#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-5: #t~ret8#1 := plus_#res#1; [2025-02-08 14:10:24,177 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L74: [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc #t~ret16#1; [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: ~s_6~0 := #t~ret16#1; [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-4: havoc plus_#t~short33#1, plus_#t~short34#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-5: #t~ret16#1 := plus_#res#1; [2025-02-08 14:10:24,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: [2025-02-08 14:10:24,375 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:10:24,375 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:10:24,699 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L163 is not an error location. [2025-02-08 14:10:24,700 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L163 is not an error location. [2025-02-08 14:10:24,701 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L163 is not an error location. [2025-02-08 14:10:24,702 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:10:24,702 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:10:24,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:10:24 BoogieIcfgContainer [2025-02-08 14:10:24,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:10:24,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:10:24,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:10:24,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:10:24,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:10:23" (1/3) ... [2025-02-08 14:10:24,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff8a7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:10:24, skipping insertion in model container [2025-02-08 14:10:24,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:23" (2/3) ... [2025-02-08 14:10:24,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff8a7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:10:24, skipping insertion in model container [2025-02-08 14:10:24,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:10:24" (3/3) ... [2025-02-08 14:10:24,709 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-02-08 14:10:24,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:10:24,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 81 locations, 1 initial locations, 4 loop locations, and 28 error locations. [2025-02-08 14:10:24,723 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:10:24,823 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-02-08 14:10:24,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 89 transitions, 218 flow [2025-02-08 14:10:24,923 INFO L124 PetriNetUnfolderBase]: 6/82 cut-off events. [2025-02-08 14:10:24,924 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 14:10:24,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 6/82 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 268 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-02-08 14:10:24,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 89 transitions, 218 flow [2025-02-08 14:10:24,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 80 transitions, 187 flow [2025-02-08 14:10:24,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:10:24,946 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;@3ed48035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:10:24,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-02-08 14:10:24,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:10:24,949 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 14:10:24,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:10:24,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:24,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 14:10:24,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:24,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash 28799, now seen corresponding path program 1 times [2025-02-08 14:10:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:24,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687530890] [2025-02-08 14:10:24,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:10:25,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:10:25,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:25,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:25,058 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 14:10:25,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:25,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687530890] [2025-02-08 14:10:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687530890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:25,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:10:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84151309] [2025-02-08 14:10:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:25,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:10:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:25,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:10:25,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:10:25,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-02-08 14:10:25,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 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-02-08 14:10:25,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:25,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-02-08 14:10:25,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:28,438 INFO L124 PetriNetUnfolderBase]: 38568/52697 cut-off events. [2025-02-08 14:10:28,439 INFO L125 PetriNetUnfolderBase]: For 2037/2037 co-relation queries the response was YES. [2025-02-08 14:10:28,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108188 conditions, 52697 events. 38568/52697 cut-off events. For 2037/2037 co-relation queries the response was YES. Maximal size of possible extension queue 2100. Compared 320026 event pairs, 38087 based on Foata normal form. 1/32801 useless extension candidates. Maximal degree in co-relation 108089. Up to 52668 conditions per place. [2025-02-08 14:10:28,688 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 62 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-02-08 14:10:28,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 70 transitions, 293 flow [2025-02-08 14:10:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:10:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:10:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-02-08 14:10:28,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3882783882783883 [2025-02-08 14:10:28,700 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 187 flow. Second operand 3 states and 106 transitions. [2025-02-08 14:10:28,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 70 transitions, 293 flow [2025-02-08 14:10:28,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 276 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:10:28,728 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 152 flow [2025-02-08 14:10:28,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=73, 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=75, PETRI_TRANSITIONS=70} [2025-02-08 14:10:28,734 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -12 predicate places. [2025-02-08 14:10:28,735 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 152 flow [2025-02-08 14:10:28,735 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-02-08 14:10:28,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:28,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:10:28,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:10:28,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:28,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash 893545, now seen corresponding path program 1 times [2025-02-08 14:10:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:28,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138950147] [2025-02-08 14:10:28,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:28,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:10:28,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:10:28,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:28,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:28,787 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 14:10:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138950147] [2025-02-08 14:10:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138950147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:10:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195742574] [2025-02-08 14:10:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:28,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:10:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:28,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:10:28,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:10:28,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-02-08 14:10:28,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 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-02-08 14:10:28,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:28,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-02-08 14:10:28,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:31,299 INFO L124 PetriNetUnfolderBase]: 31251/42788 cut-off events. [2025-02-08 14:10:31,300 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-02-08 14:10:31,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86738 conditions, 42788 events. 31251/42788 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 1601. Compared 254263 event pairs, 30830 based on Foata normal form. 0/27833 useless extension candidates. Maximal degree in co-relation 86732. Up to 42759 conditions per place. [2025-02-08 14:10:31,462 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 58 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2025-02-08 14:10:31,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 262 flow [2025-02-08 14:10:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:10:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:10:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-08 14:10:31,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2025-02-08 14:10:31,464 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 152 flow. Second operand 3 states and 96 transitions. [2025-02-08 14:10:31,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 262 flow [2025-02-08 14:10:31,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:31,465 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 145 flow [2025-02-08 14:10:31,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=70, 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=72, PETRI_TRANSITIONS=66} [2025-02-08 14:10:31,466 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -15 predicate places. [2025-02-08 14:10:31,466 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 145 flow [2025-02-08 14:10:31,466 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-02-08 14:10:31,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:31,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:10:31,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:10:31,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:31,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash 858724397, now seen corresponding path program 1 times [2025-02-08 14:10:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:31,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517834103] [2025-02-08 14:10:31,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:31,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:31,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:10:31,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:10:31,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:31,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:31,595 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 14:10:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517834103] [2025-02-08 14:10:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517834103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:31,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356828061] [2025-02-08 14:10:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:31,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:31,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:31,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:31,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-02-08 14:10:31,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 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-02-08 14:10:31,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:31,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-02-08 14:10:31,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:33,964 INFO L124 PetriNetUnfolderBase]: 31252/42792 cut-off events. [2025-02-08 14:10:33,965 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-02-08 14:10:33,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86748 conditions, 42792 events. 31252/42792 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 1601. Compared 254211 event pairs, 30830 based on Foata normal form. 1/27837 useless extension candidates. Maximal degree in co-relation 86741. Up to 42763 conditions per place. [2025-02-08 14:10:34,091 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 60 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-02-08 14:10:34,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 279 flow [2025-02-08 14:10:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-08 14:10:34,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3021978021978022 [2025-02-08 14:10:34,093 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 145 flow. Second operand 4 states and 110 transitions. [2025-02-08 14:10:34,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 279 flow [2025-02-08 14:10:34,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:34,095 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 173 flow [2025-02-08 14:10:34,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=71, 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=76, PETRI_TRANSITIONS=69} [2025-02-08 14:10:34,096 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -11 predicate places. [2025-02-08 14:10:34,096 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 173 flow [2025-02-08 14:10:34,096 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-02-08 14:10:34,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:34,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:34,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:10:34,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:34,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1434142475, now seen corresponding path program 1 times [2025-02-08 14:10:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071572897] [2025-02-08 14:10:34,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:34,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:10:34,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:10:34,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:34,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071572897] [2025-02-08 14:10:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071572897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990242699] [2025-02-08 14:10:34,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:34,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:34,222 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 14:10:34,223 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 14:10:34,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:10:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:10:34,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:34,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:34,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:10:34,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:34,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:10:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990242699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:34,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:10:34,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 14:10:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016309823] [2025-02-08 14:10:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:34,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:10:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:34,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:10:34,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:10:34,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-02-08 14:10:34,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 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-02-08 14:10:34,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:34,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-02-08 14:10:34,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:36,559 INFO L124 PetriNetUnfolderBase]: 31252/42791 cut-off events. [2025-02-08 14:10:36,559 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-02-08 14:10:36,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86759 conditions, 42791 events. 31252/42791 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 254268 event pairs, 30830 based on Foata normal form. 1/27837 useless extension candidates. Maximal degree in co-relation 86750. Up to 42758 conditions per place. [2025-02-08 14:10:36,778 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 56 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-02-08 14:10:36,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 295 flow [2025-02-08 14:10:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:10:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:10:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-02-08 14:10:36,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2025-02-08 14:10:36,780 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 173 flow. Second operand 6 states and 130 transitions. [2025-02-08 14:10:36,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 68 transitions, 295 flow [2025-02-08 14:10:36,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:36,782 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 180 flow [2025-02-08 14:10:36,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, 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=79, PETRI_TRANSITIONS=68} [2025-02-08 14:10:36,782 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2025-02-08 14:10:36,782 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 180 flow [2025-02-08 14:10:36,783 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-02-08 14:10:36,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:36,783 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:10:36,791 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-02-08 14:10:36,987 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 14:10:36,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1508744617, now seen corresponding path program 1 times [2025-02-08 14:10:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332159859] [2025-02-08 14:10:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:36,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:10:36,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:10:37,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:37,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:37,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332159859] [2025-02-08 14:10:37,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332159859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:37,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212494565] [2025-02-08 14:10:37,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:37,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:37,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:37,061 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 14:10:37,066 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 14:10:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:10:37,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:10:37,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:37,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:37,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:10:37,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:37,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:37,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212494565] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:37,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:37,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:10:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617988012] [2025-02-08 14:10:37,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:37,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:10:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:37,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:10:37,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:10:37,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-02-08 14:10:37,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 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-02-08 14:10:37,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:37,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-02-08 14:10:37,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:40,186 INFO L124 PetriNetUnfolderBase]: 31255/42803 cut-off events. [2025-02-08 14:10:40,187 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2025-02-08 14:10:40,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86803 conditions, 42803 events. 31255/42803 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 254278 event pairs, 30830 based on Foata normal form. 3/27849 useless extension candidates. Maximal degree in co-relation 86794. Up to 42765 conditions per place. [2025-02-08 14:10:40,346 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 59 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2025-02-08 14:10:40,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 378 flow [2025-02-08 14:10:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:10:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:10:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2025-02-08 14:10:40,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2032967032967033 [2025-02-08 14:10:40,348 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 180 flow. Second operand 10 states and 185 transitions. [2025-02-08 14:10:40,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 378 flow [2025-02-08 14:10:40,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 77 transitions, 332 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 14:10:40,350 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 232 flow [2025-02-08 14:10:40,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, 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=86, PETRI_TRANSITIONS=77} [2025-02-08 14:10:40,352 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -1 predicate places. [2025-02-08 14:10:40,352 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 232 flow [2025-02-08 14:10:40,352 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-02-08 14:10:40,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:40,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:40,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:10:40,553 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-02-08 14:10:40,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:40,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1709463134, now seen corresponding path program 1 times [2025-02-08 14:10:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:40,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769526416] [2025-02-08 14:10:40,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:40,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:10:40,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:10:40,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:40,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:40,615 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 14:10:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769526416] [2025-02-08 14:10:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769526416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:40,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:10:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594150235] [2025-02-08 14:10:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:40,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:10:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:40,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:10:40,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:10:40,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-02-08 14:10:40,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 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-02-08 14:10:40,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:40,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-02-08 14:10:40,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:42,783 INFO L124 PetriNetUnfolderBase]: 29095/39872 cut-off events. [2025-02-08 14:10:42,783 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-02-08 14:10:42,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80917 conditions, 39872 events. 29095/39872 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 241692 event pairs, 15906 based on Foata normal form. 0/26385 useless extension candidates. Maximal degree in co-relation 80906. Up to 22283 conditions per place. [2025-02-08 14:10:42,961 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 106 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-02-08 14:10:42,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 529 flow [2025-02-08 14:10:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:10:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:10:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-02-08 14:10:42,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4981684981684982 [2025-02-08 14:10:42,963 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 232 flow. Second operand 3 states and 136 transitions. [2025-02-08 14:10:42,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 529 flow [2025-02-08 14:10:42,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 518 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:10:42,965 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 223 flow [2025-02-08 14:10:42,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2025-02-08 14:10:42,966 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -2 predicate places. [2025-02-08 14:10:42,966 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 223 flow [2025-02-08 14:10:42,966 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-02-08 14:10:42,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:42,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:42,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:10:42,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1828874971, now seen corresponding path program 1 times [2025-02-08 14:10:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693117561] [2025-02-08 14:10:42,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:42,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:42,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:42,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:43,012 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 14:10:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693117561] [2025-02-08 14:10:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693117561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:43,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:10:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006417002] [2025-02-08 14:10:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:43,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:10:43,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:43,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:10:43,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:10:43,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-02-08 14:10:43,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 223 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 14:10:43,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:43,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-02-08 14:10:43,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:45,620 INFO L124 PetriNetUnfolderBase]: 26760/36817 cut-off events. [2025-02-08 14:10:45,620 INFO L125 PetriNetUnfolderBase]: For 1607/1607 co-relation queries the response was YES. [2025-02-08 14:10:45,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76043 conditions, 36817 events. 26760/36817 cut-off events. For 1607/1607 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 219696 event pairs, 15153 based on Foata normal form. 0/24563 useless extension candidates. Maximal degree in co-relation 76031. Up to 27379 conditions per place. [2025-02-08 14:10:45,773 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 99 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-02-08 14:10:45,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 108 transitions, 500 flow [2025-02-08 14:10:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:10:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:10:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-02-08 14:10:45,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2025-02-08 14:10:45,774 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 223 flow. Second operand 3 states and 131 transitions. [2025-02-08 14:10:45,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 108 transitions, 500 flow [2025-02-08 14:10:45,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 108 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:10:45,780 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 240 flow [2025-02-08 14:10:45,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2025-02-08 14:10:45,780 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -1 predicate places. [2025-02-08 14:10:45,780 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 240 flow [2025-02-08 14:10:45,781 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 14:10:45,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:45,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:45,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:10:45,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:45,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:45,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1453748599, now seen corresponding path program 1 times [2025-02-08 14:10:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18119323] [2025-02-08 14:10:45,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:45,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:45,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:45,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:45,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18119323] [2025-02-08 14:10:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18119323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480573805] [2025-02-08 14:10:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:45,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:45,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:45,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:45,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-02-08 14:10:45,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 240 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-02-08 14:10:45,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:45,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-02-08 14:10:45,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:48,697 INFO L124 PetriNetUnfolderBase]: 41592/57256 cut-off events. [2025-02-08 14:10:48,697 INFO L125 PetriNetUnfolderBase]: For 1997/1997 co-relation queries the response was YES. [2025-02-08 14:10:48,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121018 conditions, 57256 events. 41592/57256 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 1868. Compared 358043 event pairs, 28866 based on Foata normal form. 709/40145 useless extension candidates. Maximal degree in co-relation 121005. Up to 36695 conditions per place. [2025-02-08 14:10:48,986 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 149 selfloop transitions, 4 changer transitions 8/167 dead transitions. [2025-02-08 14:10:48,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 167 transitions, 791 flow [2025-02-08 14:10:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:10:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:10:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2025-02-08 14:10:48,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44395604395604393 [2025-02-08 14:10:48,988 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 240 flow. Second operand 5 states and 202 transitions. [2025-02-08 14:10:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 167 transitions, 791 flow [2025-02-08 14:10:48,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 167 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:48,991 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 254 flow [2025-02-08 14:10:48,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=85, 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=254, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2025-02-08 14:10:48,993 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 4 predicate places. [2025-02-08 14:10:48,993 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 254 flow [2025-02-08 14:10:48,993 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-02-08 14:10:48,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:48,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:48,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:10:48,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-02-08 14:10:48,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash -860548281, now seen corresponding path program 1 times [2025-02-08 14:10:48,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133138807] [2025-02-08 14:10:48,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:49,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:10:49,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:10:49,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:49,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:49,082 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 14:10:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133138807] [2025-02-08 14:10:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133138807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:10:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053446238] [2025-02-08 14:10:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:49,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:10:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:49,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:10:49,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:10:49,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-02-08 14:10:49,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 14:10:49,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:49,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-02-08 14:10:49,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand