./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/28_buggy_simple_loop1_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/28_buggy_simple_loop1_vf.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f7757e6e73d857d492b029f13f86cb5d550622238e5a2b483c58ab6fc3ffdeb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:09:49,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:09:50,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:09:50,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:09:50,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:09:50,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:09:50,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:09:50,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:09:50,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:09:50,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:09:50,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:09:50,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:09:50,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:09:50,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:50,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:09:50,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:09:50,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:09:50,075 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/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 -> f7757e6e73d857d492b029f13f86cb5d550622238e5a2b483c58ab6fc3ffdeb1 [2025-03-04 15:09:50,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:09:50,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:09:50,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:09:50,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:09:50,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:09:50,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/28_buggy_simple_loop1_vf.i [2025-03-04 15:09:51,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469690857/1b9be23efceb4298a078ca228c8c5b35/FLAG61a239e35 [2025-03-04 15:09:51,749 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:09:51,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/28_buggy_simple_loop1_vf.i [2025-03-04 15:09:51,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469690857/1b9be23efceb4298a078ca228c8c5b35/FLAG61a239e35 [2025-03-04 15:09:52,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469690857/1b9be23efceb4298a078ca228c8c5b35 [2025-03-04 15:09:52,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:09:52,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:09:52,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:52,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:09:52,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:09:52,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e35fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52, skipping insertion in model container [2025-03-04 15:09:52,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:09:52,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:52,361 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:09:52,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:52,413 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:09:52,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52 WrapperNode [2025-03-04 15:09:52,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:52,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:52,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:09:52,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:09:52,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,444 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-04 15:09:52,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:52,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:09:52,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:09:52,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:09:52,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,465 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-03-04 15:09:52,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:09:52,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:09:52,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:09:52,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:09:52,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (1/1) ... [2025-03-04 15:09:52,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:52,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:09:52,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:09:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 15:09:52,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 15:09:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:09:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:09:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:09:52,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:09:52,534 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:09:52,624 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:09:52,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:09:52,730 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:09:52,730 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:09:52,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:09:52,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:09:52,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:52 BoogieIcfgContainer [2025-03-04 15:09:52,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:09:52,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:09:52,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:09:52,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:09:52,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:09:52" (1/3) ... [2025-03-04 15:09:52,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3eb615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:52, skipping insertion in model container [2025-03-04 15:09:52,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:52" (2/3) ... [2025-03-04 15:09:52,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3eb615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:52, skipping insertion in model container [2025-03-04 15:09:52,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:52" (3/3) ... [2025-03-04 15:09:52,773 INFO L128 eAbstractionObserver]: Analyzing ICFG 28_buggy_simple_loop1_vf.i [2025-03-04 15:09:52,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:09:52,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28_buggy_simple_loop1_vf.i that has 2 procedures, 30 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-04 15:09:52,785 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:09:52,842 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:52,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 35 transitions, 74 flow [2025-03-04 15:09:52,888 INFO L124 PetriNetUnfolderBase]: 5/37 cut-off events. [2025-03-04 15:09:52,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 37 events. 5/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-04 15:09:52,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 35 transitions, 74 flow [2025-03-04 15:09:52,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 74 flow [2025-03-04 15:09:52,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:52,914 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;@3ed92965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:52,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:09:52,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:52,918 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:09:52,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:52,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:52,919 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:52,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 825198265, now seen corresponding path program 1 times [2025-03-04 15:09:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944710933] [2025-03-04 15:09:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:52,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:52,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:52,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:52,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:53,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:53,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:53,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:53,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:53,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:53,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:09:53,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:09:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:09:53,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:09:53,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:09:53,024 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 15:09:53,027 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:53,027 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:09:53,067 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 140 flow [2025-03-04 15:09:53,089 INFO L124 PetriNetUnfolderBase]: 10/70 cut-off events. [2025-03-04 15:09:53,089 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:09:53,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 70 events. 10/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 227 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 61. Up to 3 conditions per place. [2025-03-04 15:09:53,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 65 transitions, 140 flow [2025-03-04 15:09:53,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 65 transitions, 140 flow [2025-03-04 15:09:53,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:53,094 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;@3ed92965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:53,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 15:09:53,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:53,096 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 15:09:53,096 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:09:53,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:53,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:09:53,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:09:53,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1545931065, now seen corresponding path program 1 times [2025-03-04 15:09:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002990986] [2025-03-04 15:09:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:53,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:53,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:53,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:53,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002990986] [2025-03-04 15:09:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002990986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286191650] [2025-03-04 15:09:53,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:53,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:53,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:53,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:53,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:53,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2025-03-04 15:09:53,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-03-04 15:09:53,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2025-03-04 15:09:53,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:53,563 INFO L124 PetriNetUnfolderBase]: 976/2440 cut-off events. [2025-03-04 15:09:53,563 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 15:09:53,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 2440 events. 976/2440 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19149 event pairs, 416 based on Foata normal form. 159/2127 useless extension candidates. Maximal degree in co-relation 2980. Up to 818 conditions per place. [2025-03-04 15:09:53,584 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 47 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-04 15:09:53,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 281 flow [2025-03-04 15:09:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-04 15:09:53,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2025-03-04 15:09:53,596 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 140 flow. Second operand 3 states and 162 transitions. [2025-03-04 15:09:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 281 flow [2025-03-04 15:09:53,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:53,604 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 148 flow [2025-03-04 15:09:53,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-03-04 15:09:53,611 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-04 15:09:53,611 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 148 flow [2025-03-04 15:09:53,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-03-04 15:09:53,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:53,612 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 15:09:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:09:53,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:09:53,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1368207083, now seen corresponding path program 1 times [2025-03-04 15:09:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470950665] [2025-03-04 15:09:53,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:53,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:53,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:53,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:53,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:53,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:53,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:53,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:53,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:53,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:53,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:53,654 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:53,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-03-04 15:09:53,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-03-04 15:09:53,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2025-03-04 15:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-03-04 15:09:53,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-03-04 15:09:53,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:09:53,656 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:09:53,657 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:53,657 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:09:53,699 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:53,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 95 transitions, 208 flow [2025-03-04 15:09:53,713 INFO L124 PetriNetUnfolderBase]: 15/103 cut-off events. [2025-03-04 15:09:53,713 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:09:53,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 15/103 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 384 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2025-03-04 15:09:53,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 95 transitions, 208 flow [2025-03-04 15:09:53,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 95 transitions, 208 flow [2025-03-04 15:09:53,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:53,716 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;@3ed92965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:53,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-04 15:09:53,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:53,718 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:09:53,718 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:09:53,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:53,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:09:53,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:09:53,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1265361194, now seen corresponding path program 1 times [2025-03-04 15:09:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:53,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044294347] [2025-03-04 15:09:53,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:53,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:53,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:53,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044294347] [2025-03-04 15:09:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044294347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053704491] [2025-03-04 15:09:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:53,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:53,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:53,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 95 [2025-03-04 15:09:53,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:53,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:53,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 95 [2025-03-04 15:09:53,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:55,366 INFO L124 PetriNetUnfolderBase]: 12492/25077 cut-off events. [2025-03-04 15:09:55,367 INFO L125 PetriNetUnfolderBase]: For 909/909 co-relation queries the response was YES. [2025-03-04 15:09:55,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41586 conditions, 25077 events. 12492/25077 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 249190 event pairs, 4902 based on Foata normal form. 2141/22565 useless extension candidates. Maximal degree in co-relation 11006. Up to 9282 conditions per place. [2025-03-04 15:09:55,514 INFO L140 encePairwiseOnDemand]: 87/95 looper letters, 69 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2025-03-04 15:09:55,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 124 transitions, 420 flow [2025-03-04 15:09:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2025-03-04 15:09:55,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-03-04 15:09:55,516 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 208 flow. Second operand 3 states and 240 transitions. [2025-03-04 15:09:55,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 124 transitions, 420 flow [2025-03-04 15:09:55,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 124 transitions, 416 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:55,520 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 212 flow [2025-03-04 15:09:55,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2025-03-04 15:09:55,520 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 2 predicate places. [2025-03-04 15:09:55,520 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 212 flow [2025-03-04 15:09:55,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:55,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:55,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:55,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:09:55,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:09:55,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2021754785, now seen corresponding path program 1 times [2025-03-04 15:09:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-04 15:09:55,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:55,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:55,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-04 15:09:55,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564993150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:55,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:55,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78034301] [2025-03-04 15:09:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:55,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:55,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:55,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:55,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:55,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 95 [2025-03-04 15:09:55,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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-03-04 15:09:55,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:55,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 95 [2025-03-04 15:09:55,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:57,900 INFO L124 PetriNetUnfolderBase]: 23423/46076 cut-off events. [2025-03-04 15:09:57,900 INFO L125 PetriNetUnfolderBase]: For 3336/3336 co-relation queries the response was YES. [2025-03-04 15:09:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78611 conditions, 46076 events. 23423/46076 cut-off events. For 3336/3336 co-relation queries the response was YES. Maximal size of possible extension queue 1990. Compared 476960 event pairs, 10048 based on Foata normal form. 405/38212 useless extension candidates. Maximal degree in co-relation 63270. Up to 17446 conditions per place. [2025-03-04 15:09:58,163 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 70 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-04 15:09:58,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 125 transitions, 435 flow [2025-03-04 15:09:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-03-04 15:09:58,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105263157894737 [2025-03-04 15:09:58,165 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 212 flow. Second operand 3 states and 231 transitions. [2025-03-04 15:09:58,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 125 transitions, 435 flow [2025-03-04 15:09:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 125 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:58,173 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 224 flow [2025-03-04 15:09:58,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2025-03-04 15:09:58,174 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 4 predicate places. [2025-03-04 15:09:58,174 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 224 flow [2025-03-04 15:09:58,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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-03-04 15:09:58,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:58,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:58,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:09:58,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:09:58,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash -552304708, now seen corresponding path program 1 times [2025-03-04 15:09:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-04 15:09:58,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:58,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:58,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:58,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-03-04 15:09:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:09:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908212762] [2025-03-04 15:09:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:58,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:58,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:58,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:58,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 95 [2025-03-04 15:09:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:09:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 95 [2025-03-04 15:09:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:10:00,553 INFO L124 PetriNetUnfolderBase]: 25742/49332 cut-off events. [2025-03-04 15:10:00,554 INFO L125 PetriNetUnfolderBase]: For 5582/5582 co-relation queries the response was YES. [2025-03-04 15:10:00,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87802 conditions, 49332 events. 25742/49332 cut-off events. For 5582/5582 co-relation queries the response was YES. Maximal size of possible extension queue 2130. Compared 505192 event pairs, 12211 based on Foata normal form. 816/42031 useless extension candidates. Maximal degree in co-relation 84922. Up to 20728 conditions per place. [2025-03-04 15:10:00,835 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 97 selfloop transitions, 3 changer transitions 0/151 dead transitions. [2025-03-04 15:10:00,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 151 transitions, 576 flow [2025-03-04 15:10:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:10:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:10:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-03-04 15:10:00,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7973684210526316 [2025-03-04 15:10:00,838 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 224 flow. Second operand 4 states and 303 transitions. [2025-03-04 15:10:00,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 151 transitions, 576 flow [2025-03-04 15:10:00,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:10:00,846 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 240 flow [2025-03-04 15:10:00,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2025-03-04 15:10:00,847 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-03-04 15:10:00,847 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 240 flow [2025-03-04 15:10:00,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:10:00,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:10:00,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:10:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:10:00,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:10:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:10:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 58424627, now seen corresponding path program 1 times [2025-03-04 15:10:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:10:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003006376] [2025-03-04 15:10:00,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:10:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:10:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:10:00,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:10:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:10:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:10:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:10:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:10:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003006376] [2025-03-04 15:10:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003006376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:10:00,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:10:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:10:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765808804] [2025-03-04 15:10:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:10:00,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:10:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:10:00,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:10:00,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:10:00,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 95 [2025-03-04 15:10:00,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-03-04 15:10:00,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:10:00,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 95 [2025-03-04 15:10:00,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:10:03,888 INFO L124 PetriNetUnfolderBase]: 32167/57202 cut-off events. [2025-03-04 15:10:03,888 INFO L125 PetriNetUnfolderBase]: For 10366/10366 co-relation queries the response was YES. [2025-03-04 15:10:04,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107971 conditions, 57202 events. 32167/57202 cut-off events. For 10366/10366 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 545811 event pairs, 11428 based on Foata normal form. 408/49473 useless extension candidates. Maximal degree in co-relation 105073. Up to 19069 conditions per place. [2025-03-04 15:10:04,214 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 149 selfloop transitions, 6 changer transitions 0/206 dead transitions. [2025-03-04 15:10:04,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 206 transitions, 842 flow [2025-03-04 15:10:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:10:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:10:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2025-03-04 15:10:04,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8017543859649123 [2025-03-04 15:10:04,216 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 240 flow. Second operand 6 states and 457 transitions. [2025-03-04 15:10:04,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 206 transitions, 842 flow [2025-03-04 15:10:04,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 206 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:10:04,224 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 277 flow [2025-03-04 15:10:04,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2025-03-04 15:10:04,225 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 15 predicate places. [2025-03-04 15:10:04,225 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 277 flow [2025-03-04 15:10:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-03-04 15:10:04,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:10:04,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:10:04,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:10:04,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:10:04,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:10:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1811162784, now seen corresponding path program 1 times [2025-03-04 15:10:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:10:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620564866] [2025-03-04 15:10:04,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:10:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:10:04,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:10:04,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:10:04,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:10:04,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:10:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:10:04,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:10:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620564866] [2025-03-04 15:10:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620564866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:10:04,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:10:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:10:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183459921] [2025-03-04 15:10:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:10:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:10:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:10:04,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:10:04,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:10:04,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 95 [2025-03-04 15:10:04,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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-03-04 15:10:04,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:10:04,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 95 [2025-03-04 15:10:04,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:10:08,588 INFO L124 PetriNetUnfolderBase]: 48844/82880 cut-off events. [2025-03-04 15:10:08,588 INFO L125 PetriNetUnfolderBase]: For 27166/27166 co-relation queries the response was YES. [2025-03-04 15:10:08,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172244 conditions, 82880 events. 48844/82880 cut-off events. For 27166/27166 co-relation queries the response was YES. Maximal size of possible extension queue 3181. Compared 794802 event pairs, 15289 based on Foata normal form. 816/73563 useless extension candidates. Maximal degree in co-relation 109243. Up to 28180 conditions per place. [2025-03-04 15:10:09,086 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 206 selfloop transitions, 12 changer transitions 0/269 dead transitions. [2025-03-04 15:10:09,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 269 transitions, 1191 flow [2025-03-04 15:10:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:10:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:10:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 614 transitions. [2025-03-04 15:10:09,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078947368421052 [2025-03-04 15:10:09,088 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 277 flow. Second operand 8 states and 614 transitions. [2025-03-04 15:10:09,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 269 transitions, 1191 flow [2025-03-04 15:10:09,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 269 transitions, 1191 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:10:09,402 INFO L231 Difference]: Finished difference. Result has 114 places, 108 transitions, 377 flow [2025-03-04 15:10:09,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=377, PETRI_PLACES=114, PETRI_TRANSITIONS=108} [2025-03-04 15:10:09,403 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 27 predicate places. [2025-03-04 15:10:09,403 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 108 transitions, 377 flow [2025-03-04 15:10:09,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 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-03-04 15:10:09,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:10:09,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:10:09,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:10:09,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:10:09,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:10:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1811163777, now seen corresponding path program 1 times [2025-03-04 15:10:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:10:09,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601647517] [2025-03-04 15:10:09,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:10:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:10:09,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:10:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:10:09,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:10:09,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:10:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:10:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:10:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601647517] [2025-03-04 15:10:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601647517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:10:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:10:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:10:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029659226] [2025-03-04 15:10:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:10:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:10:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:10:09,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:10:09,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:10:09,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 95 [2025-03-04 15:10:09,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 108 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-03-04 15:10:09,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:10:09,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 95 [2025-03-04 15:10:09,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:10:14,744 INFO L124 PetriNetUnfolderBase]: 51436/90243 cut-off events. [2025-03-04 15:10:14,744 INFO L125 PetriNetUnfolderBase]: For 62248/62248 co-relation queries the response was YES. [2025-03-04 15:10:15,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198971 conditions, 90243 events. 51436/90243 cut-off events. For 62248/62248 co-relation queries the response was YES. Maximal size of possible extension queue 3464. Compared 905995 event pairs, 14245 based on Foata normal form. 408/80515 useless extension candidates. Maximal degree in co-relation 194301. Up to 26521 conditions per place. [2025-03-04 15:10:15,379 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 183 selfloop transitions, 8 changer transitions 0/243 dead transitions. [2025-03-04 15:10:15,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 243 transitions, 1131 flow [2025-03-04 15:10:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:10:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:10:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 539 transitions. [2025-03-04 15:10:15,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105263157894737 [2025-03-04 15:10:15,381 INFO L175 Difference]: Start difference. First operand has 114 places, 108 transitions, 377 flow. Second operand 7 states and 539 transitions. [2025-03-04 15:10:15,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 243 transitions, 1131 flow [2025-03-04 15:10:15,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 243 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:10:15,912 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 418 flow [2025-03-04 15:10:15,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2025-03-04 15:10:15,913 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2025-03-04 15:10:15,913 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 418 flow [2025-03-04 15:10:15,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-03-04 15:10:15,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:10:15,913 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 15:10:15,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:10:15,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-04 15:10:15,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:10:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash 197491160, now seen corresponding path program 1 times [2025-03-04 15:10:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:10:15,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465637524] [2025-03-04 15:10:15,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:10:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:10:15,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:10:15,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:10:15,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:10:15,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:10:15,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:10:15,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:10:15,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:10:15,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:10:15,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:10:15,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:10:15,928 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 33 remaining) [2025-03-04 15:10:15,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 33 remaining) [2025-03-04 15:10:15,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 33 remaining) [2025-03-04 15:10:15,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 33 remaining) [2025-03-04 15:10:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:10:15,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:10:15,932 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:10:15,932 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 15:10:15,969 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:10:15,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 125 transitions, 278 flow [2025-03-04 15:10:16,114 INFO L124 PetriNetUnfolderBase]: 20/136 cut-off events. [2025-03-04 15:10:16,114 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:10:16,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 136 events. 20/136 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 539 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 119. Up to 5 conditions per place. [2025-03-04 15:10:16,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 125 transitions, 278 flow [2025-03-04 15:10:16,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 125 transitions, 278 flow [2025-03-04 15:10:16,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:10:16,120 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;@3ed92965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:10:16,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-04 15:10:16,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:10:16,121 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 15:10:16,121 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:10:16,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:10:16,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:10:16,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:10:16,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:10:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 669218634, now seen corresponding path program 1 times [2025-03-04 15:10:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:10:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214721837] [2025-03-04 15:10:16,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:10:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:10:16,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:10:16,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:10:16,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:10:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:10:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:10:16,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:10:16,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214721837] [2025-03-04 15:10:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214721837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:10:16,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:10:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:10:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268805339] [2025-03-04 15:10:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:10:16,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:10:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:10:16,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:10:16,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:10:16,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 125 [2025-03-04 15:10:16,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 125 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-03-04 15:10:16,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:10:16,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 125 [2025-03-04 15:10:16,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand