./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/exponential-nondet.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/exponential-nondet.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 f87ddde6d61a5d434f69c49dc65eaf95f54327ebb0ef5acca382e4d4744605ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:56:17,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:56:17,669 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:17,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:56:17,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:56:17,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:56:17,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:56:17,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:56:17,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:56:17,694 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:56:17,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:56:17,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:56:17,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:56:17,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:56:17,696 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:56:17,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:56:17,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:56:17,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:56:17,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:56:17,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:56:17,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:56:17,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:56:17,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:56:17,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:56:17,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:56:17,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:56:17,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:56:17,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:56:17,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:56:17,699 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 -> f87ddde6d61a5d434f69c49dc65eaf95f54327ebb0ef5acca382e4d4744605ae [2025-02-06 18:56:17,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:56:17,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:56:17,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:56:17,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:56:17,950 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:56:17,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-nondet.i [2025-02-06 18:56:19,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dd82fe50/fc2d19ec0f334b968e67e81ce5ecf9a2/FLAG03fa09e6c [2025-02-06 18:56:19,314 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:56:19,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-nondet.i [2025-02-06 18:56:19,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dd82fe50/fc2d19ec0f334b968e67e81ce5ecf9a2/FLAG03fa09e6c [2025-02-06 18:56:19,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dd82fe50/fc2d19ec0f334b968e67e81ce5ecf9a2 [2025-02-06 18:56:19,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:56:19,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:56:19,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:56:19,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:56:19,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:56:19,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:56:19" (1/1) ... [2025-02-06 18:56:19,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bb8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:19, skipping insertion in model container [2025-02-06 18:56:19,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:56:19" (1/1) ... [2025-02-06 18:56:19,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:56:19,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:56:19,900 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:56:19,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:56:19,954 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:56:19,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:19 WrapperNode [2025-02-06 18:56:19,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:56:19,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:56:19,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:56:19,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:56:19,961 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:19" (1/1) ... [2025-02-06 18:56:19,972 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:19" (1/1) ... [2025-02-06 18:56:19,983 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2025-02-06 18:56:19,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:56:19,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:56:19,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:56:19,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:56:19,989 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:19" (1/1) ... [2025-02-06 18:56:19,989 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:19" (1/1) ... [2025-02-06 18:56:19,990 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:19" (1/1) ... [2025-02-06 18:56:19,998 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:19,998 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:19" (1/1) ... [2025-02-06 18:56:19,998 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:19" (1/1) ... [2025-02-06 18:56:20,003 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:19" (1/1) ... [2025-02-06 18:56:20,004 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:19" (1/1) ... [2025-02-06 18:56:20,004 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:19" (1/1) ... [2025-02-06 18:56:20,005 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:19" (1/1) ... [2025-02-06 18:56:20,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:56:20,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:56:20,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:56:20,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:56:20,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:19" (1/1) ... [2025-02-06 18:56:20,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:56:20,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:20,032 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:20,034 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:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:56:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 18:56:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 18:56:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 18:56:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 18:56:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:56:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:56:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:56:20,052 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:20,139 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:56:20,141 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:56:20,273 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:56:20,274 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:56:20,358 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:56:20,359 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:56:20,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:56:20 BoogieIcfgContainer [2025-02-06 18:56:20,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:56:20,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:56:20,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:56:20,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:56:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:56:19" (1/3) ... [2025-02-06 18:56:20,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73682a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:56:20, skipping insertion in model container [2025-02-06 18:56:20,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:56:19" (2/3) ... [2025-02-06 18:56:20,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73682a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:56:20, skipping insertion in model container [2025-02-06 18:56:20,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:56:20" (3/3) ... [2025-02-06 18:56:20,369 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-nondet.i [2025-02-06 18:56:20,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:56:20,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-nondet.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 18:56:20,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:56:20,413 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:56:20,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2025-02-06 18:56:20,464 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-02-06 18:56:20,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:20,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 2/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-02-06 18:56:20,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 58 flow [2025-02-06 18:56:20,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 53 flow [2025-02-06 18:56:20,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:56:20,496 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;@2e836f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:56:20,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:56:20,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:56:20,503 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-06 18:56:20,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:20,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:20,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:56:20,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:20,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:20,510 INFO L85 PathProgramCache]: Analyzing trace with hash 5921487, now seen corresponding path program 1 times [2025-02-06 18:56:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611515313] [2025-02-06 18:56:20,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:20,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:56:20,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:56:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:20,706 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:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611515313] [2025-02-06 18:56:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611515313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789169155] [2025-02-06 18:56:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:20,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:20,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:20,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-06 18:56:20,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:20,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:20,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-06 18:56:20,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:20,868 INFO L124 PetriNetUnfolderBase]: 126/266 cut-off events. [2025-02-06 18:56:20,871 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:56:20,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 266 events. 126/266 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1173 event pairs, 92 based on Foata normal form. 10/247 useless extension candidates. Maximal degree in co-relation 476. Up to 187 conditions per place. [2025-02-06 18:56:20,879 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-06 18:56:20,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 125 flow [2025-02-06 18:56:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-06 18:56:20,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 18:56:20,890 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 53 flow. Second operand 4 states and 60 transitions. [2025-02-06 18:56:20,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 125 flow [2025-02-06 18:56:20,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:20,895 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 74 flow [2025-02-06 18:56:20,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2025-02-06 18:56:20,899 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-02-06 18:56:20,900 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 74 flow [2025-02-06 18:56:20,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:20,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:20,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:20,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:56:20,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:20,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash 302645565, now seen corresponding path program 1 times [2025-02-06 18:56:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095129383] [2025-02-06 18:56:20,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:20,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:20,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:20,968 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:20,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:20,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095129383] [2025-02-06 18:56:20,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095129383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:20,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:20,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:56:20,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607344234] [2025-02-06 18:56:20,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:20,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:20,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:20,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:20,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-06 18:56:20,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:20,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:20,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-06 18:56:20,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:21,056 INFO L124 PetriNetUnfolderBase]: 102/241 cut-off events. [2025-02-06 18:56:21,057 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 18:56:21,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 241 events. 102/241 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 970 event pairs, 8 based on Foata normal form. 9/249 useless extension candidates. Maximal degree in co-relation 485. Up to 136 conditions per place. [2025-02-06 18:56:21,061 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-02-06 18:56:21,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 172 flow [2025-02-06 18:56:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-06 18:56:21,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 18:56:21,063 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 74 flow. Second operand 4 states and 60 transitions. [2025-02-06 18:56:21,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 172 flow [2025-02-06 18:56:21,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:21,066 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 74 flow [2025-02-06 18:56:21,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-02-06 18:56:21,067 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-02-06 18:56:21,067 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 74 flow [2025-02-06 18:56:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:21,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:21,068 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:56:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:56:21,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 313494426, now seen corresponding path program 1 times [2025-02-06 18:56:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392867131] [2025-02-06 18:56:21,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:21,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:21,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392867131] [2025-02-06 18:56:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392867131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284335323] [2025-02-06 18:56:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:21,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:21,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:21,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:21,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2025-02-06 18:56:21,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:21,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:21,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2025-02-06 18:56:21,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:21,252 INFO L124 PetriNetUnfolderBase]: 101/234 cut-off events. [2025-02-06 18:56:21,252 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 18:56:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 234 events. 101/234 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 940 event pairs, 20 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 495. Up to 136 conditions per place. [2025-02-06 18:56:21,256 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 19 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2025-02-06 18:56:21,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 132 flow [2025-02-06 18:56:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-06 18:56:21,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-02-06 18:56:21,258 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 74 flow. Second operand 4 states and 61 transitions. [2025-02-06 18:56:21,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 132 flow [2025-02-06 18:56:21,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:56:21,260 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 78 flow [2025-02-06 18:56:21,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2025-02-06 18:56:21,261 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2025-02-06 18:56:21,262 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 78 flow [2025-02-06 18:56:21,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:21,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:21,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:21,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:56:21,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:21,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 977820363, now seen corresponding path program 1 times [2025-02-06 18:56:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:21,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570875685] [2025-02-06 18:56:21,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:21,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:56:21,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:56:21,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:21,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:56:21,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:56:21,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:56:21,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:56:21,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:21,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:56:21,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:56:21,311 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:56:21,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 18:56:21,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 18:56:21,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 18:56:21,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 18:56:21,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 18:56:21,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-06 18:56:21,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:56:21,315 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 18:56:21,317 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:56:21,317 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:56:21,339 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:56:21,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 86 flow [2025-02-06 18:56:21,346 INFO L124 PetriNetUnfolderBase]: 3/54 cut-off events. [2025-02-06 18:56:21,346 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:56:21,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 54 events. 3/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 49. Up to 6 conditions per place. [2025-02-06 18:56:21,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 86 flow [2025-02-06 18:56:21,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 80 flow [2025-02-06 18:56:21,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:56:21,347 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;@2e836f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:56:21,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:56:21,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:56:21,351 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-06 18:56:21,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:21,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:21,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:56:21,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:21,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash 6937359, now seen corresponding path program 1 times [2025-02-06 18:56:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536828207] [2025-02-06 18:56:21,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:21,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:56:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:56:21,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:21,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:21,404 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:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:21,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536828207] [2025-02-06 18:56:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536828207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:21,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595198448] [2025-02-06 18:56:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:21,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:21,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:21,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:21,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:21,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-06 18:56:21,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:21,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:21,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-06 18:56:21,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:21,732 INFO L124 PetriNetUnfolderBase]: 2403/3697 cut-off events. [2025-02-06 18:56:21,732 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-06 18:56:21,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7190 conditions, 3697 events. 2403/3697 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21041 event pairs, 1856 based on Foata normal form. 91/3534 useless extension candidates. Maximal degree in co-relation 1960. Up to 2734 conditions per place. [2025-02-06 18:56:21,751 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-02-06 18:56:21,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 196 flow [2025-02-06 18:56:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-06 18:56:21,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-02-06 18:56:21,752 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 80 flow. Second operand 4 states and 82 transitions. [2025-02-06 18:56:21,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 196 flow [2025-02-06 18:56:21,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:21,754 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 101 flow [2025-02-06 18:56:21,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-02-06 18:56:21,754 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-02-06 18:56:21,754 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 101 flow [2025-02-06 18:56:21,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:21,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:21,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:21,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:56:21,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:21,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 508220427, now seen corresponding path program 1 times [2025-02-06 18:56:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:21,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505511546] [2025-02-06 18:56:21,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:21,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:21,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:21,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:21,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:21,784 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:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505511546] [2025-02-06 18:56:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505511546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:21,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:21,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:56:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363832536] [2025-02-06 18:56:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:21,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:21,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:21,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:21,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-06 18:56:21,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:21,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:21,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-06 18:56:21,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:22,043 INFO L124 PetriNetUnfolderBase]: 2379/3724 cut-off events. [2025-02-06 18:56:22,044 INFO L125 PetriNetUnfolderBase]: For 508/535 co-relation queries the response was YES. [2025-02-06 18:56:22,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 3724 events. 2379/3724 cut-off events. For 508/535 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21449 event pairs, 1052 based on Foata normal form. 9/3642 useless extension candidates. Maximal degree in co-relation 4906. Up to 3277 conditions per place. [2025-02-06 18:56:22,064 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 38 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-02-06 18:56:22,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 231 flow [2025-02-06 18:56:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-06 18:56:22,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5984848484848485 [2025-02-06 18:56:22,065 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 101 flow. Second operand 4 states and 79 transitions. [2025-02-06 18:56:22,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 231 flow [2025-02-06 18:56:22,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:22,075 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 121 flow [2025-02-06 18:56:22,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-02-06 18:56:22,075 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-02-06 18:56:22,075 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 121 flow [2025-02-06 18:56:22,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:22,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:22,076 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:56:22,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:56:22,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:22,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 512598875, now seen corresponding path program 1 times [2025-02-06 18:56:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114704561] [2025-02-06 18:56:22,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:22,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114704561] [2025-02-06 18:56:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114704561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944888701] [2025-02-06 18:56:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:22,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:22,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:22,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-02-06 18:56:22,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:22,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:22,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-02-06 18:56:22,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:22,357 INFO L124 PetriNetUnfolderBase]: 1946/3233 cut-off events. [2025-02-06 18:56:22,358 INFO L125 PetriNetUnfolderBase]: For 564/618 co-relation queries the response was YES. [2025-02-06 18:56:22,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3233 events. 1946/3233 cut-off events. For 564/618 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 19328 event pairs, 848 based on Foata normal form. 1/3222 useless extension candidates. Maximal degree in co-relation 4136. Up to 2683 conditions per place. [2025-02-06 18:56:22,377 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 28 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2025-02-06 18:56:22,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 199 flow [2025-02-06 18:56:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-06 18:56:22,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-02-06 18:56:22,380 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 121 flow. Second operand 4 states and 78 transitions. [2025-02-06 18:56:22,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 199 flow [2025-02-06 18:56:22,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:22,387 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 129 flow [2025-02-06 18:56:22,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-02-06 18:56:22,389 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-06 18:56:22,390 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 129 flow [2025-02-06 18:56:22,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:22,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:22,390 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:56:22,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:22,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash -597634429, now seen corresponding path program 1 times [2025-02-06 18:56:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:22,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785375030] [2025-02-06 18:56:22,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:22,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:56:22,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:56:22,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785375030] [2025-02-06 18:56:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785375030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084944076] [2025-02-06 18:56:22,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:22,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:22,475 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:22,479 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:22,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:56:22,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:56:22,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:22,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:22,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:56:22,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:22,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:56:22,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084944076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:22,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:56:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 18:56:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446843591] [2025-02-06 18:56:22,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:22,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:22,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:22,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:56:22,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-06 18:56:22,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:22,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:22,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-06 18:56:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:22,892 INFO L124 PetriNetUnfolderBase]: 2174/3406 cut-off events. [2025-02-06 18:56:22,892 INFO L125 PetriNetUnfolderBase]: For 705/741 co-relation queries the response was YES. [2025-02-06 18:56:22,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 3406 events. 2174/3406 cut-off events. For 705/741 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19258 event pairs, 944 based on Foata normal form. 90/3394 useless extension candidates. Maximal degree in co-relation 4125. Up to 1367 conditions per place. [2025-02-06 18:56:22,917 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 52 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-02-06 18:56:22,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 303 flow [2025-02-06 18:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-02-06 18:56:22,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-02-06 18:56:22,937 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 129 flow. Second operand 6 states and 116 transitions. [2025-02-06 18:56:22,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 303 flow [2025-02-06 18:56:22,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 297 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 18:56:22,943 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 129 flow [2025-02-06 18:56:22,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-02-06 18:56:22,944 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-06 18:56:22,944 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 129 flow [2025-02-06 18:56:22,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:56:22,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:22,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:22,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:56:23,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:23,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:23,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -601088395, now seen corresponding path program 1 times [2025-02-06 18:56:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:23,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67603225] [2025-02-06 18:56:23,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:23,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:56:23,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:56:23,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:23,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:23,227 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:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67603225] [2025-02-06 18:56:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67603225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:56:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999034516] [2025-02-06 18:56:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:23,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:23,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:23,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:56:23,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-06 18:56:23,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:23,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:23,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-06 18:56:23,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:23,527 INFO L124 PetriNetUnfolderBase]: 2162/3388 cut-off events. [2025-02-06 18:56:23,527 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2025-02-06 18:56:23,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7963 conditions, 3388 events. 2162/3388 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19178 event pairs, 728 based on Foata normal form. 81/3378 useless extension candidates. Maximal degree in co-relation 4802. Up to 2385 conditions per place. [2025-02-06 18:56:23,546 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 38 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-02-06 18:56:23,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 247 flow [2025-02-06 18:56:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-02-06 18:56:23,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-06 18:56:23,552 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 129 flow. Second operand 6 states and 102 transitions. [2025-02-06 18:56:23,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 247 flow [2025-02-06 18:56:23,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 233 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-06 18:56:23,561 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 121 flow [2025-02-06 18:56:23,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2025-02-06 18:56:23,562 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-02-06 18:56:23,562 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 121 flow [2025-02-06 18:56:23,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:23,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:23,562 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:56:23,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1453870881, now seen corresponding path program 1 times [2025-02-06 18:56:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220726342] [2025-02-06 18:56:23,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:23,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:23,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:56:23,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:56:23,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:23,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:23,629 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:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220726342] [2025-02-06 18:56:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220726342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:23,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:23,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:56:23,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251043432] [2025-02-06 18:56:23,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:23,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:23,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:23,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:56:23,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-06 18:56:23,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:23,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:23,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-06 18:56:23,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:23,893 INFO L124 PetriNetUnfolderBase]: 1946/3199 cut-off events. [2025-02-06 18:56:23,893 INFO L125 PetriNetUnfolderBase]: For 1066/1066 co-relation queries the response was YES. [2025-02-06 18:56:23,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 3199 events. 1946/3199 cut-off events. For 1066/1066 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18485 event pairs, 80 based on Foata normal form. 81/3270 useless extension candidates. Maximal degree in co-relation 4155. Up to 1864 conditions per place. [2025-02-06 18:56:23,907 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 51 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-02-06 18:56:23,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 303 flow [2025-02-06 18:56:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-02-06 18:56:23,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2025-02-06 18:56:23,908 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 121 flow. Second operand 6 states and 113 transitions. [2025-02-06 18:56:23,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 303 flow [2025-02-06 18:56:23,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 290 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-02-06 18:56:23,912 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 114 flow [2025-02-06 18:56:23,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2025-02-06 18:56:23,912 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-02-06 18:56:23,912 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 114 flow [2025-02-06 18:56:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:23,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:23,913 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:23,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:56:23,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:23,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1346797949, now seen corresponding path program 1 times [2025-02-06 18:56:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:23,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585276112] [2025-02-06 18:56:23,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:23,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:56:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:56:23,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:23,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585276112] [2025-02-06 18:56:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585276112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424313101] [2025-02-06 18:56:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:23,963 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:23,964 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:24,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:56:24,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:56:24,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:24,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:24,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:56:24,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:24,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:56:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424313101] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:56:24,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:56:24,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:56:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295582676] [2025-02-06 18:56:24,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:56:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:56:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:24,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:56:24,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:56:24,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-06 18:56:24,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 114 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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:24,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:24,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-06 18:56:24,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:24,486 INFO L124 PetriNetUnfolderBase]: 3542/5512 cut-off events. [2025-02-06 18:56:24,486 INFO L125 PetriNetUnfolderBase]: For 2139/2139 co-relation queries the response was YES. [2025-02-06 18:56:24,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12041 conditions, 5512 events. 3542/5512 cut-off events. For 2139/2139 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 31352 event pairs, 1628 based on Foata normal form. 270/5770 useless extension candidates. Maximal degree in co-relation 4053. Up to 2411 conditions per place. [2025-02-06 18:56:24,509 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 86 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2025-02-06 18:56:24,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 456 flow [2025-02-06 18:56:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:56:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:56:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2025-02-06 18:56:24,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2025-02-06 18:56:24,511 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 114 flow. Second operand 10 states and 196 transitions. [2025-02-06 18:56:24,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 456 flow [2025-02-06 18:56:24,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 445 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:56:24,514 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 161 flow [2025-02-06 18:56:24,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2025-02-06 18:56:24,514 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-02-06 18:56:24,514 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 161 flow [2025-02-06 18:56:24,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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:24,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:24,514 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:24,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:56:24,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:24,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:24,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1305537893, now seen corresponding path program 1 times [2025-02-06 18:56:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:24,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350295915] [2025-02-06 18:56:24,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:24,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:56:24,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:56:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:56:24,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:56:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:56:24,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:56:24,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:24,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:56:24,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:56:24,737 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:56:24,737 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 18:56:24,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 18:56:24,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 18:56:24,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 18:56:24,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 18:56:24,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-06 18:56:24,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:56:24,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:24,740 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:56:24,740 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:56:24,755 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:56:24,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 118 flow [2025-02-06 18:56:24,762 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-02-06 18:56:24,763 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 18:56:24,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 76 events. 4/76 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2025-02-06 18:56:24,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 118 flow [2025-02-06 18:56:24,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 111 flow [2025-02-06 18:56:24,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:56:24,768 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;@2e836f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:56:24,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:56:24,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:56:24,769 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-06 18:56:24,769 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:24,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:24,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:56:24,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash 8199503, now seen corresponding path program 1 times [2025-02-06 18:56:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429047874] [2025-02-06 18:56:24,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:24,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:56:24,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:56:24,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:24,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:24,801 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:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429047874] [2025-02-06 18:56:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429047874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277388990] [2025-02-06 18:56:24,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:24,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:24,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:24,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:24,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:24,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:24,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:24,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:27,298 INFO L124 PetriNetUnfolderBase]: 33264/44890 cut-off events. [2025-02-06 18:56:27,298 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2025-02-06 18:56:27,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88318 conditions, 44890 events. 33264/44890 cut-off events. For 2383/2383 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 277493 event pairs, 26156 based on Foata normal form. 820/43431 useless extension candidates. Maximal degree in co-relation 25546. Up to 34081 conditions per place. [2025-02-06 18:56:27,517 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 51 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-02-06 18:56:27,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 271 flow [2025-02-06 18:56:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-06 18:56:27,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-02-06 18:56:27,519 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 111 flow. Second operand 4 states and 104 transitions. [2025-02-06 18:56:27,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 271 flow [2025-02-06 18:56:27,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 266 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:27,526 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 128 flow [2025-02-06 18:56:27,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-02-06 18:56:27,527 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-02-06 18:56:27,527 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 128 flow [2025-02-06 18:56:27,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:27,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:27,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:27,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:56:27,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:27,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -539442207, now seen corresponding path program 1 times [2025-02-06 18:56:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965796027] [2025-02-06 18:56:27,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:27,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:27,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:27,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:27,552 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:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:27,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965796027] [2025-02-06 18:56:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965796027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:56:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989895778] [2025-02-06 18:56:27,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:27,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:27,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:27,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:27,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:27,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 128 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:27,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:27,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:27,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:29,507 INFO L124 PetriNetUnfolderBase]: 33240/44494 cut-off events. [2025-02-06 18:56:29,507 INFO L125 PetriNetUnfolderBase]: For 6295/6808 co-relation queries the response was YES. [2025-02-06 18:56:29,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94072 conditions, 44494 events. 33240/44494 cut-off events. For 6295/6808 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 267936 event pairs, 20816 based on Foata normal form. 9/43422 useless extension candidates. Maximal degree in co-relation 61390. Up to 41914 conditions per place. [2025-02-06 18:56:29,787 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 44 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-02-06 18:56:29,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 270 flow [2025-02-06 18:56:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 18:56:29,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-02-06 18:56:29,788 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 128 flow. Second operand 4 states and 93 transitions. [2025-02-06 18:56:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 270 flow [2025-02-06 18:56:29,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:29,942 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 148 flow [2025-02-06 18:56:29,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2025-02-06 18:56:29,943 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-02-06 18:56:29,943 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 148 flow [2025-02-06 18:56:29,943 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:29,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:29,943 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:56:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:56:29,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:29,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -541534172, now seen corresponding path program 1 times [2025-02-06 18:56:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:29,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445176334] [2025-02-06 18:56:29,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:29,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:56:29,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:56:29,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:29,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:56:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445176334] [2025-02-06 18:56:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445176334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051940978] [2025-02-06 18:56:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:29,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-02-06 18:56:29,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:29,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:29,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-02-06 18:56:29,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:31,949 INFO L124 PetriNetUnfolderBase]: 26975/37361 cut-off events. [2025-02-06 18:56:31,949 INFO L125 PetriNetUnfolderBase]: For 6513/7539 co-relation queries the response was YES. [2025-02-06 18:56:32,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80639 conditions, 37361 events. 26975/37361 cut-off events. For 6513/7539 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 234796 event pairs, 16724 based on Foata normal form. 1/37109 useless extension candidates. Maximal degree in co-relation 48794. Up to 34030 conditions per place. [2025-02-06 18:56:32,150 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 34 selfloop transitions, 2 changer transitions 1/50 dead transitions. [2025-02-06 18:56:32,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 238 flow [2025-02-06 18:56:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:56:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:56:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 18:56:32,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-02-06 18:56:32,151 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 148 flow. Second operand 4 states and 92 transitions. [2025-02-06 18:56:32,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 238 flow [2025-02-06 18:56:32,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:56:32,235 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 156 flow [2025-02-06 18:56:32,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-02-06 18:56:32,235 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-02-06 18:56:32,236 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 156 flow [2025-02-06 18:56:32,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:32,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:32,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:56:32,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:32,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2105623882, now seen corresponding path program 1 times [2025-02-06 18:56:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203165048] [2025-02-06 18:56:32,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:32,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:56:32,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:56:32,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:32,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:32,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203165048] [2025-02-06 18:56:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203165048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851195293] [2025-02-06 18:56:32,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:32,278 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,279 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,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:56:32,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:56:32,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:32,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:32,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:56:32,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:32,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:56:32,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851195293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:32,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:56:32,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 18:56:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525277182] [2025-02-06 18:56:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:32,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:32,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:32,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:56:32,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:32,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:32,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:32,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:34,435 INFO L124 PetriNetUnfolderBase]: 30119/41359 cut-off events. [2025-02-06 18:56:34,435 INFO L125 PetriNetUnfolderBase]: For 6951/7473 co-relation queries the response was YES. [2025-02-06 18:56:34,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90257 conditions, 41359 events. 30119/41359 cut-off events. For 6951/7473 co-relation queries the response was YES. Maximal size of possible extension queue 1422. Compared 261270 event pairs, 13580 based on Foata normal form. 819/41106 useless extension candidates. Maximal degree in co-relation 49530. Up to 17405 conditions per place. [2025-02-06 18:56:34,743 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 74 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-02-06 18:56:34,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 406 flow [2025-02-06 18:56:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-02-06 18:56:34,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-02-06 18:56:34,745 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 156 flow. Second operand 6 states and 150 transitions. [2025-02-06 18:56:34,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 406 flow [2025-02-06 18:56:34,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 400 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 18:56:35,000 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 156 flow [2025-02-06 18:56:35,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-02-06 18:56:35,001 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-02-06 18:56:35,001 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 156 flow [2025-02-06 18:56:35,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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:35,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:35,001 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:35,007 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:35,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:35,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:35,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2102607435, now seen corresponding path program 1 times [2025-02-06 18:56:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183360682] [2025-02-06 18:56:35,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:35,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:56:35,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:56:35,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:35,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:35,250 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:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:35,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183360682] [2025-02-06 18:56:35,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183360682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:35,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:35,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:56:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771465141] [2025-02-06 18:56:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:35,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:35,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:35,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:35,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:56:35,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:35,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:35,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:35,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:35,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:37,504 INFO L124 PetriNetUnfolderBase]: 30107/40594 cut-off events. [2025-02-06 18:56:37,505 INFO L125 PetriNetUnfolderBase]: For 15414/15495 co-relation queries the response was YES. [2025-02-06 18:56:37,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92394 conditions, 40594 events. 30107/40594 cut-off events. For 15414/15495 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 245232 event pairs, 14660 based on Foata normal form. 810/40503 useless extension candidates. Maximal degree in co-relation 58046. Up to 30087 conditions per place. [2025-02-06 18:56:37,737 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2025-02-06 18:56:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 302 flow [2025-02-06 18:56:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-02-06 18:56:37,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2025-02-06 18:56:37,739 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 156 flow. Second operand 6 states and 124 transitions. [2025-02-06 18:56:37,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 302 flow [2025-02-06 18:56:37,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 288 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-06 18:56:37,860 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 148 flow [2025-02-06 18:56:37,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-02-06 18:56:37,861 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2025-02-06 18:56:37,861 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 148 flow [2025-02-06 18:56:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:37,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:37,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:37,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:56:37,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:37,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash -756320824, now seen corresponding path program 1 times [2025-02-06 18:56:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410655851] [2025-02-06 18:56:37,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:37,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:56:37,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:56:37,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:37,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:37,895 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:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410655851] [2025-02-06 18:56:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410655851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:37,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:37,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:56:37,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88729204] [2025-02-06 18:56:37,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:37,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:56:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:37,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:56:37,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:56:37,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:37,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:37,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:37,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:37,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:39,862 INFO L124 PetriNetUnfolderBase]: 29891/40777 cut-off events. [2025-02-06 18:56:39,862 INFO L125 PetriNetUnfolderBase]: For 10822/10822 co-relation queries the response was YES. [2025-02-06 18:56:39,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88293 conditions, 40777 events. 29891/40777 cut-off events. For 10822/10822 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 251799 event pairs, 8504 based on Foata normal form. 81/40767 useless extension candidates. Maximal degree in co-relation 57285. Up to 36856 conditions per place. [2025-02-06 18:56:40,075 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 61 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-02-06 18:56:40,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 368 flow [2025-02-06 18:56:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:56:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:56:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-02-06 18:56:40,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2025-02-06 18:56:40,076 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 148 flow. Second operand 6 states and 135 transitions. [2025-02-06 18:56:40,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 368 flow [2025-02-06 18:56:40,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 357 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 18:56:40,145 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 169 flow [2025-02-06 18:56:40,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-02-06 18:56:40,146 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-06 18:56:40,146 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 169 flow [2025-02-06 18:56:40,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:40,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:40,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:40,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:56:40,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:40,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash -849830695, now seen corresponding path program 1 times [2025-02-06 18:56:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523455654] [2025-02-06 18:56:40,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:40,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:40,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:56:40,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:56:40,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:40,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523455654] [2025-02-06 18:56:40,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523455654] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:56:40,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565891166] [2025-02-06 18:56:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:56:40,189 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:40,191 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:40,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:56:40,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:56:40,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:40,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:56:40,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:56:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:40,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:56:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:56:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565891166] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:56:40,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:56:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:56:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890988364] [2025-02-06 18:56:40,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:56:40,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:56:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:40,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:56:40,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:56:40,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:40,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 169 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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:40,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:40,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:40,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:43,936 INFO L124 PetriNetUnfolderBase]: 48983/67198 cut-off events. [2025-02-06 18:56:43,937 INFO L125 PetriNetUnfolderBase]: For 23323/23566 co-relation queries the response was YES. [2025-02-06 18:56:44,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144859 conditions, 67198 events. 48983/67198 cut-off events. For 23323/23566 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 431084 event pairs, 23012 based on Foata normal form. 2457/69564 useless extension candidates. Maximal degree in co-relation 50844. Up to 30113 conditions per place. [2025-02-06 18:56:44,285 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 126 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-02-06 18:56:44,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 145 transitions, 655 flow [2025-02-06 18:56:44,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:56:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:56:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-02-06 18:56:44,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2025-02-06 18:56:44,290 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 169 flow. Second operand 10 states and 254 transitions. [2025-02-06 18:56:44,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 145 transitions, 655 flow [2025-02-06 18:56:44,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 145 transitions, 647 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 18:56:44,384 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 219 flow [2025-02-06 18:56:44,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=219, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2025-02-06 18:56:44,385 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-02-06 18:56:44,385 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 219 flow [2025-02-06 18:56:44,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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:44,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:44,385 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:44,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:56:44,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:56:44,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1590930586, now seen corresponding path program 1 times [2025-02-06 18:56:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254555868] [2025-02-06 18:56:44,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:44,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:56:44,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:56:44,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:44,647 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:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254555868] [2025-02-06 18:56:44,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254555868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:44,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:44,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:56:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571597586] [2025-02-06 18:56:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:44,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:56:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:44,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:56:44,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:56:44,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-06 18:56:44,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 219 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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:44,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:44,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-06 18:56:44,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:56:47,775 INFO L124 PetriNetUnfolderBase]: 45839/64588 cut-off events. [2025-02-06 18:56:47,775 INFO L125 PetriNetUnfolderBase]: For 39390/39390 co-relation queries the response was YES. [2025-02-06 18:56:48,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151392 conditions, 64588 events. 45839/64588 cut-off events. For 39390/39390 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 426111 event pairs, 728 based on Foata normal form. 729/65226 useless extension candidates. Maximal degree in co-relation 112856. Up to 44470 conditions per place. [2025-02-06 18:56:48,382 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 106 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-02-06 18:56:48,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 689 flow [2025-02-06 18:56:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:56:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:56:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-02-06 18:56:48,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-02-06 18:56:48,383 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 219 flow. Second operand 8 states and 186 transitions. [2025-02-06 18:56:48,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 689 flow [2025-02-06 18:56:48,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 655 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-02-06 18:56:48,853 INFO L231 Difference]: Finished difference. Result has 78 places, 48 transitions, 213 flow [2025-02-06 18:56:48,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=78, PETRI_TRANSITIONS=48} [2025-02-06 18:56:48,854 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-02-06 18:56:48,854 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 48 transitions, 213 flow [2025-02-06 18:56:48,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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:48,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:48,854 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:48,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:56:48,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:48,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -124055363, now seen corresponding path program 1 times [2025-02-06 18:56:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685817587] [2025-02-06 18:56:48,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:48,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:56:48,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:56:48,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:56:48,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:56:48,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:56:48,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:56:48,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:56:48,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:56:48,868 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:56:48,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 18:56:48,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 18:56:48,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 18:56:48,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 18:56:48,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 18:56:48,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-06 18:56:48,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:56:48,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:56:48,869 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:56:48,869 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 18:56:48,882 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:56:48,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 154 flow [2025-02-06 18:56:48,886 INFO L124 PetriNetUnfolderBase]: 5/98 cut-off events. [2025-02-06 18:56:48,886 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 18:56:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 98 events. 5/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 174 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 111. Up to 10 conditions per place. [2025-02-06 18:56:48,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 49 transitions, 154 flow [2025-02-06 18:56:48,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 47 transitions, 146 flow [2025-02-06 18:56:48,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:56:48,887 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;@2e836f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:56:48,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:56:48,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:56:48,888 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-06 18:56:48,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:56:48,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:56:48,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:56:48,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:56:48,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:56:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 9707919, now seen corresponding path program 1 times [2025-02-06 18:56:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:56:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910121226] [2025-02-06 18:56:48,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:56:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:56:48,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:56:48,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:56:48,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:56:48,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:56:48,903 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:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:56:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910121226] [2025-02-06 18:56:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910121226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:56:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:56:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:56:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547204950] [2025-02-06 18:56:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:56:48,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:56:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:56:48,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:56:48,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:56:48,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 18:56:48,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:48,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:56:48,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 18:56:48,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand