./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/pthread-theta/unwind3-1.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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:56:27,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:56:27,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:56:27,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:56:27,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:56:27,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:56:27,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:56:27,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:56:27,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:56:27,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:56:27,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:56:27,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:56:27,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:56:27,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:56:27,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:56:27,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:56:27,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:56:27,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:56:27,683 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-02-06 18:56:27,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:56:27,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:56:27,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:56:27,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:56:27,975 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:56:27,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-02-06 18:56:29,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bcb6d99f/32bbaf3b29e5415f8b1140a3b58dfc62/FLAGd285131fb [2025-02-06 18:56:29,548 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:56:29,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-02-06 18:56:29,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bcb6d99f/32bbaf3b29e5415f8b1140a3b58dfc62/FLAGd285131fb [2025-02-06 18:56:29,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bcb6d99f/32bbaf3b29e5415f8b1140a3b58dfc62 [2025-02-06 18:56:29,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:56:29,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:56:29,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:56:29,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:56:29,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:56:29,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:29,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fe83f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29, skipping insertion in model container [2025-02-06 18:56:29,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:29,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:56:29,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:56:29,885 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:56:29,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:56:29,951 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:56:29,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29 WrapperNode [2025-02-06 18:56:29,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:56:29,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:56:29,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:56:29,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:56:29,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:29,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:29,990 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2025-02-06 18:56:29,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:56:29,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:56:29,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:56:29,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:56:29,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:29,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:29,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,005 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 18:56:30,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:56:30,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:56:30,012 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:56:30,012 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:56:30,012 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (1/1) ... [2025-02-06 18:56:30,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:56:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:30,049 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-06 18:56:30,052 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-06 18:56:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:56:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 18:56:30,069 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 18:56:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 18:56:30,069 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 18:56:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:56:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:56:30,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:56:30,070 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:56:30,150 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:56:30,152 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:56:30,294 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:56:30,296 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:56:30,357 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:56:30,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:56:30,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:56:30 BoogieIcfgContainer [2025-02-06 18:56:30,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:56:30,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:56:30,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:56:30,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:56:30,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:56:29" (1/3) ... [2025-02-06 18:56:30,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a28108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:56:30, skipping insertion in model container [2025-02-06 18:56:30,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:29" (2/3) ... [2025-02-06 18:56:30,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a28108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:56:30, skipping insertion in model container [2025-02-06 18:56:30,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:56:30" (3/3) ... [2025-02-06 18:56:30,365 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-02-06 18:56:30,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:56:30,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 32 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-06 18:56:30,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:56:30,420 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:56:30,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 74 flow [2025-02-06 18:56:30,473 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-02-06 18:56:30,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:30,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2025-02-06 18:56:30,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 74 flow [2025-02-06 18:56:30,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 71 flow [2025-02-06 18:56:30,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:56:30,504 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;@2e7d9973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:56:30,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 18:56:30,508 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:56:30,513 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:56:30,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:30,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:30,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:30,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:30,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1462562630, now seen corresponding path program 1 times [2025-02-06 18:56:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918917633] [2025-02-06 18:56:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:30,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:30,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:30,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:30,676 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-06 18:56:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918917633] [2025-02-06 18:56:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918917633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156192613] [2025-02-06 18:56:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:30,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:56:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:30,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:56:30,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:56:30,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-02-06 18:56:30,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-06 18:56:30,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:30,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-02-06 18:56:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:30,875 INFO L124 PetriNetUnfolderBase]: 92/234 cut-off events. [2025-02-06 18:56:30,876 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 18:56:30,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 234 events. 92/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1032 event pairs, 11 based on Foata normal form. 27/238 useless extension candidates. Maximal degree in co-relation 371. Up to 140 conditions per place. [2025-02-06 18:56:30,879 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 26 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-02-06 18:56:30,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 150 flow [2025-02-06 18:56:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:56:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:56:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-02-06 18:56:30,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-02-06 18:56:30,891 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 71 flow. Second operand 5 states and 97 transitions. [2025-02-06 18:56:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 150 flow [2025-02-06 18:56:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:30,896 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 72 flow [2025-02-06 18:56:30,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-06 18:56:30,900 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-02-06 18:56:30,901 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 72 flow [2025-02-06 18:56:30,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-06 18:56:30,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:30,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:30,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:56:30,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1462562687, now seen corresponding path program 1 times [2025-02-06 18:56:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360467281] [2025-02-06 18:56:30,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:30,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:30,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:30,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:30,951 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-06 18:56:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360467281] [2025-02-06 18:56:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360467281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:56:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617688327] [2025-02-06 18:56:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:30,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:56:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:30,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:56:30,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:56:30,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-02-06 18:56:30,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:30,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:30,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-02-06 18:56:30,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:31,041 INFO L124 PetriNetUnfolderBase]: 61/197 cut-off events. [2025-02-06 18:56:31,041 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 18:56:31,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 197 events. 61/197 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 925 event pairs, 18 based on Foata normal form. 4/183 useless extension candidates. Maximal degree in co-relation 290. Up to 114 conditions per place. [2025-02-06 18:56:31,042 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-06 18:56:31,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 124 flow [2025-02-06 18:56:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:56:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:56:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 18:56:31,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 18:56:31,043 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-02-06 18:56:31,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 124 flow [2025-02-06 18:56:31,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:56:31,044 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 76 flow [2025-02-06 18:56:31,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-02-06 18:56:31,045 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-02-06 18:56:31,045 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 76 flow [2025-02-06 18:56:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:31,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:31,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:56:31,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1905198891, now seen corresponding path program 1 times [2025-02-06 18:56:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734966240] [2025-02-06 18:56:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:31,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:56:31,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:56:31,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:31,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:31,104 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-06 18:56:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734966240] [2025-02-06 18:56:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734966240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:31,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:31,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790159691] [2025-02-06 18:56:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:31,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:56:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:31,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:56:31,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:56:31,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-02-06 18:56:31,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-06 18:56:31,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:31,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-02-06 18:56:31,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:31,231 INFO L124 PetriNetUnfolderBase]: 61/174 cut-off events. [2025-02-06 18:56:31,231 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 18:56:31,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 174 events. 61/174 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 680 event pairs, 6 based on Foata normal form. 13/183 useless extension candidates. Maximal degree in co-relation 284. Up to 60 conditions per place. [2025-02-06 18:56:31,233 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 31 selfloop transitions, 3 changer transitions 3/47 dead transitions. [2025-02-06 18:56:31,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 200 flow [2025-02-06 18:56:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:56:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:56:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-02-06 18:56:31,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-06 18:56:31,234 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 76 flow. Second operand 5 states and 105 transitions. [2025-02-06 18:56:31,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 200 flow [2025-02-06 18:56:31,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:31,235 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 73 flow [2025-02-06 18:56:31,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2025-02-06 18:56:31,236 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2025-02-06 18:56:31,236 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 73 flow [2025-02-06 18:56:31,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-06 18:56:31,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:31,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:31,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:56:31,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:31,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1906069814, now seen corresponding path program 1 times [2025-02-06 18:56:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661698264] [2025-02-06 18:56:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:31,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:56:31,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:56:31,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:31,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:31,315 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-06 18:56:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661698264] [2025-02-06 18:56:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661698264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019007172] [2025-02-06 18:56:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:31,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:31,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:31,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:31,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-02-06 18:56:31,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-06 18:56:31,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:31,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-02-06 18:56:31,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:31,368 INFO L124 PetriNetUnfolderBase]: 46/143 cut-off events. [2025-02-06 18:56:31,368 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-06 18:56:31,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 143 events. 46/143 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 563 event pairs, 11 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 272. Up to 81 conditions per place. [2025-02-06 18:56:31,371 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2025-02-06 18:56:31,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 122 flow [2025-02-06 18:56:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-02-06 18:56:31,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-06 18:56:31,373 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 73 flow. Second operand 4 states and 69 transitions. [2025-02-06 18:56:31,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 122 flow [2025-02-06 18:56:31,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:56:31,374 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 68 flow [2025-02-06 18:56:31,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-02-06 18:56:31,374 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2025-02-06 18:56:31,374 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 68 flow [2025-02-06 18:56:31,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-06 18:56:31,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:31,375 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:31,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:56:31,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:31,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1238343015, now seen corresponding path program 1 times [2025-02-06 18:56:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977818319] [2025-02-06 18:56:31,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:31,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:31,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:56:31,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:56:31,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:31,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:31,438 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-06 18:56:31,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:31,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977818319] [2025-02-06 18:56:31,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977818319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:31,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:31,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:56:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252790411] [2025-02-06 18:56:31,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:31,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:56:31,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:31,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:56:31,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:56:31,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-02-06 18:56:31,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-06 18:56:31,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:31,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-02-06 18:56:31,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:31,515 INFO L124 PetriNetUnfolderBase]: 43/132 cut-off events. [2025-02-06 18:56:31,516 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 18:56:31,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 132 events. 43/132 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 485 event pairs, 11 based on Foata normal form. 4/127 useless extension candidates. Maximal degree in co-relation 249. Up to 67 conditions per place. [2025-02-06 18:56:31,517 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 18 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-02-06 18:56:31,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 125 flow [2025-02-06 18:56:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:56:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:56:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-02-06 18:56:31,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-02-06 18:56:31,518 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 68 flow. Second operand 5 states and 83 transitions. [2025-02-06 18:56:31,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 125 flow [2025-02-06 18:56:31,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:56:31,519 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 70 flow [2025-02-06 18:56:31,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-02-06 18:56:31,519 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2025-02-06 18:56:31,519 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 70 flow [2025-02-06 18:56:31,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-06 18:56:31,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:31,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:31,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:56:31,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:31,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2003745926, now seen corresponding path program 1 times [2025-02-06 18:56:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639700324] [2025-02-06 18:56:31,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:56:31,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:56:31,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:31,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639700324] [2025-02-06 18:56:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639700324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:31,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587283852] [2025-02-06 18:56:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:31,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:31,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:31,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:31,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 33 [2025-02-06 18:56:31,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-06 18:56:31,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:31,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 33 [2025-02-06 18:56:31,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:31,646 INFO L124 PetriNetUnfolderBase]: 83/212 cut-off events. [2025-02-06 18:56:31,646 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 18:56:31,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 212 events. 83/212 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 853 event pairs, 55 based on Foata normal form. 8/211 useless extension candidates. Maximal degree in co-relation 425. Up to 123 conditions per place. [2025-02-06 18:56:31,648 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 24 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-02-06 18:56:31,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 148 flow [2025-02-06 18:56:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-02-06 18:56:31,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2025-02-06 18:56:31,650 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 70 flow. Second operand 4 states and 89 transitions. [2025-02-06 18:56:31,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 148 flow [2025-02-06 18:56:31,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 138 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 18:56:31,651 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 82 flow [2025-02-06 18:56:31,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-02-06 18:56:31,652 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-02-06 18:56:31,653 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 82 flow [2025-02-06 18:56:31,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-06 18:56:31,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:31,653 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:31,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:56:31,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2139579152, now seen corresponding path program 1 times [2025-02-06 18:56:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952919492] [2025-02-06 18:56:31,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:56:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:56:31,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:31,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:31,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:31,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952919492] [2025-02-06 18:56:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952919492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:31,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71374770] [2025-02-06 18:56:31,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:31,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:31,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:56:31,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:56:31,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:56:31,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:56:31,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:31,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:31,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:56:31,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:31,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:56:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71374770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:56:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 11 [2025-02-06 18:56:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405725865] [2025-02-06 18:56:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:56:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:31,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:56:31,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:56:31,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-02-06 18:56:31,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-06 18:56:31,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:31,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-02-06 18:56:31,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:32,072 INFO L124 PetriNetUnfolderBase]: 69/201 cut-off events. [2025-02-06 18:56:32,073 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-02-06 18:56:32,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 201 events. 69/201 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 825 event pairs, 17 based on Foata normal form. 8/204 useless extension candidates. Maximal degree in co-relation 448. Up to 74 conditions per place. [2025-02-06 18:56:32,074 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 22 selfloop transitions, 2 changer transitions 20/51 dead transitions. [2025-02-06 18:56:32,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 249 flow [2025-02-06 18:56:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:56:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:56:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2025-02-06 18:56:32,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-02-06 18:56:32,075 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 82 flow. Second operand 10 states and 174 transitions. [2025-02-06 18:56:32,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 249 flow [2025-02-06 18:56:32,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:32,076 INFO L231 Difference]: Finished difference. Result has 51 places, 26 transitions, 100 flow [2025-02-06 18:56:32,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=100, PETRI_PLACES=51, PETRI_TRANSITIONS=26} [2025-02-06 18:56:32,077 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-02-06 18:56:32,077 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 26 transitions, 100 flow [2025-02-06 18:56:32,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-06 18:56:32,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:32,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:32,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:56:32,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:32,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:32,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash 961739353, now seen corresponding path program 1 times [2025-02-06 18:56:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416460093] [2025-02-06 18:56:32,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:32,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:56:32,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:56:32,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:32,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416460093] [2025-02-06 18:56:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416460093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043356169] [2025-02-06 18:56:32,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:32,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:32,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:56:32,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:56:32,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:56:32,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:56:32,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:32,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:32,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:56:32,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:32,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:56:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043356169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:32,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:56:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 18:56:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697944413] [2025-02-06 18:56:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:32,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:32,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:32,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:56:32,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 33 [2025-02-06 18:56:32,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-06 18:56:32,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:32,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 33 [2025-02-06 18:56:32,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:32,596 INFO L124 PetriNetUnfolderBase]: 39/116 cut-off events. [2025-02-06 18:56:32,596 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-06 18:56:32,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 116 events. 39/116 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 324 event pairs, 15 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 289. Up to 43 conditions per place. [2025-02-06 18:56:32,597 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 21 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-02-06 18:56:32,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 33 transitions, 164 flow [2025-02-06 18:56:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-02-06 18:56:32,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-02-06 18:56:32,598 INFO L175 Difference]: Start difference. First operand has 51 places, 26 transitions, 100 flow. Second operand 6 states and 117 transitions. [2025-02-06 18:56:32,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 33 transitions, 164 flow [2025-02-06 18:56:32,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 149 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-06 18:56:32,599 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 91 flow [2025-02-06 18:56:32,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2025-02-06 18:56:32,599 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-02-06 18:56:32,599 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 91 flow [2025-02-06 18:56:32,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-06 18:56:32,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:32,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:32,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:56:32,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:32,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash 236124996, now seen corresponding path program 1 times [2025-02-06 18:56:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:32,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352225131] [2025-02-06 18:56:32,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:32,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:56:32,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:56:32,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:32,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352225131] [2025-02-06 18:56:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352225131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686336328] [2025-02-06 18:56:32,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:32,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:56:32,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:56:32,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:56:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:56:32,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:32,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:32,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:56:32,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:32,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:56:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686336328] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:56:32,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:56:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:56:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88906041] [2025-02-06 18:56:32,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:56:32,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:56:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:32,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:56:32,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:56:32,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 33 [2025-02-06 18:56:32,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 91 flow. Second operand has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 12 states have internal predecessors, (203), 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-06 18:56:32,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:32,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 33 [2025-02-06 18:56:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:33,054 INFO L124 PetriNetUnfolderBase]: 63/200 cut-off events. [2025-02-06 18:56:33,054 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-02-06 18:56:33,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 200 events. 63/200 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 613 event pairs, 27 based on Foata normal form. 12/211 useless extension candidates. Maximal degree in co-relation 465. Up to 71 conditions per place. [2025-02-06 18:56:33,055 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 31 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2025-02-06 18:56:33,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 239 flow [2025-02-06 18:56:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:56:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:56:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2025-02-06 18:56:33,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5848484848484848 [2025-02-06 18:56:33,055 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 91 flow. Second operand 10 states and 193 transitions. [2025-02-06 18:56:33,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 239 flow [2025-02-06 18:56:33,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 224 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 18:56:33,057 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 146 flow [2025-02-06 18:56:33,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2025-02-06 18:56:33,057 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-02-06 18:56:33,057 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 146 flow [2025-02-06 18:56:33,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 12 states have internal predecessors, (203), 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-06 18:56:33,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:33,057 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:33,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:56:33,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:33,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-02-06 18:56:33,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1134496040, now seen corresponding path program 2 times [2025-02-06 18:56:33,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:33,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452413678] [2025-02-06 18:56:33,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:56:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:33,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 18:56:33,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-02-06 18:56:33,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:56:33,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:56:33,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452413678] [2025-02-06 18:56:33,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452413678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753509172] [2025-02-06 18:56:33,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:56:33,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:33,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:33,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:56:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:56:33,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 18:56:33,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-02-06 18:56:33,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:56:33,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:33,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:56:33,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:56:33,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:56:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:56:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753509172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:56:33,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:56:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2025-02-06 18:56:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027088087] [2025-02-06 18:56:33,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:56:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:56:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:33,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:56:33,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:56:33,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-02-06 18:56:33,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 146 flow. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 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-06 18:56:33,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:33,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-02-06 18:56:33,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:33,921 INFO L124 PetriNetUnfolderBase]: 113/365 cut-off events. [2025-02-06 18:56:33,921 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-02-06 18:56:33,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 365 events. 113/365 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1620 event pairs, 0 based on Foata normal form. 8/373 useless extension candidates. Maximal degree in co-relation 898. Up to 50 conditions per place. [2025-02-06 18:56:33,922 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2025-02-06 18:56:33,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 462 flow [2025-02-06 18:56:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 18:56:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 18:56:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 217 transitions. [2025-02-06 18:56:33,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3287878787878788 [2025-02-06 18:56:33,924 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 146 flow. Second operand 20 states and 217 transitions. [2025-02-06 18:56:33,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 462 flow [2025-02-06 18:56:33,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 422 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 18:56:33,928 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-02-06 18:56:33,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-02-06 18:56:33,928 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-02-06 18:56:33,928 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-02-06 18:56:33,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 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-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-06 18:56:33,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-06 18:56:33,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:56:34,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 18:56:34,132 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:34,136 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 18:56:34,136 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 18:56:34,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:56:34 BasicIcfg [2025-02-06 18:56:34,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 18:56:34,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:56:34,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:56:34,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:56:34,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:56:30" (3/4) ... [2025-02-06 18:56:34,141 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 18:56:34,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f1 [2025-02-06 18:56:34,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f2 [2025-02-06 18:56:34,144 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 18:56:34,144 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 18:56:34,144 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 18:56:34,144 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 18:56:34,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 18:56:34,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 18:56:34,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:56:34,191 INFO L158 Benchmark]: Toolchain (without parser) took 4597.58ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 47.2MB in the end (delta: 76.4MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2025-02-06 18:56:34,191 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:56:34,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.72ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 103.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 18:56:34,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.96ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 101.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:56:34,192 INFO L158 Benchmark]: Boogie Preprocessor took 20.08ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:56:34,192 INFO L158 Benchmark]: IcfgBuilder took 346.43ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 79.5MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 18:56:34,192 INFO L158 Benchmark]: TraceAbstraction took 3779.34ms. Allocated memory is still 167.8MB. Free memory was 78.8MB in the beginning and 52.6MB in the end (delta: 26.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-02-06 18:56:34,192 INFO L158 Benchmark]: Witness Printer took 51.04ms. Allocated memory is still 167.8MB. Free memory was 52.6MB in the beginning and 47.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:56:34,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.72ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 103.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.96ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 101.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.08ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 346.43ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 79.5MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3779.34ms. Allocated memory is still 167.8MB. Free memory was 78.8MB in the beginning and 52.6MB in the end (delta: 26.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 51.04ms. Allocated memory is still 167.8MB. Free memory was 52.6MB in the beginning and 47.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 759]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 759]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 766]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 766]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 435 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 405 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1203 IncrementalHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 30 mSDtfsCounter, 1203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 14 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 81/118 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 18:56:34,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE