./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i --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/goblint-regression/28-race_reach_21-deref_read_racing.i -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 cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:05:32,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:05:32,778 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:05:32,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:05:32,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:05:32,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:05:32,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:05:32,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:05:32,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:05:32,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:05:32,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:05:32,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:05:32,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:05:32,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:32,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:05:32,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:05:32,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:05:32,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:05:32,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:05:32,798 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 -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2025-02-08 14:05:33,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:05:33,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:05:33,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:05:33,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:05:33,016 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:05:33,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-02-08 14:05:34,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ce30aa6e/8b14a91d515c4e48a340119c2b0302e2/FLAGf5c506d0e [2025-02-08 14:05:34,502 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:05:34,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-02-08 14:05:34,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ce30aa6e/8b14a91d515c4e48a340119c2b0302e2/FLAGf5c506d0e [2025-02-08 14:05:34,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ce30aa6e/8b14a91d515c4e48a340119c2b0302e2 [2025-02-08 14:05:34,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:05:34,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:05:34,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:34,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:05:34,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:05:34,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:34" (1/1) ... [2025-02-08 14:05:34,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253b3e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:34, skipping insertion in model container [2025-02-08 14:05:34,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:34" (1/1) ... [2025-02-08 14:05:34,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:05:35,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:35,062 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:05:35,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:35,142 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:05:35,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35 WrapperNode [2025-02-08 14:05:35,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:35,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:35,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:05:35,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:05:35,149 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:05:35" (1/1) ... [2025-02-08 14:05:35,158 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:05:35" (1/1) ... [2025-02-08 14:05:35,172 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-02-08 14:05:35,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:35,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:05:35,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:05:35,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:05:35,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,188 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2025-02-08 14:05:35,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:05:35,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:05:35,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:05:35,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:05:35,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (1/1) ... [2025-02-08 14:05:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:35,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:05:35,243 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:05:35,246 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:05:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:05:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:05:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:05:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:05:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:05:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:05:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:05:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:05:35,263 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:05:35,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:05:35,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:05:35,264 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:05:35,367 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:05:35,368 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:05:35,520 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:05:35,520 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:05:35,614 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:05:35,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:05:35,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:35 BoogieIcfgContainer [2025-02-08 14:05:35,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:05:35,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:05:35,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:05:35,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:05:35,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:05:34" (1/3) ... [2025-02-08 14:05:35,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a957fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:35, skipping insertion in model container [2025-02-08 14:05:35,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:35" (2/3) ... [2025-02-08 14:05:35,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a957fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:35, skipping insertion in model container [2025-02-08 14:05:35,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:35" (3/3) ... [2025-02-08 14:05:35,622 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2025-02-08 14:05:35,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:05:35,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_21-deref_read_racing.i that has 2 procedures, 44 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-02-08 14:05:35,634 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:05:35,677 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:05:35,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 52 transitions, 108 flow [2025-02-08 14:05:35,720 INFO L124 PetriNetUnfolderBase]: 10/63 cut-off events. [2025-02-08 14:05:35,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:35,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 10/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 159 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-02-08 14:05:35,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 52 transitions, 108 flow [2025-02-08 14:05:35,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 52 transitions, 108 flow [2025-02-08 14:05:35,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:35,738 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;@77c63c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:35,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 14:05:35,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:35,749 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 14:05:35,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:35,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:35,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:35,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-08 14:05:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 259982893, now seen corresponding path program 1 times [2025-02-08 14:05:35,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:35,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178830984] [2025-02-08 14:05:35,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:35,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:35,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:35,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:35,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:35,978 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:05:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178830984] [2025-02-08 14:05:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178830984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:35,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:35,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806813623] [2025-02-08 14:05:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:35,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:36,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:36,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-02-08 14:05:36,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:05:36,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:36,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-02-08 14:05:36,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:36,143 INFO L124 PetriNetUnfolderBase]: 88/320 cut-off events. [2025-02-08 14:05:36,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:36,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 320 events. 88/320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1479 event pairs, 60 based on Foata normal form. 90/381 useless extension candidates. Maximal degree in co-relation 510. Up to 162 conditions per place. [2025-02-08 14:05:36,146 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 41 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-02-08 14:05:36,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 222 flow [2025-02-08 14:05:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-02-08 14:05:36,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7259615384615384 [2025-02-08 14:05:36,155 INFO L175 Difference]: Start difference. First operand has 47 places, 52 transitions, 108 flow. Second operand 4 states and 151 transitions. [2025-02-08 14:05:36,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 222 flow [2025-02-08 14:05:36,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:36,160 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 98 flow [2025-02-08 14:05:36,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-02-08 14:05:36,163 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-02-08 14:05:36,163 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 98 flow [2025-02-08 14:05:36,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:05:36,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:36,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:05:36,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-08 14:05:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1324532968, now seen corresponding path program 1 times [2025-02-08 14:05:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-02-08 14:05:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:36,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:36,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:36,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:36,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:36,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:36,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:36,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:36,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:36,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:36,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 14:05:36,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 14:05:36,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 14:05:36,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 14:05:36,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 14:05:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:05:36,210 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:05:36,212 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:36,212 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:05:36,232 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:05:36,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 86 transitions, 182 flow [2025-02-08 14:05:36,245 INFO L124 PetriNetUnfolderBase]: 18/113 cut-off events. [2025-02-08 14:05:36,245 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:05:36,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 113 events. 18/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 383 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2025-02-08 14:05:36,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 86 transitions, 182 flow [2025-02-08 14:05:36,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 86 transitions, 182 flow [2025-02-08 14:05:36,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:36,249 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;@77c63c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:36,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 14:05:36,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:36,254 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 14:05:36,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:36,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:36,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:36,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash 342084836, now seen corresponding path program 1 times [2025-02-08 14:05:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239986159] [2025-02-08 14:05:36,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:36,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:36,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:36,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:36,325 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:05:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239986159] [2025-02-08 14:05:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239986159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293404723] [2025-02-08 14:05:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:36,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:36,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:36,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-02-08 14:05:36,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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:05:36,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:36,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-02-08 14:05:36,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:36,998 INFO L124 PetriNetUnfolderBase]: 2860/6432 cut-off events. [2025-02-08 14:05:36,998 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 14:05:37,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11028 conditions, 6432 events. 2860/6432 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 54185 event pairs, 1320 based on Foata normal form. 1926/7726 useless extension candidates. Maximal degree in co-relation 897. Up to 4518 conditions per place. [2025-02-08 14:05:37,031 INFO L140 encePairwiseOnDemand]: 66/86 looper letters, 57 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-02-08 14:05:37,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 324 flow [2025-02-08 14:05:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-08 14:05:37,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.688953488372093 [2025-02-08 14:05:37,033 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 182 flow. Second operand 4 states and 237 transitions. [2025-02-08 14:05:37,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 324 flow [2025-02-08 14:05:37,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:37,035 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 178 flow [2025-02-08 14:05:37,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-02-08 14:05:37,036 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-02-08 14:05:37,036 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 178 flow [2025-02-08 14:05:37,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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:05:37,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:37,037 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:37,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:05:37,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:37,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -475533958, now seen corresponding path program 1 times [2025-02-08 14:05:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505520184] [2025-02-08 14:05:37,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:37,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:37,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:37,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:37,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:37,139 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:05:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505520184] [2025-02-08 14:05:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505520184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:37,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:37,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929916149] [2025-02-08 14:05:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:37,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:37,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:37,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:37,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-02-08 14:05:37,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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:05:37,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:37,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-02-08 14:05:37,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:37,695 INFO L124 PetriNetUnfolderBase]: 2596/5470 cut-off events. [2025-02-08 14:05:37,695 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2025-02-08 14:05:37,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10298 conditions, 5470 events. 2596/5470 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 43678 event pairs, 252 based on Foata normal form. 144/5300 useless extension candidates. Maximal degree in co-relation 867. Up to 2156 conditions per place. [2025-02-08 14:05:37,719 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 97 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2025-02-08 14:05:37,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 140 transitions, 514 flow [2025-02-08 14:05:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 326 transitions. [2025-02-08 14:05:37,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6317829457364341 [2025-02-08 14:05:37,721 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 178 flow. Second operand 6 states and 326 transitions. [2025-02-08 14:05:37,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 140 transitions, 514 flow [2025-02-08 14:05:37,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 140 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:37,723 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 184 flow [2025-02-08 14:05:37,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2025-02-08 14:05:37,724 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-02-08 14:05:37,724 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 184 flow [2025-02-08 14:05:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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:05:37,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:37,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:37,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:05:37,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1140891170, now seen corresponding path program 1 times [2025-02-08 14:05:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-02-08 14:05:37,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:37,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:37,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:37,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:37,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:37,823 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:05:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-02-08 14:05:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695310451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186592539] [2025-02-08 14:05:37,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:37,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:37,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:37,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:37,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 86 [2025-02-08 14:05:37,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:05:37,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:37,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 86 [2025-02-08 14:05:37,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:38,474 INFO L124 PetriNetUnfolderBase]: 2393/5313 cut-off events. [2025-02-08 14:05:38,475 INFO L125 PetriNetUnfolderBase]: For 1272/1433 co-relation queries the response was YES. [2025-02-08 14:05:38,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9927 conditions, 5313 events. 2393/5313 cut-off events. For 1272/1433 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 42372 event pairs, 757 based on Foata normal form. 104/5114 useless extension candidates. Maximal degree in co-relation 7933. Up to 3353 conditions per place. [2025-02-08 14:05:38,500 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 74 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-02-08 14:05:38,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 476 flow [2025-02-08 14:05:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2025-02-08 14:05:38,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302325581395349 [2025-02-08 14:05:38,503 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 184 flow. Second operand 5 states and 271 transitions. [2025-02-08 14:05:38,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 476 flow [2025-02-08 14:05:38,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 453 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:38,505 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 216 flow [2025-02-08 14:05:38,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2025-02-08 14:05:38,506 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2025-02-08 14:05:38,506 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 216 flow [2025-02-08 14:05:38,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:05:38,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:38,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:05:38,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:38,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1856650522, now seen corresponding path program 1 times [2025-02-08 14:05:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-02-08 14:05:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:38,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:38,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:38,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:38,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:38,557 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:05:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-02-08 14:05:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986223479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113723252] [2025-02-08 14:05:38,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:38,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:38,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:38,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:38,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 86 [2025-02-08 14:05:38,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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:05:38,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:38,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 86 [2025-02-08 14:05:38,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:38,960 INFO L124 PetriNetUnfolderBase]: 2459/5038 cut-off events. [2025-02-08 14:05:38,960 INFO L125 PetriNetUnfolderBase]: For 1384/1384 co-relation queries the response was YES. [2025-02-08 14:05:38,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 5038 events. 2459/5038 cut-off events. For 1384/1384 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 38482 event pairs, 254 based on Foata normal form. 152/5073 useless extension candidates. Maximal degree in co-relation 9436. Up to 2725 conditions per place. [2025-02-08 14:05:38,983 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 89 selfloop transitions, 6 changer transitions 0/132 dead transitions. [2025-02-08 14:05:38,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 132 transitions, 558 flow [2025-02-08 14:05:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2025-02-08 14:05:38,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6598837209302325 [2025-02-08 14:05:38,985 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 216 flow. Second operand 4 states and 227 transitions. [2025-02-08 14:05:38,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 132 transitions, 558 flow [2025-02-08 14:05:38,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 132 transitions, 554 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:38,993 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 228 flow [2025-02-08 14:05:38,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-02-08 14:05:38,994 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-02-08 14:05:38,994 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 228 flow [2025-02-08 14:05:38,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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:05:38,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:38,995 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:05:38,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:05:38,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-08 14:05:38,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1829712846, now seen corresponding path program 1 times [2025-02-08 14:05:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:38,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418315984] [2025-02-08 14:05:38,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:39,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:39,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:39,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:39,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:39,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:39,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:39,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:39,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:39,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:39,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:39,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:39,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 14:05:39,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-02-08 14:05:39,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-02-08 14:05:39,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-02-08 14:05:39,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-02-08 14:05:39,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-02-08 14:05:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:05:39,039 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:05:39,039 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:39,042 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:05:39,072 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:05:39,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 120 transitions, 258 flow [2025-02-08 14:05:39,091 INFO L124 PetriNetUnfolderBase]: 26/163 cut-off events. [2025-02-08 14:05:39,091 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 14:05:39,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 163 events. 26/163 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 600 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2025-02-08 14:05:39,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 120 transitions, 258 flow [2025-02-08 14:05:39,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 120 transitions, 258 flow [2025-02-08 14:05:39,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:39,098 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;@77c63c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:39,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 14:05:39,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:39,099 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 14:05:39,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:39,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:39,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:39,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 456633149, now seen corresponding path program 1 times [2025-02-08 14:05:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674041774] [2025-02-08 14:05:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:39,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:39,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:39,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:39,143 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:05:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:39,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674041774] [2025-02-08 14:05:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674041774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378743938] [2025-02-08 14:05:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:39,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:39,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:39,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 120 [2025-02-08 14:05:39,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 120 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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:05:39,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:39,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 120 [2025-02-08 14:05:39,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:44,762 INFO L124 PetriNetUnfolderBase]: 53548/98954 cut-off events. [2025-02-08 14:05:44,763 INFO L125 PetriNetUnfolderBase]: For 1092/1092 co-relation queries the response was YES. [2025-02-08 14:05:44,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173823 conditions, 98954 events. 53548/98954 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 2499. Compared 1038717 event pairs, 34584 based on Foata normal form. 32958/123154 useless extension candidates. Maximal degree in co-relation 11439. Up to 74214 conditions per place. [2025-02-08 14:05:45,250 INFO L140 encePairwiseOnDemand]: 94/120 looper letters, 69 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-02-08 14:05:45,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 125 transitions, 412 flow [2025-02-08 14:05:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-02-08 14:05:45,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6645833333333333 [2025-02-08 14:05:45,253 INFO L175 Difference]: Start difference. First operand has 107 places, 120 transitions, 258 flow. Second operand 4 states and 319 transitions. [2025-02-08 14:05:45,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 125 transitions, 412 flow [2025-02-08 14:05:45,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 125 transitions, 410 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:45,258 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 240 flow [2025-02-08 14:05:45,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-02-08 14:05:45,258 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-02-08 14:05:45,259 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 240 flow [2025-02-08 14:05:45,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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:05:45,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:45,260 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:45,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:45,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1690174182, now seen corresponding path program 1 times [2025-02-08 14:05:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644076143] [2025-02-08 14:05:45,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:45,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:45,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:45,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:45,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:45,481 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:05:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644076143] [2025-02-08 14:05:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644076143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695757655] [2025-02-08 14:05:45,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:45,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:45,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:45,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 120 [2025-02-08 14:05:45,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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:05:45,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:45,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 120 [2025-02-08 14:05:45,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:50,139 INFO L124 PetriNetUnfolderBase]: 48532/81694 cut-off events. [2025-02-08 14:05:50,140 INFO L125 PetriNetUnfolderBase]: For 6166/6166 co-relation queries the response was YES. [2025-02-08 14:05:50,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157083 conditions, 81694 events. 48532/81694 cut-off events. For 6166/6166 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 773035 event pairs, 8184 based on Foata normal form. 1872/79484 useless extension candidates. Maximal degree in co-relation 13339. Up to 34556 conditions per place. [2025-02-08 14:05:50,512 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 131 selfloop transitions, 6 changer transitions 0/190 dead transitions. [2025-02-08 14:05:50,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 190 transitions, 688 flow [2025-02-08 14:05:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-02-08 14:05:50,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-02-08 14:05:50,514 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 240 flow. Second operand 6 states and 456 transitions. [2025-02-08 14:05:50,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 190 transitions, 688 flow [2025-02-08 14:05:50,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 190 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:50,520 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 246 flow [2025-02-08 14:05:50,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2025-02-08 14:05:50,521 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2025-02-08 14:05:50,521 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 246 flow [2025-02-08 14:05:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 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:05:50,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:50,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:50,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:50,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash -681441417, now seen corresponding path program 1 times [2025-02-08 14:05:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-02-08 14:05:50,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:50,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:50,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:50,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:50,574 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:05:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-02-08 14:05:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935887593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666639408] [2025-02-08 14:05:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:50,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:50,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:50,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:50,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 120 [2025-02-08 14:05:50,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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:05:50,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:50,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 120 [2025-02-08 14:05:50,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:55,249 INFO L124 PetriNetUnfolderBase]: 47105/84294 cut-off events. [2025-02-08 14:05:55,250 INFO L125 PetriNetUnfolderBase]: For 16535/18783 co-relation queries the response was YES. [2025-02-08 14:05:55,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159496 conditions, 84294 events. 47105/84294 cut-off events. For 16535/18783 co-relation queries the response was YES. Maximal size of possible extension queue 2174. Compared 834278 event pairs, 18833 based on Foata normal form. 1256/81165 useless extension candidates. Maximal degree in co-relation 136435. Up to 60521 conditions per place. [2025-02-08 14:05:55,701 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 110 selfloop transitions, 8 changer transitions 0/172 dead transitions. [2025-02-08 14:05:55,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 172 transitions, 681 flow [2025-02-08 14:05:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 389 transitions. [2025-02-08 14:05:55,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6483333333333333 [2025-02-08 14:05:55,703 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 246 flow. Second operand 5 states and 389 transitions. [2025-02-08 14:05:55,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 172 transitions, 681 flow [2025-02-08 14:05:55,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 172 transitions, 658 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:55,710 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 295 flow [2025-02-08 14:05:55,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2025-02-08 14:05:55,710 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places. [2025-02-08 14:05:55,710 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 295 flow [2025-02-08 14:05:55,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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:05:55,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:55,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:55,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:05:55,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:05:55,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash -855791682, now seen corresponding path program 1 times [2025-02-08 14:05:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:55,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172779616] [2025-02-08 14:05:55,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:55,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:55,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:55,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:55,747 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:05:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:55,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172779616] [2025-02-08 14:05:55,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172779616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:55,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:55,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103510098] [2025-02-08 14:05:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:55,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:55,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:55,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:55,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 120 [2025-02-08 14:05:55,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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:05:55,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:55,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 120 [2025-02-08 14:05:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:00,650 INFO L124 PetriNetUnfolderBase]: 48849/82078 cut-off events. [2025-02-08 14:06:00,650 INFO L125 PetriNetUnfolderBase]: For 24847/24847 co-relation queries the response was YES. [2025-02-08 14:06:01,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169453 conditions, 82078 events. 48849/82078 cut-off events. For 24847/24847 co-relation queries the response was YES. Maximal size of possible extension queue 2116. Compared 778580 event pairs, 8837 based on Foata normal form. 2136/82810 useless extension candidates. Maximal degree in co-relation 147351. Up to 46837 conditions per place. [2025-02-08 14:06:01,381 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 129 selfloop transitions, 6 changer transitions 0/188 dead transitions. [2025-02-08 14:06:01,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 188 transitions, 795 flow [2025-02-08 14:06:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-02-08 14:06:01,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-02-08 14:06:01,383 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 295 flow. Second operand 4 states and 325 transitions. [2025-02-08 14:06:01,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 188 transitions, 795 flow [2025-02-08 14:06:01,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 791 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:06:01,680 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 307 flow [2025-02-08 14:06:01,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-02-08 14:06:01,681 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 13 predicate places. [2025-02-08 14:06:01,681 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 307 flow [2025-02-08 14:06:01,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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:06:01,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:01,685 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:01,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:06:01,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:06:01,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1268973204, now seen corresponding path program 1 times [2025-02-08 14:06:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072912484] [2025-02-08 14:06:01,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:01,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:06:01,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:06:01,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:01,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:01,732 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:06:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072912484] [2025-02-08 14:06:01,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072912484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488318264] [2025-02-08 14:06:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:01,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:01,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:01,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:01,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 120 [2025-02-08 14:06:01,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:06:01,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:01,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 120 [2025-02-08 14:06:01,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:07,342 INFO L124 PetriNetUnfolderBase]: 52665/94941 cut-off events. [2025-02-08 14:06:07,343 INFO L125 PetriNetUnfolderBase]: For 37680/37728 co-relation queries the response was YES. [2025-02-08 14:06:07,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195037 conditions, 94941 events. 52665/94941 cut-off events. For 37680/37728 co-relation queries the response was YES. Maximal size of possible extension queue 2527. Compared 963537 event pairs, 21673 based on Foata normal form. 2624/93871 useless extension candidates. Maximal degree in co-relation 169475. Up to 68097 conditions per place. [2025-02-08 14:06:07,951 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 111 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2025-02-08 14:06:07,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 766 flow [2025-02-08 14:06:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:06:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:06:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2025-02-08 14:06:07,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-02-08 14:06:07,953 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 307 flow. Second operand 5 states and 388 transitions. [2025-02-08 14:06:07,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 766 flow [2025-02-08 14:06:07,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:06:07,982 INFO L231 Difference]: Finished difference. Result has 125 places, 113 transitions, 372 flow [2025-02-08 14:06:07,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=125, PETRI_TRANSITIONS=113} [2025-02-08 14:06:07,984 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2025-02-08 14:06:07,984 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 113 transitions, 372 flow [2025-02-08 14:06:07,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:06:07,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:07,984 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 14:06:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:06:07,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 14:06:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 35973031, now seen corresponding path program 1 times [2025-02-08 14:06:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946803622] [2025-02-08 14:06:07,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:07,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:06:08,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:06:08,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:08,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:08,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:06:08,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:06:08,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:06:08,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:08,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:08,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:06:08,018 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:06:08,018 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-08 14:06:08,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-02-08 14:06:08,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-02-08 14:06:08,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-02-08 14:06:08,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-02-08 14:06:08,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-02-08 14:06:08,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-02-08 14:06:08,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-02-08 14:06:08,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:06:08,023 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 14:06:08,023 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:06:08,023 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 14:06:08,050 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:06:08,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 154 transitions, 336 flow [2025-02-08 14:06:08,069 INFO L124 PetriNetUnfolderBase]: 34/213 cut-off events. [2025-02-08 14:06:08,070 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 14:06:08,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 213 events. 34/213 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 818 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 179. Up to 10 conditions per place. [2025-02-08 14:06:08,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 154 transitions, 336 flow [2025-02-08 14:06:08,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 154 transitions, 336 flow [2025-02-08 14:06:08,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:08,074 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;@77c63c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:08,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 14:06:08,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:08,076 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 14:06:08,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:08,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:08,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:08,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2025-02-08 14:06:08,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 603627832, now seen corresponding path program 1 times [2025-02-08 14:06:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:08,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139264012] [2025-02-08 14:06:08,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:08,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:08,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:08,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:08,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:08,109 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:06:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139264012] [2025-02-08 14:06:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139264012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:08,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:08,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919667781] [2025-02-08 14:06:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:08,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:08,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:08,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:08,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 154 [2025-02-08 14:06:08,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 154 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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:06:08,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:08,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 154 [2025-02-08 14:06:08,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand