./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 19:26:08,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:26:08,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:26:08,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:26:08,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:26:08,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:26:08,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:26:08,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:26:08,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:26:08,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:26:08,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:26:08,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:26:08,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:26:08,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:26:08,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:26:08,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:26:08,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:26:08,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:26:08,321 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-17 19:26:08,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:26:08,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:26:08,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:26:08,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:26:08,559 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:26:08,561 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-17 19:26:09,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efea592c/c354c302cfd44ae1aafa129ca878a40a/FLAGf065e1eb5 [2025-03-17 19:26:10,026 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:26:10,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/28_buggy_simple_loop1_vf.i [2025-03-17 19:26:10,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efea592c/c354c302cfd44ae1aafa129ca878a40a/FLAGf065e1eb5 [2025-03-17 19:26:10,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efea592c/c354c302cfd44ae1aafa129ca878a40a [2025-03-17 19:26:10,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:26:10,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:26:10,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:26:10,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:26:10,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:26:10,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10, skipping insertion in model container [2025-03-17 19:26:10,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:26:10,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:26:10,306 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:26:10,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:26:10,363 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:26:10,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10 WrapperNode [2025-03-17 19:26:10,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:26:10,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:26:10,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:26:10,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:26:10,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,394 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-17 19:26:10,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:26:10,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:26:10,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:26:10,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:26:10,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,416 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-17 19:26:10,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:26:10,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:26:10,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:26:10,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:26:10,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (1/1) ... [2025-03-17 19:26:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:26:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:26:10,447 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-17 19:26:10,450 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-17 19:26:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 19:26:10,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 19:26:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:26:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:26:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:26:10,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:26:10,469 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:26:10,563 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:26:10,564 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:26:10,733 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:26:10,733 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:26:10,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:26:10,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:26:10,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:26:10 BoogieIcfgContainer [2025-03-17 19:26:10,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:26:10,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:26:10,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:26:10,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:26:10,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:26:10" (1/3) ... [2025-03-17 19:26:10,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e77ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:26:10, skipping insertion in model container [2025-03-17 19:26:10,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:26:10" (2/3) ... [2025-03-17 19:26:10,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e77ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:26:10, skipping insertion in model container [2025-03-17 19:26:10,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:26:10" (3/3) ... [2025-03-17 19:26:10,788 INFO L128 eAbstractionObserver]: Analyzing ICFG 28_buggy_simple_loop1_vf.i [2025-03-17 19:26:10,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:26:10,801 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-17 19:26:10,801 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:26:10,884 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:26:10,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 35 transitions, 74 flow [2025-03-17 19:26:10,937 INFO L124 PetriNetUnfolderBase]: 5/37 cut-off events. [2025-03-17 19:26:10,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:26:10,943 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 79 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-17 19:26:10,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 35 transitions, 74 flow [2025-03-17 19:26:10,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 74 flow [2025-03-17 19:26:10,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:26:10,967 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;@509b3359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:26:10,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 19:26:10,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:26:10,976 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-17 19:26:10,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:26:10,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:10,977 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:26:10,977 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-17 19:26:10,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 826121817, now seen corresponding path program 1 times [2025-03-17 19:26:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:10,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-03-17 19:26:10,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:11,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:11,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:26:11,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:26:11,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:11,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:11,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:11,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:26:11,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:26:11,085 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:26:11,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-17 19:26:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-17 19:26:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-17 19:26:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-17 19:26:11,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-17 19:26:11,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-17 19:26:11,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-17 19:26:11,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-17 19:26:11,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-17 19:26:11,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-17 19:26:11,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-17 19:26:11,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-17 19:26:11,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-17 19:26:11,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-17 19:26:11,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-17 19:26:11,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-17 19:26:11,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-17 19:26:11,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:26:11,091 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-17 19:26:11,093 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:26:11,093 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 19:26:11,144 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:26:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 140 flow [2025-03-17 19:26:11,170 INFO L124 PetriNetUnfolderBase]: 10/70 cut-off events. [2025-03-17 19:26:11,170 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:26:11,171 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 222 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-17 19:26:11,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 65 transitions, 140 flow [2025-03-17 19:26:11,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 65 transitions, 140 flow [2025-03-17 19:26:11,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:26:11,177 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;@509b3359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:26:11,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-17 19:26:11,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:26:11,180 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-17 19:26:11,180 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:26:11,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:11,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:26:11,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-17 19:26:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1545007544, now seen corresponding path program 1 times [2025-03-17 19:26:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:11,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-03-17 19:26:11,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:11,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:11,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:11,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:11,274 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-17 19:26:11,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:11,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-03-17 19:26:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113231668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:11,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:11,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:26:11,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217523571] [2025-03-17 19:26:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:11,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:26:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:11,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:26:11,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:26:11,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2025-03-17 19:26:11,320 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-17 19:26:11,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:11,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2025-03-17 19:26:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:11,664 INFO L124 PetriNetUnfolderBase]: 976/2440 cut-off events. [2025-03-17 19:26:11,665 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-17 19:26:11,671 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 19132 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-17 19:26:11,682 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 47 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-17 19:26:11,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 281 flow [2025-03-17 19:26:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:26:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:26:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-17 19:26:11,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2025-03-17 19:26:11,695 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 140 flow. Second operand 3 states and 162 transitions. [2025-03-17 19:26:11,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 281 flow [2025-03-17 19:26:11,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:26:11,701 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 148 flow [2025-03-17 19:26:11,705 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-17 19:26:11,707 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-17 19:26:11,707 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 148 flow [2025-03-17 19:26:11,708 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-17 19:26:11,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:11,708 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-17 19:26:11,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:26:11,708 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-17 19:26:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash 375526804, now seen corresponding path program 1 times [2025-03-17 19:26:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64905397] [2025-03-17 19:26:11,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:11,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:26:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:26:11,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:11,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:26:11,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:26:11,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:26:11,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:26:11,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:26:11,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:26:11,749 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-03-17 19:26:11,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-03-17 19:26:11,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-03-17 19:26:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:26:11,752 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 19:26:11,752 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:26:11,752 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 19:26:11,801 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:26:11,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 95 transitions, 208 flow [2025-03-17 19:26:11,813 INFO L124 PetriNetUnfolderBase]: 15/103 cut-off events. [2025-03-17 19:26:11,814 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 19:26:11,814 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 379 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-17 19:26:11,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 95 transitions, 208 flow [2025-03-17 19:26:11,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 95 transitions, 208 flow [2025-03-17 19:26:11,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:26:11,817 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;@509b3359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:26:11,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-17 19:26:11,819 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:26:11,820 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-17 19:26:11,820 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:26:11,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:11,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:26:11,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-17 19:26:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1266284715, now seen corresponding path program 1 times [2025-03-17 19:26:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423663824] [2025-03-17 19:26:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:11,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:11,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:11,879 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-17 19:26:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423663824] [2025-03-17 19:26:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423663824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:11,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:26:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143561132] [2025-03-17 19:26:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:11,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:26:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:11,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:26:11,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:26:11,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 95 [2025-03-17 19:26:11,900 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-17 19:26:11,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:11,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 95 [2025-03-17 19:26:11,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:13,519 INFO L124 PetriNetUnfolderBase]: 12494/25087 cut-off events. [2025-03-17 19:26:13,519 INFO L125 PetriNetUnfolderBase]: For 919/919 co-relation queries the response was YES. [2025-03-17 19:26:13,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41596 conditions, 25087 events. 12494/25087 cut-off events. For 919/919 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 249269 event pairs, 4902 based on Foata normal form. 2139/22570 useless extension candidates. Maximal degree in co-relation 11006. Up to 9282 conditions per place. [2025-03-17 19:26:13,704 INFO L140 encePairwiseOnDemand]: 87/95 looper letters, 69 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2025-03-17 19:26:13,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 124 transitions, 420 flow [2025-03-17 19:26:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:26:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:26:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2025-03-17 19:26:13,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-03-17 19:26:13,710 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 208 flow. Second operand 3 states and 240 transitions. [2025-03-17 19:26:13,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 124 transitions, 420 flow [2025-03-17 19:26:13,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 124 transitions, 416 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-17 19:26:13,716 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 212 flow [2025-03-17 19:26:13,716 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-17 19:26:13,717 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 2 predicate places. [2025-03-17 19:26:13,717 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 212 flow [2025-03-17 19:26:13,717 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-17 19:26:13,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:13,717 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:13,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:26:13,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-17 19:26:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash -278020929, now seen corresponding path program 1 times [2025-03-17 19:26:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655234827] [2025-03-17 19:26:13,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:13,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:26:13,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:26:13,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:13,769 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-17 19:26:13,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655234827] [2025-03-17 19:26:13,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655234827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:13,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:13,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:26:13,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608876748] [2025-03-17 19:26:13,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:26:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:26:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:26:13,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 95 [2025-03-17 19:26:13,785 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-17 19:26:13,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:13,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 95 [2025-03-17 19:26:13,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:16,254 INFO L124 PetriNetUnfolderBase]: 23425/46086 cut-off events. [2025-03-17 19:26:16,255 INFO L125 PetriNetUnfolderBase]: For 3342/3342 co-relation queries the response was YES. [2025-03-17 19:26:16,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78621 conditions, 46086 events. 23425/46086 cut-off events. For 3342/3342 co-relation queries the response was YES. Maximal size of possible extension queue 1990. Compared 476990 event pairs, 10048 based on Foata normal form. 405/38218 useless extension candidates. Maximal degree in co-relation 63270. Up to 17446 conditions per place. [2025-03-17 19:26:16,614 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 70 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-17 19:26:16,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 125 transitions, 435 flow [2025-03-17 19:26:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:26:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:26:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-03-17 19:26:16,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105263157894737 [2025-03-17 19:26:16,616 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 212 flow. Second operand 3 states and 231 transitions. [2025-03-17 19:26:16,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 125 transitions, 435 flow [2025-03-17 19:26:16,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 125 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:26:16,624 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 224 flow [2025-03-17 19:26:16,624 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-17 19:26:16,626 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 4 predicate places. [2025-03-17 19:26:16,626 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 224 flow [2025-03-17 19:26:16,626 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-17 19:26:16,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:16,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:16,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:26:16,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-17 19:26:16,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1190505627, now seen corresponding path program 1 times [2025-03-17 19:26:16,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:16,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294625884] [2025-03-17 19:26:16,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:26:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:26:16,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:16,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:16,718 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-17 19:26:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294625884] [2025-03-17 19:26:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294625884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:16,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:16,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:26:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564993150] [2025-03-17 19:26:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:16,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:26:16,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:16,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:26:16,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:26:16,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 95 [2025-03-17 19:26:16,736 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-17 19:26:16,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:16,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 95 [2025-03-17 19:26:16,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:18,935 INFO L124 PetriNetUnfolderBase]: 25742/49332 cut-off events. [2025-03-17 19:26:18,936 INFO L125 PetriNetUnfolderBase]: For 5582/5582 co-relation queries the response was YES. [2025-03-17 19:26:19,023 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 504971 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-17 19:26:19,188 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 97 selfloop transitions, 3 changer transitions 0/151 dead transitions. [2025-03-17 19:26:19,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 151 transitions, 576 flow [2025-03-17 19:26:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:26:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:26:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-03-17 19:26:19,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7973684210526316 [2025-03-17 19:26:19,190 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 224 flow. Second operand 4 states and 303 transitions. [2025-03-17 19:26:19,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 151 transitions, 576 flow [2025-03-17 19:26:19,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:26:19,194 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 240 flow [2025-03-17 19:26:19,194 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-17 19:26:19,195 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-03-17 19:26:19,195 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 240 flow [2025-03-17 19:26:19,195 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-17 19:26:19,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:19,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:19,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:26:19,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-17 19:26:19,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1749029836, now seen corresponding path program 1 times [2025-03-17 19:26:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021644681] [2025-03-17 19:26:19,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:19,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:19,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:26:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:26:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:19,258 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-17 19:26:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:19,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021644681] [2025-03-17 19:26:19,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021644681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:19,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:26:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290467010] [2025-03-17 19:26:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:19,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:26:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:19,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:26:19,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:26:19,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 95 [2025-03-17 19:26:19,286 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-17 19:26:19,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:19,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 95 [2025-03-17 19:26:19,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:22,343 INFO L124 PetriNetUnfolderBase]: 32167/57202 cut-off events. [2025-03-17 19:26:22,343 INFO L125 PetriNetUnfolderBase]: For 10366/10366 co-relation queries the response was YES. [2025-03-17 19:26:22,503 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 545719 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-17 19:26:22,903 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 149 selfloop transitions, 6 changer transitions 0/206 dead transitions. [2025-03-17 19:26:22,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 206 transitions, 842 flow [2025-03-17 19:26:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:26:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:26:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2025-03-17 19:26:22,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8017543859649123 [2025-03-17 19:26:22,905 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 240 flow. Second operand 6 states and 457 transitions. [2025-03-17 19:26:22,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 206 transitions, 842 flow [2025-03-17 19:26:22,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 206 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:26:22,912 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 277 flow [2025-03-17 19:26:22,913 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-17 19:26:22,917 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 15 predicate places. [2025-03-17 19:26:22,917 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 277 flow [2025-03-17 19:26:22,917 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-17 19:26:22,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:22,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:22,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:26:22,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-17 19:26:22,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1614649279, now seen corresponding path program 1 times [2025-03-17 19:26:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:22,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271946085] [2025-03-17 19:26:22,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:22,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:26:22,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:26:22,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:22,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:22,997 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-17 19:26:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:22,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271946085] [2025-03-17 19:26:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271946085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:26:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662088377] [2025-03-17 19:26:22,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:26:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:23,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:26:23,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:26:23,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 95 [2025-03-17 19:26:23,046 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-17 19:26:23,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:23,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 95 [2025-03-17 19:26:23,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:27,422 INFO L124 PetriNetUnfolderBase]: 48844/82880 cut-off events. [2025-03-17 19:26:27,422 INFO L125 PetriNetUnfolderBase]: For 27166/27166 co-relation queries the response was YES. [2025-03-17 19:26:27,888 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 794961 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-17 19:26:28,278 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 206 selfloop transitions, 12 changer transitions 0/269 dead transitions. [2025-03-17 19:26:28,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 269 transitions, 1191 flow [2025-03-17 19:26:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:26:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:26:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 614 transitions. [2025-03-17 19:26:28,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078947368421052 [2025-03-17 19:26:28,280 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 277 flow. Second operand 8 states and 614 transitions. [2025-03-17 19:26:28,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 269 transitions, 1191 flow [2025-03-17 19:26:28,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 269 transitions, 1191 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:26:28,669 INFO L231 Difference]: Finished difference. Result has 114 places, 108 transitions, 377 flow [2025-03-17 19:26:28,671 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-17 19:26:28,671 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 27 predicate places. [2025-03-17 19:26:28,671 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 108 transitions, 377 flow [2025-03-17 19:26:28,672 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-17 19:26:28,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:28,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:28,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:26:28,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-03-17 19:26:28,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1614650272, now seen corresponding path program 1 times [2025-03-17 19:26:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321786432] [2025-03-17 19:26:28,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:28,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:26:28,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:26:28,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:28,716 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-17 19:26:28,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321786432] [2025-03-17 19:26:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321786432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:28,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:26:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095308496] [2025-03-17 19:26:28,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:28,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:26:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:28,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:26:28,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:26:28,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 95 [2025-03-17 19:26:28,744 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-17 19:26:28,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:28,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 95 [2025-03-17 19:26:28,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:34,250 INFO L124 PetriNetUnfolderBase]: 51436/90253 cut-off events. [2025-03-17 19:26:34,250 INFO L125 PetriNetUnfolderBase]: For 62254/62254 co-relation queries the response was YES. [2025-03-17 19:26:34,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198981 conditions, 90253 events. 51436/90253 cut-off events. For 62254/62254 co-relation queries the response was YES. Maximal size of possible extension queue 3464. Compared 906126 event pairs, 14245 based on Foata normal form. 408/80522 useless extension candidates. Maximal degree in co-relation 194301. Up to 26521 conditions per place. [2025-03-17 19:26:34,961 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 183 selfloop transitions, 8 changer transitions 0/243 dead transitions. [2025-03-17 19:26:34,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 243 transitions, 1131 flow [2025-03-17 19:26:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:26:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:26:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 539 transitions. [2025-03-17 19:26:34,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105263157894737 [2025-03-17 19:26:34,963 INFO L175 Difference]: Start difference. First operand has 114 places, 108 transitions, 377 flow. Second operand 7 states and 539 transitions. [2025-03-17 19:26:34,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 243 transitions, 1131 flow [2025-03-17 19:26:35,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 243 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:26:35,467 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 418 flow [2025-03-17 19:26:35,467 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-17 19:26:35,468 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2025-03-17 19:26:35,468 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 418 flow [2025-03-17 19:26:35,468 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-17 19:26:35,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:35,468 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-17 19:26:35,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:26:35,469 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-17 19:26:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 144273688, now seen corresponding path program 1 times [2025-03-17 19:26:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240522816] [2025-03-17 19:26:35,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:35,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:26:35,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:26:35,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:35,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:26:35,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:26:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:26:35,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:26:35,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:35,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:26:35,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:26:35,491 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 33 remaining) [2025-03-17 19:26:35,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 33 remaining) [2025-03-17 19:26:35,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 33 remaining) [2025-03-17 19:26:35,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 33 remaining) [2025-03-17 19:26:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:26:35,494 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:35,494 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 19:26:35,494 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 19:26:35,534 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:26:35,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 125 transitions, 278 flow [2025-03-17 19:26:35,543 INFO L124 PetriNetUnfolderBase]: 20/136 cut-off events. [2025-03-17 19:26:35,543 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 19:26:35,544 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 531 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-17 19:26:35,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 125 transitions, 278 flow [2025-03-17 19:26:35,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 125 transitions, 278 flow [2025-03-17 19:26:35,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:26:35,546 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;@509b3359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:26:35,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-17 19:26:35,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:26:35,547 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-17 19:26:35,547 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:26:35,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:35,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:26:35,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-17 19:26:35,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash 670142155, now seen corresponding path program 1 times [2025-03-17 19:26:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-17 19:26:35,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:26:35,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:26:35,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:35,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:35,695 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-17 19:26:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-17 19:26:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115913383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:26:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183279210] [2025-03-17 19:26:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:26:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:26:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:26:35,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 125 [2025-03-17 19:26:35,710 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-17 19:26:35,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:35,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 125 [2025-03-17 19:26:35,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:26:47,239 INFO L124 PetriNetUnfolderBase]: 137166/238727 cut-off events. [2025-03-17 19:26:47,239 INFO L125 PetriNetUnfolderBase]: For 12639/12639 co-relation queries the response was YES. [2025-03-17 19:26:47,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409349 conditions, 238727 events. 137166/238727 cut-off events. For 12639/12639 co-relation queries the response was YES. Maximal size of possible extension queue 9478. Compared 2664838 event pairs, 54566 based on Foata normal form. 24791/222830 useless extension candidates. Maximal degree in co-relation 41567. Up to 96194 conditions per place. [2025-03-17 19:26:48,868 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 91 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-17 19:26:48,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 563 flow [2025-03-17 19:26:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:26:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:26:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2025-03-17 19:26:48,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.848 [2025-03-17 19:26:48,869 INFO L175 Difference]: Start difference. First operand has 114 places, 125 transitions, 278 flow. Second operand 3 states and 318 transitions. [2025-03-17 19:26:48,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 563 flow [2025-03-17 19:26:48,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 164 transitions, 551 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-17 19:26:48,874 INFO L231 Difference]: Finished difference. Result has 116 places, 121 transitions, 276 flow [2025-03-17 19:26:48,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=116, PETRI_TRANSITIONS=121} [2025-03-17 19:26:48,874 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2025-03-17 19:26:48,874 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 121 transitions, 276 flow [2025-03-17 19:26:48,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-17 19:26:48,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:26:48,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:26:48,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:26:48,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-17 19:26:48,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:26:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1128131495, now seen corresponding path program 1 times [2025-03-17 19:26:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:26:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333938697] [2025-03-17 19:26:48,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:26:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:26:48,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:26:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:26:48,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:26:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:26:48,900 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-17 19:26:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:26:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333938697] [2025-03-17 19:26:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333938697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:26:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:26:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:26:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824142220] [2025-03-17 19:26:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:26:48,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:26:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:26:48,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:26:48,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:26:48,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 125 [2025-03-17 19:26:48,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 121 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-17 19:26:48,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:26:48,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 125 [2025-03-17 19:26:48,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand