./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-08 14:15:30,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:15:30,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:15:30,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:15:30,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:15:30,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:15:30,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:15:30,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:15:30,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:15:30,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:15:30,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:15:30,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:15:30,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:15:30,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:15:30,503 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:15:30,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:15:30,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:15:30,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:15:30,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:15:30,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:15:30,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:15:30,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:15:30,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:15:30,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:15:30,505 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:15:30,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:15:30,506 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-08 14:15:30,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:15:30,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:15:30,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:15:30,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:15:30,766 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:15:30,769 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-08 14:15:32,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90bd2dfe6/7e0550da4342446ca07c7f3a8f8a2ba5/FLAG766cc20ce [2025-02-08 14:15:32,370 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:15:32,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-nondet.i [2025-02-08 14:15:32,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90bd2dfe6/7e0550da4342446ca07c7f3a8f8a2ba5/FLAG766cc20ce [2025-02-08 14:15:32,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90bd2dfe6/7e0550da4342446ca07c7f3a8f8a2ba5 [2025-02-08 14:15:32,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:15:32,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:15:32,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:15:32,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:15:32,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:15:32,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32, skipping insertion in model container [2025-02-08 14:15:32,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:15:32,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:15:32,705 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:15:32,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:15:32,785 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:15:32,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32 WrapperNode [2025-02-08 14:15:32,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:15:32,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:15:32,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:15:32,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:15:32,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,826 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2025-02-08 14:15:32,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:15:32,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:15:32,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:15:32,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:15:32,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,853 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-08 14:15:32,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:15:32,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:15:32,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:15:32,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:15:32,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (1/1) ... [2025-02-08 14:15:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:15:32,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:15:32,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:15:32,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-08 14:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-08 14:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-08 14:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-08 14:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:15:32,922 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:15:33,044 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:15:33,047 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:15:33,258 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:15:33,259 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:15:33,405 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:15:33,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:15:33,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:15:33 BoogieIcfgContainer [2025-02-08 14:15:33,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:15:33,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:15:33,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:15:33,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:15:33,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:15:32" (1/3) ... [2025-02-08 14:15:33,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25256ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:15:33, skipping insertion in model container [2025-02-08 14:15:33,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:15:32" (2/3) ... [2025-02-08 14:15:33,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25256ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:15:33, skipping insertion in model container [2025-02-08 14:15:33,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:15:33" (3/3) ... [2025-02-08 14:15:33,416 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-nondet.i [2025-02-08 14:15:33,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:15:33,431 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-08 14:15:33,431 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:15:33,480 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:15:33,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2025-02-08 14:15:33,543 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-02-08 14:15:33,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:15:33,550 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-08 14:15:33,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 58 flow [2025-02-08 14:15:33,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 53 flow [2025-02-08 14:15:33,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:15:33,580 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;@104fd96e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:15:33,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 14:15:33,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:15:33,585 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-08 14:15:33,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:15:33,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:33,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:15:33,586 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-08 14:15:33,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash 5859919, now seen corresponding path program 1 times [2025-02-08 14:15:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913446082] [2025-02-08 14:15:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:33,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:15:33,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:15:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913446082] [2025-02-08 14:15:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913446082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:33,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:33,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:15:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639440497] [2025-02-08 14:15:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:33,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:33,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:33,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:33,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-08 14:15:33,898 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-08 14:15:33,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:33,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-08 14:15:33,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:34,046 INFO L124 PetriNetUnfolderBase]: 126/266 cut-off events. [2025-02-08 14:15:34,046 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:15:34,048 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-08 14:15:34,051 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-08 14:15:34,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 125 flow [2025-02-08 14:15:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-08 14:15:34,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 14:15:34,063 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 53 flow. Second operand 4 states and 60 transitions. [2025-02-08 14:15:34,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 125 flow [2025-02-08 14:15:34,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:34,070 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 74 flow [2025-02-08 14:15:34,072 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-08 14:15:34,077 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-02-08 14:15:34,077 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 74 flow [2025-02-08 14:15:34,078 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-08 14:15:34,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:34,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:15:34,079 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-08 14:15:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1531528709, now seen corresponding path program 1 times [2025-02-08 14:15:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338931779] [2025-02-08 14:15:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:34,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:15:34,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:15:34,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:34,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338931779] [2025-02-08 14:15:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338931779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:15:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342259257] [2025-02-08 14:15:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:34,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:34,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:34,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:34,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-02-08 14:15:34,198 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-08 14:15:34,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:34,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-02-08 14:15:34,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:34,306 INFO L124 PetriNetUnfolderBase]: 102/241 cut-off events. [2025-02-08 14:15:34,313 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 14:15:34,315 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-08 14:15:34,316 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-02-08 14:15:34,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 172 flow [2025-02-08 14:15:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-08 14:15:34,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 14:15:34,320 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 74 flow. Second operand 4 states and 60 transitions. [2025-02-08 14:15:34,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 172 flow [2025-02-08 14:15:34,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:34,324 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 74 flow [2025-02-08 14:15:34,325 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-08 14:15:34,325 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-02-08 14:15:34,325 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 74 flow [2025-02-08 14:15:34,325 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-08 14:15:34,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:34,326 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 14:15:34,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:15:34,326 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-08 14:15:34,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1520679848, now seen corresponding path program 1 times [2025-02-08 14:15:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647173020] [2025-02-08 14:15:34,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:34,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:15:34,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:15:34,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:34,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:34,412 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-08 14:15:34,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:34,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647173020] [2025-02-08 14:15:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647173020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:15:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768697639] [2025-02-08 14:15:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:34,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:34,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:34,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:34,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2025-02-08 14:15:34,414 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-08 14:15:34,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:34,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2025-02-08 14:15:34,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:34,494 INFO L124 PetriNetUnfolderBase]: 101/234 cut-off events. [2025-02-08 14:15:34,494 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 14:15:34,495 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-08 14:15:34,496 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 19 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2025-02-08 14:15:34,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 132 flow [2025-02-08 14:15:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-08 14:15:34,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-02-08 14:15:34,500 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 74 flow. Second operand 4 states and 61 transitions. [2025-02-08 14:15:34,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 132 flow [2025-02-08 14:15:34,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:15:34,502 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 78 flow [2025-02-08 14:15:34,502 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-08 14:15:34,504 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2025-02-08 14:15:34,504 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 78 flow [2025-02-08 14:15:34,505 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-08 14:15:34,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:34,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:15:34,505 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-08 14:15:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -334038645, now seen corresponding path program 1 times [2025-02-08 14:15:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112648348] [2025-02-08 14:15:34,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:34,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:15:34,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:15:34,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:34,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:15:34,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:15:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:15:34,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:15:34,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:34,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:15:34,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:15:34,558 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:15:34,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 14:15:34,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 14:15:34,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 14:15:34,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 14:15:34,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 14:15:34,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-08 14:15:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:15:34,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 14:15:34,564 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:15:34,566 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:15:34,591 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:15:34,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 86 flow [2025-02-08 14:15:34,605 INFO L124 PetriNetUnfolderBase]: 3/54 cut-off events. [2025-02-08 14:15:34,606 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:15:34,607 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-08 14:15:34,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 86 flow [2025-02-08 14:15:34,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 80 flow [2025-02-08 14:15:34,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:15:34,610 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;@104fd96e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:15:34,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 14:15:34,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:15:34,615 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-08 14:15:34,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:15:34,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:34,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:15:34,615 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-08 14:15:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 6875791, now seen corresponding path program 1 times [2025-02-08 14:15:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018323194] [2025-02-08 14:15:34,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:34,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:15:34,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:15:34,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:34,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018323194] [2025-02-08 14:15:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018323194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:34,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:15:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670623759] [2025-02-08 14:15:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:34,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:34,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:34,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-08 14:15:34,686 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-08 14:15:34,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:34,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-08 14:15:34,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:35,091 INFO L124 PetriNetUnfolderBase]: 2403/3697 cut-off events. [2025-02-08 14:15:35,091 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-08 14:15:35,102 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-08 14:15:35,123 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-02-08 14:15:35,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 196 flow [2025-02-08 14:15:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-08 14:15:35,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-02-08 14:15:35,128 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 80 flow. Second operand 4 states and 82 transitions. [2025-02-08 14:15:35,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 196 flow [2025-02-08 14:15:35,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:35,131 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 101 flow [2025-02-08 14:15:35,131 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-08 14:15:35,132 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-02-08 14:15:35,132 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 101 flow [2025-02-08 14:15:35,132 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-08 14:15:35,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:35,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:35,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:15:35,133 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-08 14:15:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1325953847, now seen corresponding path program 1 times [2025-02-08 14:15:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360424457] [2025-02-08 14:15:35,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:35,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:15:35,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:15:35,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:35,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360424457] [2025-02-08 14:15:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360424457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:35,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:15:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205959970] [2025-02-08 14:15:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:35,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:35,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:35,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:35,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-08 14:15:35,189 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-08 14:15:35,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:35,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-08 14:15:35,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:35,539 INFO L124 PetriNetUnfolderBase]: 2379/3724 cut-off events. [2025-02-08 14:15:35,540 INFO L125 PetriNetUnfolderBase]: For 508/535 co-relation queries the response was YES. [2025-02-08 14:15:35,545 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-08 14:15:35,564 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 38 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-02-08 14:15:35,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 231 flow [2025-02-08 14:15:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-08 14:15:35,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5984848484848485 [2025-02-08 14:15:35,567 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 101 flow. Second operand 4 states and 79 transitions. [2025-02-08 14:15:35,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 231 flow [2025-02-08 14:15:35,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:35,581 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 121 flow [2025-02-08 14:15:35,582 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-08 14:15:35,583 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-02-08 14:15:35,583 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 121 flow [2025-02-08 14:15:35,583 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-08 14:15:35,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:35,583 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 14:15:35,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:15:35,583 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-08 14:15:35,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1321575399, now seen corresponding path program 1 times [2025-02-08 14:15:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509384048] [2025-02-08 14:15:35,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:35,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:15:35,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:15:35,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:35,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:35,661 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-08 14:15:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509384048] [2025-02-08 14:15:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509384048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:15:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637625362] [2025-02-08 14:15:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:35,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:35,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:35,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-02-08 14:15:35,666 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-08 14:15:35,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:35,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-02-08 14:15:35,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:36,002 INFO L124 PetriNetUnfolderBase]: 1946/3233 cut-off events. [2025-02-08 14:15:36,003 INFO L125 PetriNetUnfolderBase]: For 564/618 co-relation queries the response was YES. [2025-02-08 14:15:36,010 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-08 14:15:36,028 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 28 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2025-02-08 14:15:36,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 199 flow [2025-02-08 14:15:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-08 14:15:36,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-02-08 14:15:36,032 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 121 flow. Second operand 4 states and 78 transitions. [2025-02-08 14:15:36,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 199 flow [2025-02-08 14:15:36,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:36,040 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 129 flow [2025-02-08 14:15:36,040 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-08 14:15:36,041 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-08 14:15:36,042 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 129 flow [2025-02-08 14:15:36,042 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-08 14:15:36,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:36,043 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:36,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:15:36,043 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-08 14:15:36,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1270800189, now seen corresponding path program 1 times [2025-02-08 14:15:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667484888] [2025-02-08 14:15:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:36,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:15:36,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:15:36,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:36,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667484888] [2025-02-08 14:15:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667484888] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:15:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619949492] [2025-02-08 14:15:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:15:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:15:36,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:15:36,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:15:36,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:15:36,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:15:36,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:36,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:36,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:15:36,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:15:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:36,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:15:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619949492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:15:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-02-08 14:15:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391537976] [2025-02-08 14:15:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:36,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 14:15:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:36,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:15:36,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:15:36,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-02-08 14:15:36,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:15:36,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:36,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-02-08 14:15:36,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:37,004 INFO L124 PetriNetUnfolderBase]: 2789/4231 cut-off events. [2025-02-08 14:15:37,005 INFO L125 PetriNetUnfolderBase]: For 663/663 co-relation queries the response was YES. [2025-02-08 14:15:37,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9480 conditions, 4231 events. 2789/4231 cut-off events. For 663/663 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23251 event pairs, 296 based on Foata normal form. 9/4068 useless extension candidates. Maximal degree in co-relation 5397. Up to 2458 conditions per place. [2025-02-08 14:15:37,049 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 50 selfloop transitions, 5 changer transitions 15/77 dead transitions. [2025-02-08 14:15:37,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 365 flow [2025-02-08 14:15:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:15:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 14:15:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2025-02-08 14:15:37,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2025-02-08 14:15:37,052 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 129 flow. Second operand 9 states and 141 transitions. [2025-02-08 14:15:37,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 365 flow [2025-02-08 14:15:37,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 357 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 14:15:37,068 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 144 flow [2025-02-08 14:15:37,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=144, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2025-02-08 14:15:37,069 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-02-08 14:15:37,069 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 144 flow [2025-02-08 14:15:37,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:15:37,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:37,070 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:37,079 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-08 14:15:37,270 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-08 14:15:37,271 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-08 14:15:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1274254155, now seen corresponding path program 1 times [2025-02-08 14:15:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103331090] [2025-02-08 14:15:37,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:37,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:15:37,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:15:37,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103331090] [2025-02-08 14:15:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103331090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:37,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:15:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121045417] [2025-02-08 14:15:37,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:37,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:37,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:37,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-08 14:15:37,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 144 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-08 14:15:37,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:37,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-08 14:15:37,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:37,775 INFO L124 PetriNetUnfolderBase]: 2105/3430 cut-off events. [2025-02-08 14:15:37,776 INFO L125 PetriNetUnfolderBase]: For 1345/1345 co-relation queries the response was YES. [2025-02-08 14:15:37,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8007 conditions, 3430 events. 2105/3430 cut-off events. For 1345/1345 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20091 event pairs, 728 based on Foata normal form. 81/3501 useless extension candidates. Maximal degree in co-relation 6588. Up to 2292 conditions per place. [2025-02-08 14:15:37,807 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 38 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-02-08 14:15:37,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 259 flow [2025-02-08 14:15:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:15:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:15:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-02-08 14:15:37,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-08 14:15:37,810 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 144 flow. Second operand 6 states and 102 transitions. [2025-02-08 14:15:37,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 259 flow [2025-02-08 14:15:37,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 247 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 14:15:37,826 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 135 flow [2025-02-08 14:15:37,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=135, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2025-02-08 14:15:37,827 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-02-08 14:15:37,827 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 135 flow [2025-02-08 14:15:37,827 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-08 14:15:37,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:37,829 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:37,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:15:37,829 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-08 14:15:37,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash -847172963, now seen corresponding path program 1 times [2025-02-08 14:15:37,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:37,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910407160] [2025-02-08 14:15:37,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:37,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:15:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:15:37,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:37,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910407160] [2025-02-08 14:15:37,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910407160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:37,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:37,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:15:37,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783298662] [2025-02-08 14:15:37,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:37,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:37,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:37,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:37,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-08 14:15:37,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 135 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-08 14:15:37,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:37,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-08 14:15:37,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:38,224 INFO L124 PetriNetUnfolderBase]: 1889/3160 cut-off events. [2025-02-08 14:15:38,224 INFO L125 PetriNetUnfolderBase]: For 1219/1219 co-relation queries the response was YES. [2025-02-08 14:15:38,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 3160 events. 1889/3160 cut-off events. For 1219/1219 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18680 event pairs, 80 based on Foata normal form. 81/3231 useless extension candidates. Maximal degree in co-relation 4356. Up to 1864 conditions per place. [2025-02-08 14:15:38,244 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 46 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2025-02-08 14:15:38,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 287 flow [2025-02-08 14:15:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:15:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:15:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-02-08 14:15:38,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-08 14:15:38,246 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 135 flow. Second operand 6 states and 110 transitions. [2025-02-08 14:15:38,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 287 flow [2025-02-08 14:15:38,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 272 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-08 14:15:38,253 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 126 flow [2025-02-08 14:15:38,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=126, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2025-02-08 14:15:38,254 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-08 14:15:38,254 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 126 flow [2025-02-08 14:15:38,254 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-08 14:15:38,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:38,254 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:38,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:15:38,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 14:15:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1910576281, now seen corresponding path program 1 times [2025-02-08 14:15:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:38,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732055419] [2025-02-08 14:15:38,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:38,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:15:38,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:15:38,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:38,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:15:38,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:15:38,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:15:38,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:15:38,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:38,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:15:38,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:15:38,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:15:38,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 14:15:38,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 14:15:38,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 14:15:38,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 14:15:38,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 14:15:38,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-08 14:15:38,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:15:38,284 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:38,285 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:15:38,285 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:15:38,311 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:15:38,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 118 flow [2025-02-08 14:15:38,318 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-02-08 14:15:38,318 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 14:15:38,318 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-08 14:15:38,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 118 flow [2025-02-08 14:15:38,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 111 flow [2025-02-08 14:15:38,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:15:38,321 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;@104fd96e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:15:38,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 14:15:38,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:15:38,322 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-08 14:15:38,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:15:38,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:38,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:15:38,323 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-08 14:15:38,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash 8137935, now seen corresponding path program 1 times [2025-02-08 14:15:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-02-08 14:15:38,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:38,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:15:38,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:15:38,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:38,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-02-08 14:15:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040802508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:15:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335661952] [2025-02-08 14:15:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:38,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:38,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:15:38,374 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-08 14:15:38,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:38,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:15:38,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:41,011 INFO L124 PetriNetUnfolderBase]: 33264/44890 cut-off events. [2025-02-08 14:15:41,011 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2025-02-08 14:15:41,092 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-08 14:15:41,389 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 51 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-02-08 14:15:41,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 271 flow [2025-02-08 14:15:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-08 14:15:41,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-02-08 14:15:41,391 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 111 flow. Second operand 4 states and 104 transitions. [2025-02-08 14:15:41,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 271 flow [2025-02-08 14:15:41,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 266 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:41,404 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 128 flow [2025-02-08 14:15:41,405 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-08 14:15:41,406 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-02-08 14:15:41,406 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 128 flow [2025-02-08 14:15:41,407 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-08 14:15:41,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:41,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:41,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:15:41,407 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-08 14:15:41,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1921350815, now seen corresponding path program 1 times [2025-02-08 14:15:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:41,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921830303] [2025-02-08 14:15:41,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:41,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:41,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:15:41,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:15:41,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:41,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:41,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921830303] [2025-02-08 14:15:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921830303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:41,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:15:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895350795] [2025-02-08 14:15:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:41,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:41,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:15:41,454 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-08 14:15:41,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:41,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:15:41,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:43,943 INFO L124 PetriNetUnfolderBase]: 33240/44494 cut-off events. [2025-02-08 14:15:43,943 INFO L125 PetriNetUnfolderBase]: For 6295/6808 co-relation queries the response was YES. [2025-02-08 14:15:44,052 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-08 14:15:44,248 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 44 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-02-08 14:15:44,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 270 flow [2025-02-08 14:15:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-08 14:15:44,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-02-08 14:15:44,249 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 128 flow. Second operand 4 states and 93 transitions. [2025-02-08 14:15:44,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 270 flow [2025-02-08 14:15:44,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:44,409 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 148 flow [2025-02-08 14:15:44,409 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-08 14:15:44,409 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-02-08 14:15:44,409 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 148 flow [2025-02-08 14:15:44,409 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-08 14:15:44,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:44,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 14:15:44,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:15:44,410 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-08 14:15:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1919258850, now seen corresponding path program 1 times [2025-02-08 14:15:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:44,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934317070] [2025-02-08 14:15:44,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:44,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:15:44,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:15:44,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:44,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:44,450 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-08 14:15:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934317070] [2025-02-08 14:15:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934317070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:15:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829077779] [2025-02-08 14:15:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:44,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:44,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:44,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:44,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-02-08 14:15:44,452 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-08 14:15:44,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:44,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-02-08 14:15:44,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:46,512 INFO L124 PetriNetUnfolderBase]: 26975/37361 cut-off events. [2025-02-08 14:15:46,512 INFO L125 PetriNetUnfolderBase]: For 6513/7539 co-relation queries the response was YES. [2025-02-08 14:15:46,587 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-08 14:15:46,692 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 34 selfloop transitions, 2 changer transitions 1/50 dead transitions. [2025-02-08 14:15:46,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 238 flow [2025-02-08 14:15:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:15:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:15:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-08 14:15:46,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-02-08 14:15:46,693 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 148 flow. Second operand 4 states and 92 transitions. [2025-02-08 14:15:46,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 238 flow [2025-02-08 14:15:46,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:46,827 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 156 flow [2025-02-08 14:15:46,827 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-08 14:15:46,829 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-02-08 14:15:46,830 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 156 flow [2025-02-08 14:15:46,830 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-08 14:15:46,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:46,830 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:46,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:15:46,831 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-08 14:15:46,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1516177654, now seen corresponding path program 1 times [2025-02-08 14:15:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-02-08 14:15:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:46,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:15:46,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:15:46,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:46,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:46,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-02-08 14:15:46,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867817005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:15:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299643958] [2025-02-08 14:15:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:15:46,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:15:46,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:15:46,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:15:46,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:15:46,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:15:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:46,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:15:46,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:15:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:47,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:15:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299643958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:15:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-02-08 14:15:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406593324] [2025-02-08 14:15:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 14:15:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:47,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:15:47,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:15:47,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-02-08 14:15:47,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:15:47,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:47,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-02-08 14:15:47,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:50,242 INFO L124 PetriNetUnfolderBase]: 39482/52264 cut-off events. [2025-02-08 14:15:50,242 INFO L125 PetriNetUnfolderBase]: For 8880/8880 co-relation queries the response was YES. [2025-02-08 14:15:50,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114620 conditions, 52264 events. 39482/52264 cut-off events. For 8880/8880 co-relation queries the response was YES. Maximal size of possible extension queue 1743. Compared 310561 event pairs, 10664 based on Foata normal form. 9/50562 useless extension candidates. Maximal degree in co-relation 65823. Up to 44740 conditions per place. [2025-02-08 14:15:50,529 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 72 selfloop transitions, 6 changer transitions 15/102 dead transitions. [2025-02-08 14:15:50,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 480 flow [2025-02-08 14:15:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:15:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:15:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2025-02-08 14:15:50,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4682926829268293 [2025-02-08 14:15:50,530 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 156 flow. Second operand 10 states and 192 transitions. [2025-02-08 14:15:50,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 480 flow [2025-02-08 14:15:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 472 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 14:15:50,708 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 183 flow [2025-02-08 14:15:50,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2025-02-08 14:15:50,709 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-02-08 14:15:50,709 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 183 flow [2025-02-08 14:15:50,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:15:50,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:50,709 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:50,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 14:15:50,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 14:15:50,910 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-08 14:15:50,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1519194101, now seen corresponding path program 1 times [2025-02-08 14:15:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126140336] [2025-02-08 14:15:50,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:50,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:15:50,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:15:50,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:50,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126140336] [2025-02-08 14:15:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126140336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:50,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:50,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:15:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792507556] [2025-02-08 14:15:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:50,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:50,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:50,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:50,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:15:50,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 183 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-08 14:15:50,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:50,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:15:50,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:53,476 INFO L124 PetriNetUnfolderBase]: 30050/40960 cut-off events. [2025-02-08 14:15:53,476 INFO L125 PetriNetUnfolderBase]: For 17662/17905 co-relation queries the response was YES. [2025-02-08 14:15:53,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93410 conditions, 40960 events. 30050/40960 cut-off events. For 17662/17905 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 251918 event pairs, 13445 based on Foata normal form. 810/41679 useless extension candidates. Maximal degree in co-relation 78624. Up to 29994 conditions per place. [2025-02-08 14:15:53,769 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2025-02-08 14:15:53,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 322 flow [2025-02-08 14:15:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:15:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:15:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-02-08 14:15:53,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2025-02-08 14:15:53,771 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 183 flow. Second operand 6 states and 124 transitions. [2025-02-08 14:15:53,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 322 flow [2025-02-08 14:15:54,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 310 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 14:15:54,037 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 170 flow [2025-02-08 14:15:54,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-02-08 14:15:54,038 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-08 14:15:54,038 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 170 flow [2025-02-08 14:15:54,038 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-08 14:15:54,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:54,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 14:15:54,038 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-08 14:15:54,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash -149622906, now seen corresponding path program 1 times [2025-02-08 14:15:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029000059] [2025-02-08 14:15:54,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:54,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:15:54,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:15:54,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:54,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029000059] [2025-02-08 14:15:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029000059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:15:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816549770] [2025-02-08 14:15:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:54,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:54,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:54,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:54,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:15:54,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 170 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-08 14:15:54,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:54,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:15:54,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:56,356 INFO L124 PetriNetUnfolderBase]: 29834/41176 cut-off events. [2025-02-08 14:15:56,356 INFO L125 PetriNetUnfolderBase]: For 14134/14377 co-relation queries the response was YES. [2025-02-08 14:15:56,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92363 conditions, 41176 events. 29834/41176 cut-off events. For 14134/14377 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 260108 event pairs, 8504 based on Foata normal form. 81/41166 useless extension candidates. Maximal degree in co-relation 59625. Up to 36856 conditions per place. [2025-02-08 14:15:56,630 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 56 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2025-02-08 14:15:56,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 354 flow [2025-02-08 14:15:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:15:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:15:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-02-08 14:15:56,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-02-08 14:15:56,632 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 170 flow. Second operand 6 states and 132 transitions. [2025-02-08 14:15:56,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 354 flow [2025-02-08 14:15:56,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 341 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 14:15:56,773 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 181 flow [2025-02-08 14:15:56,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-02-08 14:15:56,773 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-02-08 14:15:56,773 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 181 flow [2025-02-08 14:15:56,773 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-08 14:15:56,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:56,774 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:56,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 14:15:56,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 14:15:56,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -555669280, now seen corresponding path program 1 times [2025-02-08 14:15:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166848116] [2025-02-08 14:15:56,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:56,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:15:56,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:15:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166848116] [2025-02-08 14:15:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166848116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:15:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662168479] [2025-02-08 14:15:56,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:56,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:15:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:15:56,860 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-08 14:15:56,863 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-08 14:15:56,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:15:56,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:15:56,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:56,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:56,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:15:56,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:15:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:15:56,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:15:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662168479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:56,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:15:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 14:15:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252234347] [2025-02-08 14:15:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:56,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:56,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:15:56,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:15:56,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:15:56,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:56,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:15:56,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:59,654 INFO L124 PetriNetUnfolderBase]: 30050/40831 cut-off events. [2025-02-08 14:15:59,654 INFO L125 PetriNetUnfolderBase]: For 13906/13987 co-relation queries the response was YES. [2025-02-08 14:15:59,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92073 conditions, 40831 events. 30050/40831 cut-off events. For 13906/13987 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 250352 event pairs, 13580 based on Foata normal form. 810/40720 useless extension candidates. Maximal degree in co-relation 52422. Up to 17405 conditions per place. [2025-02-08 14:15:59,934 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 76 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-02-08 14:15:59,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 435 flow [2025-02-08 14:15:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:15:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:15:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-02-08 14:15:59,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-02-08 14:15:59,936 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 181 flow. Second operand 6 states and 150 transitions. [2025-02-08 14:15:59,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 435 flow [2025-02-08 14:16:00,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 427 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:16:00,080 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 179 flow [2025-02-08 14:16:00,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=64, 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=6, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2025-02-08 14:16:00,081 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-02-08 14:16:00,081 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 179 flow [2025-02-08 14:16:00,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:16:00,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:16:00,082 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:16:00,089 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-08 14:16:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:16:00,282 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-08 14:16:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:16:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 76290522, now seen corresponding path program 1 times [2025-02-08 14:16:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:16:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-02-08 14:16:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:16:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:16:00,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:16:00,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:16:00,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:16:00,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:16:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:16:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:16:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-02-08 14:16:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041867425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:16:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:16:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:16:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143033118] [2025-02-08 14:16:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:16:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 14:16:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:16:00,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:16:00,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:16:00,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:16:00,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 179 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-08 14:16:00,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:16:00,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:16:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:16:02,761 INFO L124 PetriNetUnfolderBase]: 26918/38179 cut-off events. [2025-02-08 14:16:02,761 INFO L125 PetriNetUnfolderBase]: For 18870/18870 co-relation queries the response was YES. [2025-02-08 14:16:02,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88781 conditions, 38179 events. 26918/38179 cut-off events. For 18870/18870 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 249045 event pairs, 728 based on Foata normal form. 729/38817 useless extension candidates. Maximal degree in co-relation 52964. Up to 22600 conditions per place. [2025-02-08 14:16:03,060 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 83 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2025-02-08 14:16:03,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 495 flow [2025-02-08 14:16:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:16:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:16:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-02-08 14:16:03,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5579268292682927 [2025-02-08 14:16:03,061 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 179 flow. Second operand 8 states and 183 transitions. [2025-02-08 14:16:03,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 495 flow [2025-02-08 14:16:03,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 461 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 14:16:03,615 INFO L231 Difference]: Finished difference. Result has 68 places, 42 transitions, 167 flow [2025-02-08 14:16:03,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=68, PETRI_TRANSITIONS=42} [2025-02-08 14:16:03,615 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2025-02-08 14:16:03,616 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 42 transitions, 167 flow [2025-02-08 14:16:03,616 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-08 14:16:03,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:16:03,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:16:03,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:16:03,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 14:16:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:16:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash -45878291, now seen corresponding path program 1 times [2025-02-08 14:16:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:16:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082676230] [2025-02-08 14:16:03,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:16:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:16:03,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:16:03,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:16:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:16:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:16:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:16:03,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:16:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082676230] [2025-02-08 14:16:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082676230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:16:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319157031] [2025-02-08 14:16:03,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:16:03,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:16:03,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:16:03,696 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-08 14:16:03,698 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-08 14:16:03,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:16:03,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:16:03,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:16:03,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:16:03,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:16:03,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:16:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:16:03,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:16:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:16:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319157031] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:16:03,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:16:03,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:16:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171938097] [2025-02-08 14:16:03,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:16:03,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:16:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:16:03,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:16:03,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:16:03,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-02-08 14:16:03,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 42 transitions, 167 flow. Second operand has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:16:03,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:16:03,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-02-08 14:16:03,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:16:07,854 INFO L124 PetriNetUnfolderBase]: 48842/66589 cut-off events. [2025-02-08 14:16:07,854 INFO L125 PetriNetUnfolderBase]: For 25698/25698 co-relation queries the response was YES. [2025-02-08 14:16:08,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144792 conditions, 66589 events. 48842/66589 cut-off events. For 25698/25698 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 417915 event pairs, 22976 based on Foata normal form. 2430/68910 useless extension candidates. Maximal degree in co-relation 51360. Up to 30041 conditions per place. [2025-02-08 14:16:08,302 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 126 selfloop transitions, 9 changer transitions 0/144 dead transitions. [2025-02-08 14:16:08,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 144 transitions, 653 flow [2025-02-08 14:16:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:16:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:16:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-02-08 14:16:08,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2025-02-08 14:16:08,304 INFO L175 Difference]: Start difference. First operand has 68 places, 42 transitions, 167 flow. Second operand 10 states and 254 transitions. [2025-02-08 14:16:08,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 144 transitions, 653 flow [2025-02-08 14:16:08,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 144 transitions, 628 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-02-08 14:16:08,410 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 200 flow [2025-02-08 14:16:08,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=10, PETRI_FLOW=200, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2025-02-08 14:16:08,410 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-02-08 14:16:08,410 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 200 flow [2025-02-08 14:16:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:16:08,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:16:08,411 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:16:08,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:16:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:16:08,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 14:16:08,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:16:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 300756413, now seen corresponding path program 1 times [2025-02-08 14:16:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:16:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398934078] [2025-02-08 14:16:08,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:16:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:16:08,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:16:08,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:16:08,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:16:08,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:16:08,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:16:08,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:16:08,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:16:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:16:08,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:16:08,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:16:08,652 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:16:08,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 14:16:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 14:16:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 14:16:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 14:16:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 14:16:08,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-08 14:16:08,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 14:16:08,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:16:08,653 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:16:08,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 14:16:08,684 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 14:16:08,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 154 flow [2025-02-08 14:16:08,698 INFO L124 PetriNetUnfolderBase]: 5/98 cut-off events. [2025-02-08 14:16:08,698 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 14:16:08,699 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-08 14:16:08,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 49 transitions, 154 flow [2025-02-08 14:16:08,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 47 transitions, 146 flow [2025-02-08 14:16:08,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:16:08,701 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;@104fd96e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:16:08,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 14:16:08,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:16:08,703 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-02-08 14:16:08,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:16:08,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:16:08,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:16:08,703 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-08 14:16:08,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:16:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 9646351, now seen corresponding path program 1 times [2025-02-08 14:16:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:16:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-02-08 14:16:08,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:16:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:16:08,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:16:08,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:16:08,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:16:08,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:16:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:16:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:16:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-02-08 14:16:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043982083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:16:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:16:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:16:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94352279] [2025-02-08 14:16:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:16:08,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:16:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:16:08,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:16:08,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:16:08,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-08 14:16:08,741 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-08 14:16:08,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:16:08,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-08 14:16:08,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand