./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-longer-2.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 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:08:47,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:08:47,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:08:47,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:08:47,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:08:47,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:08:47,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:08:47,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:08:47,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:08:47,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:08:47,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:08:47,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:08:47,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:08:47,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:08:47,680 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:08:47,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:08:47,681 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:08:47,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:08:47,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:47,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:08:47,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:08:47,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:08:47,684 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 -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2025-03-04 15:08:47,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:08:47,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:08:47,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:08:47,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:08:47,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:08:47,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2025-03-04 15:08:49,024 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3132dc0d9/14224beb54644a80b1cdc692e2390ea0/FLAG2f3c1af12 [2025-03-04 15:08:49,271 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:08:49,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2025-03-04 15:08:49,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3132dc0d9/14224beb54644a80b1cdc692e2390ea0/FLAG2f3c1af12 [2025-03-04 15:08:49,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3132dc0d9/14224beb54644a80b1cdc692e2390ea0 [2025-03-04 15:08:49,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:08:49,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:08:49,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:49,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:08:49,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:08:49,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d98bf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49, skipping insertion in model container [2025-03-04 15:08:49,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:08:49,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:49,579 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:08:49,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:49,644 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:08:49,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49 WrapperNode [2025-03-04 15:08:49,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:49,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:49,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:08:49,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:08:49,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,676 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-04 15:08:49,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:49,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:08:49,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:08:49,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:08:49,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:08:49,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:08:49,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:08:49,709 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:08:49,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:08:49,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (1/1) ... [2025-03-04 15:08:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:49,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:08:49,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:08:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:08:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:08:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:08:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:08:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:08:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:08:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:08:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:08:49,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:08:49,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:08:49,753 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:08:49,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:08:49,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:08:49,954 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:08:49,954 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:08:50,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:08:50,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:08:50,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:50 BoogieIcfgContainer [2025-03-04 15:08:50,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:08:50,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:08:50,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:08:50,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:08:50,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:08:49" (1/3) ... [2025-03-04 15:08:50,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778bc0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:50, skipping insertion in model container [2025-03-04 15:08:50,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:49" (2/3) ... [2025-03-04 15:08:50,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778bc0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:50, skipping insertion in model container [2025-03-04 15:08:50,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:50" (3/3) ... [2025-03-04 15:08:50,026 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-03-04 15:08:50,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:08:50,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:08:50,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:08:50,073 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:08:50,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 72 flow [2025-03-04 15:08:50,121 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-03-04 15:08:50,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:08:50,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 2/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-04 15:08:50,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 72 flow [2025-03-04 15:08:50,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 66 flow [2025-03-04 15:08:50,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:08:50,141 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;@47ba9d25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:08:50,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:08:50,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:08:50,145 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:08:50,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:08:50,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:50,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:08:50,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:50,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 185325867, now seen corresponding path program 1 times [2025-03-04 15:08:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293146839] [2025-03-04 15:08:50,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:50,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:08:50,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:08:50,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:50,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293146839] [2025-03-04 15:08:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293146839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784939138] [2025-03-04 15:08:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:50,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:50,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:50,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:50,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:50,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:50,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:50,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:50,577 INFO L124 PetriNetUnfolderBase]: 510/941 cut-off events. [2025-03-04 15:08:50,579 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:08:50,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 941 events. 510/941 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4953 event pairs, 208 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 1748. Up to 421 conditions per place. [2025-03-04 15:08:50,589 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 15:08:50,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 162 flow [2025-03-04 15:08:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:08:50,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-03-04 15:08:50,603 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions. [2025-03-04 15:08:50,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 162 flow [2025-03-04 15:08:50,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:50,614 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-03-04 15:08:50,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-04 15:08:50,621 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-04 15:08:50,621 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-03-04 15:08:50,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:50,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:50,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:08:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:08:50,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 185325868, now seen corresponding path program 1 times [2025-03-04 15:08:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324973114] [2025-03-04 15:08:50,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:50,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:08:50,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:08:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:50,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324973114] [2025-03-04 15:08:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324973114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172184874] [2025-03-04 15:08:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:50,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:50,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:50,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:50,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:50,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:50,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:50,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:50,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:50,813 INFO L124 PetriNetUnfolderBase]: 499/971 cut-off events. [2025-03-04 15:08:50,813 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-04 15:08:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 971 events. 499/971 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5049 event pairs, 182 based on Foata normal form. 26/890 useless extension candidates. Maximal degree in co-relation 1943. Up to 466 conditions per place. [2025-03-04 15:08:50,826 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-04 15:08:50,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 186 flow [2025-03-04 15:08:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 15:08:50,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-03-04 15:08:50,829 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 3 states and 70 transitions. [2025-03-04 15:08:50,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 186 flow [2025-03-04 15:08:50,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:50,831 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 100 flow [2025-03-04 15:08:50,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-04 15:08:50,833 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 15:08:50,833 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 100 flow [2025-03-04 15:08:50,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:50,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:50,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:50,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:08:50,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:50,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2004506799, now seen corresponding path program 1 times [2025-03-04 15:08:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:50,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065652110] [2025-03-04 15:08:50,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:50,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:50,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:50,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065652110] [2025-03-04 15:08:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065652110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935480036] [2025-03-04 15:08:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:50,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:50,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:50,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:50,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:50,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:51,142 INFO L124 PetriNetUnfolderBase]: 1181/2230 cut-off events. [2025-03-04 15:08:51,143 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-03-04 15:08:51,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 2230 events. 1181/2230 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14007 event pairs, 558 based on Foata normal form. 104/2089 useless extension candidates. Maximal degree in co-relation 4638. Up to 1241 conditions per place. [2025-03-04 15:08:51,155 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 56 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-04 15:08:51,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 322 flow [2025-03-04 15:08:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 15:08:51,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7109375 [2025-03-04 15:08:51,157 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 100 flow. Second operand 4 states and 91 transitions. [2025-03-04 15:08:51,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 322 flow [2025-03-04 15:08:51,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:51,159 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 120 flow [2025-03-04 15:08:51,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-04 15:08:51,161 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 15:08:51,162 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 120 flow [2025-03-04 15:08:51,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:51,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:08:51,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1984850697, now seen corresponding path program 1 times [2025-03-04 15:08:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650326478] [2025-03-04 15:08:51,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:51,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:51,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:51,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650326478] [2025-03-04 15:08:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650326478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:51,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342525002] [2025-03-04 15:08:51,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:51,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:51,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:51,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:51,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:51,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:51,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:51,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:51,348 INFO L124 PetriNetUnfolderBase]: 791/1734 cut-off events. [2025-03-04 15:08:51,349 INFO L125 PetriNetUnfolderBase]: For 752/768 co-relation queries the response was YES. [2025-03-04 15:08:51,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 1734 events. 791/1734 cut-off events. For 752/768 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11553 event pairs, 279 based on Foata normal form. 6/1619 useless extension candidates. Maximal degree in co-relation 3906. Up to 791 conditions per place. [2025-03-04 15:08:51,360 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-04 15:08:51,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 279 flow [2025-03-04 15:08:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 15:08:51,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-03-04 15:08:51,363 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 120 flow. Second operand 3 states and 73 transitions. [2025-03-04 15:08:51,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 279 flow [2025-03-04 15:08:51,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:51,366 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 140 flow [2025-03-04 15:08:51,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-03-04 15:08:51,367 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-03-04 15:08:51,368 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 140 flow [2025-03-04 15:08:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:51,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:08:51,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:51,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1984850698, now seen corresponding path program 1 times [2025-03-04 15:08:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957342135] [2025-03-04 15:08:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:51,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:51,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:51,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:51,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957342135] [2025-03-04 15:08:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957342135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:51,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:51,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098972642] [2025-03-04 15:08:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:51,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:51,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:51,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:51,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:51,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:51,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:51,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:51,536 INFO L124 PetriNetUnfolderBase]: 753/1716 cut-off events. [2025-03-04 15:08:51,537 INFO L125 PetriNetUnfolderBase]: For 1013/1029 co-relation queries the response was YES. [2025-03-04 15:08:51,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4132 conditions, 1716 events. 753/1716 cut-off events. For 1013/1029 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11602 event pairs, 217 based on Foata normal form. 42/1701 useless extension candidates. Maximal degree in co-relation 4114. Up to 835 conditions per place. [2025-03-04 15:08:51,546 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-04 15:08:51,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 302 flow [2025-03-04 15:08:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 15:08:51,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 15:08:51,548 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 140 flow. Second operand 3 states and 72 transitions. [2025-03-04 15:08:51,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 302 flow [2025-03-04 15:08:51,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:51,551 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 154 flow [2025-03-04 15:08:51,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2025-03-04 15:08:51,552 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-03-04 15:08:51,552 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 154 flow [2025-03-04 15:08:51,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:51,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:08:51,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:51,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash 476048493, now seen corresponding path program 1 times [2025-03-04 15:08:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537313655] [2025-03-04 15:08:51,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:51,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:08:51,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:08:51,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:51,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:51,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537313655] [2025-03-04 15:08:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537313655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:51,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:51,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140835070] [2025-03-04 15:08:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:51,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:51,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:51,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:51,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:51,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:51,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:51,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:51,853 INFO L124 PetriNetUnfolderBase]: 1197/2294 cut-off events. [2025-03-04 15:08:51,854 INFO L125 PetriNetUnfolderBase]: For 1748/1947 co-relation queries the response was YES. [2025-03-04 15:08:51,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5719 conditions, 2294 events. 1197/2294 cut-off events. For 1748/1947 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14882 event pairs, 700 based on Foata normal form. 147/2346 useless extension candidates. Maximal degree in co-relation 5700. Up to 1481 conditions per place. [2025-03-04 15:08:51,867 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 57 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-04 15:08:51,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 396 flow [2025-03-04 15:08:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 15:08:51,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-03-04 15:08:51,869 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 154 flow. Second operand 4 states and 87 transitions. [2025-03-04 15:08:51,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 396 flow [2025-03-04 15:08:51,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:51,874 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 174 flow [2025-03-04 15:08:51,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-04 15:08:51,875 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-04 15:08:51,875 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 174 flow [2025-03-04 15:08:51,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:51,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:51,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:08:51,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1652667496, now seen corresponding path program 1 times [2025-03-04 15:08:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:51,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199099127] [2025-03-04 15:08:51,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:51,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:51,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:51,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:51,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199099127] [2025-03-04 15:08:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199099127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638718147] [2025-03-04 15:08:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:51,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:51,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:51,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:51,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:51,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:52,152 INFO L124 PetriNetUnfolderBase]: 1021/2270 cut-off events. [2025-03-04 15:08:52,153 INFO L125 PetriNetUnfolderBase]: For 1871/2056 co-relation queries the response was YES. [2025-03-04 15:08:52,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 2270 events. 1021/2270 cut-off events. For 1871/2056 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16343 event pairs, 193 based on Foata normal form. 120/2344 useless extension candidates. Maximal degree in co-relation 6003. Up to 674 conditions per place. [2025-03-04 15:08:52,170 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 58 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-03-04 15:08:52,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 477 flow [2025-03-04 15:08:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 15:08:52,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-04 15:08:52,172 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 174 flow. Second operand 5 states and 116 transitions. [2025-03-04 15:08:52,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 477 flow [2025-03-04 15:08:52,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:52,179 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 272 flow [2025-03-04 15:08:52,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-04 15:08:52,179 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-03-04 15:08:52,180 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 272 flow [2025-03-04 15:08:52,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:52,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:52,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:08:52,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1652667497, now seen corresponding path program 1 times [2025-03-04 15:08:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:52,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255386815] [2025-03-04 15:08:52,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:52,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:52,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:52,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:52,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:52,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255386815] [2025-03-04 15:08:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255386815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:52,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494251848] [2025-03-04 15:08:52,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:52,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:52,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:52,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:52,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:52,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:52,502 INFO L124 PetriNetUnfolderBase]: 1098/2481 cut-off events. [2025-03-04 15:08:52,503 INFO L125 PetriNetUnfolderBase]: For 4261/4434 co-relation queries the response was YES. [2025-03-04 15:08:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 2481 events. 1098/2481 cut-off events. For 4261/4434 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17971 event pairs, 268 based on Foata normal form. 183/2571 useless extension candidates. Maximal degree in co-relation 6945. Up to 809 conditions per place. [2025-03-04 15:08:52,518 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2025-03-04 15:08:52,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 564 flow [2025-03-04 15:08:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-04 15:08:52,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73125 [2025-03-04 15:08:52,520 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 272 flow. Second operand 5 states and 117 transitions. [2025-03-04 15:08:52,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 564 flow [2025-03-04 15:08:52,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 541 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:52,527 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 327 flow [2025-03-04 15:08:52,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-03-04 15:08:52,528 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-03-04 15:08:52,528 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 327 flow [2025-03-04 15:08:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:52,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:52,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:08:52,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1017608297, now seen corresponding path program 1 times [2025-03-04 15:08:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404034559] [2025-03-04 15:08:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:52,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:52,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:52,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404034559] [2025-03-04 15:08:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404034559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:52,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790098255] [2025-03-04 15:08:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:52,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:52,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:52,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:52,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:52,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:52,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:52,707 INFO L124 PetriNetUnfolderBase]: 903/1917 cut-off events. [2025-03-04 15:08:52,707 INFO L125 PetriNetUnfolderBase]: For 3740/3971 co-relation queries the response was YES. [2025-03-04 15:08:52,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 1917 events. 903/1917 cut-off events. For 3740/3971 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12677 event pairs, 696 based on Foata normal form. 161/1993 useless extension candidates. Maximal degree in co-relation 5545. Up to 1466 conditions per place. [2025-03-04 15:08:52,722 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 32 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-04 15:08:52,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 330 flow [2025-03-04 15:08:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 15:08:52,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:08:52,722 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 327 flow. Second operand 3 states and 56 transitions. [2025-03-04 15:08:52,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 330 flow [2025-03-04 15:08:52,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 45 transitions, 314 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:52,731 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 250 flow [2025-03-04 15:08:52,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-03-04 15:08:52,732 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-03-04 15:08:52,732 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 250 flow [2025-03-04 15:08:52,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:52,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:52,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:08:52,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1017608296, now seen corresponding path program 1 times [2025-03-04 15:08:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121639245] [2025-03-04 15:08:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:52,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121639245] [2025-03-04 15:08:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121639245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408968699] [2025-03-04 15:08:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:52,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:52,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:52,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:52,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:52,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:52,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:52,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:52,950 INFO L124 PetriNetUnfolderBase]: 1002/2330 cut-off events. [2025-03-04 15:08:52,950 INFO L125 PetriNetUnfolderBase]: For 2596/2781 co-relation queries the response was YES. [2025-03-04 15:08:52,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6223 conditions, 2330 events. 1002/2330 cut-off events. For 2596/2781 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16530 event pairs, 199 based on Foata normal form. 110/2367 useless extension candidates. Maximal degree in co-relation 6199. Up to 1168 conditions per place. [2025-03-04 15:08:52,963 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 58 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-04 15:08:52,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 480 flow [2025-03-04 15:08:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 15:08:52,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-03-04 15:08:52,964 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 250 flow. Second operand 5 states and 109 transitions. [2025-03-04 15:08:52,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 480 flow [2025-03-04 15:08:52,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 475 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:52,989 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 271 flow [2025-03-04 15:08:52,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-03-04 15:08:52,990 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:52,990 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 271 flow [2025-03-04 15:08:52,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:52,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:52,990 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:08:52,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2101859406, now seen corresponding path program 1 times [2025-03-04 15:08:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178384439] [2025-03-04 15:08:52,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:52,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:52,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:52,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:52,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178384439] [2025-03-04 15:08:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178384439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371601611] [2025-03-04 15:08:53,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:53,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:53,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:53,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:08:53,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:53,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:53,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:53,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371601611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:53,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931187200] [2025-03-04 15:08:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:53,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:53,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:53,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:53,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:53,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:53,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:53,397 INFO L124 PetriNetUnfolderBase]: 1858/3390 cut-off events. [2025-03-04 15:08:53,398 INFO L125 PetriNetUnfolderBase]: For 4438/4674 co-relation queries the response was YES. [2025-03-04 15:08:53,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 3390 events. 1858/3390 cut-off events. For 4438/4674 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 21685 event pairs, 259 based on Foata normal form. 202/3404 useless extension candidates. Maximal degree in co-relation 9769. Up to 1361 conditions per place. [2025-03-04 15:08:53,415 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:08:53,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 566 flow [2025-03-04 15:08:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:08:53,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:53,416 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 271 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:08:53,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 566 flow [2025-03-04 15:08:53,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 552 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:53,423 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 271 flow [2025-03-04 15:08:53,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-04 15:08:53,424 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:53,424 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 271 flow [2025-03-04 15:08:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:53,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:53,424 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:08:53,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:53,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:08:53,629 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -733131992, now seen corresponding path program 1 times [2025-03-04 15:08:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157693894] [2025-03-04 15:08:53,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:53,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:08:53,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:08:53,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:53,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157693894] [2025-03-04 15:08:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157693894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562720088] [2025-03-04 15:08:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:53,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:53,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:53,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:53,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:53,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:53,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:53,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:53,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:53,860 INFO L124 PetriNetUnfolderBase]: 1583/3216 cut-off events. [2025-03-04 15:08:53,860 INFO L125 PetriNetUnfolderBase]: For 4752/4869 co-relation queries the response was YES. [2025-03-04 15:08:53,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9374 conditions, 3216 events. 1583/3216 cut-off events. For 4752/4869 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21736 event pairs, 358 based on Foata normal form. 178/3347 useless extension candidates. Maximal degree in co-relation 9348. Up to 1262 conditions per place. [2025-03-04 15:08:53,875 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:08:53,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 562 flow [2025-03-04 15:08:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:08:53,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:53,876 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 271 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:08:53,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 562 flow [2025-03-04 15:08:53,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:53,885 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 275 flow [2025-03-04 15:08:53,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-04 15:08:53,885 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:53,885 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 275 flow [2025-03-04 15:08:53,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:53,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:53,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:53,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:08:53,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:53,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1110404095, now seen corresponding path program 1 times [2025-03-04 15:08:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714073229] [2025-03-04 15:08:53,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:53,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:08:53,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:08:53,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:53,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714073229] [2025-03-04 15:08:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714073229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252580294] [2025-03-04 15:08:53,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:53,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:53,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:08:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:08:53,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:08:53,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:53,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:53,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:53,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:54,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252580294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:08:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697928407] [2025-03-04 15:08:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:54,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:54,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:54,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:54,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:54,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:54,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:54,262 INFO L124 PetriNetUnfolderBase]: 1521/2931 cut-off events. [2025-03-04 15:08:54,262 INFO L125 PetriNetUnfolderBase]: For 5613/5705 co-relation queries the response was YES. [2025-03-04 15:08:54,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8772 conditions, 2931 events. 1521/2931 cut-off events. For 5613/5705 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19053 event pairs, 142 based on Foata normal form. 207/3017 useless extension candidates. Maximal degree in co-relation 8746. Up to 984 conditions per place. [2025-03-04 15:08:54,294 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 6 changer transitions 1/95 dead transitions. [2025-03-04 15:08:54,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 726 flow [2025-03-04 15:08:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-04 15:08:54,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:54,295 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 275 flow. Second operand 6 states and 114 transitions. [2025-03-04 15:08:54,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 726 flow [2025-03-04 15:08:54,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:54,301 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 275 flow [2025-03-04 15:08:54,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-03-04 15:08:54,302 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-03-04 15:08:54,302 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 275 flow [2025-03-04 15:08:54,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:54,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:54,302 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:54,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:08:54,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:08:54,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 832893443, now seen corresponding path program 1 times [2025-03-04 15:08:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:54,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729644641] [2025-03-04 15:08:54,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:54,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:54,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:54,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:54,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729644641] [2025-03-04 15:08:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729644641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191358743] [2025-03-04 15:08:54,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:54,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:54,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:54,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:54,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:08:54,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:54,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:54,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:54,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:54,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:54,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191358743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:54,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:54,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 15:08:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341448223] [2025-03-04 15:08:54,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:54,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:54,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:54,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:54,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:54,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:54,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:54,918 INFO L124 PetriNetUnfolderBase]: 1339/2904 cut-off events. [2025-03-04 15:08:54,918 INFO L125 PetriNetUnfolderBase]: For 6270/6352 co-relation queries the response was YES. [2025-03-04 15:08:54,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8846 conditions, 2904 events. 1339/2904 cut-off events. For 6270/6352 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 18824 event pairs, 119 based on Foata normal form. 227/3108 useless extension candidates. Maximal degree in co-relation 8819. Up to 507 conditions per place. [2025-03-04 15:08:54,929 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 73 selfloop transitions, 12 changer transitions 4/99 dead transitions. [2025-03-04 15:08:54,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 703 flow [2025-03-04 15:08:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-03-04 15:08:54,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2025-03-04 15:08:54,931 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 275 flow. Second operand 7 states and 158 transitions. [2025-03-04 15:08:54,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 703 flow [2025-03-04 15:08:54,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 676 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:54,938 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 379 flow [2025-03-04 15:08:54,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-03-04 15:08:54,938 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-04 15:08:54,938 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 379 flow [2025-03-04 15:08:54,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:54,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:54,938 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:54,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:55,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:55,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:55,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash 62788742, now seen corresponding path program 1 times [2025-03-04 15:08:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:55,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146945428] [2025-03-04 15:08:55,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:55,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:55,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:55,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:55,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146945428] [2025-03-04 15:08:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146945428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:55,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:55,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019996999] [2025-03-04 15:08:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:55,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:55,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:55,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:55,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:55,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:55,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:55,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:55,420 INFO L124 PetriNetUnfolderBase]: 2138/3893 cut-off events. [2025-03-04 15:08:55,420 INFO L125 PetriNetUnfolderBase]: For 10005/10082 co-relation queries the response was YES. [2025-03-04 15:08:55,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12733 conditions, 3893 events. 2138/3893 cut-off events. For 10005/10082 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 22890 event pairs, 503 based on Foata normal form. 257/4109 useless extension candidates. Maximal degree in co-relation 12701. Up to 1567 conditions per place. [2025-03-04 15:08:55,432 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 69 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-03-04 15:08:55,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 764 flow [2025-03-04 15:08:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-04 15:08:55,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 15:08:55,433 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 379 flow. Second operand 4 states and 72 transitions. [2025-03-04 15:08:55,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 764 flow [2025-03-04 15:08:55,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 729 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:55,444 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 372 flow [2025-03-04 15:08:55,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-03-04 15:08:55,445 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-04 15:08:55,445 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 372 flow [2025-03-04 15:08:55,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:55,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:55,445 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:55,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:08:55,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1967023659, now seen corresponding path program 1 times [2025-03-04 15:08:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:55,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480501519] [2025-03-04 15:08:55,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:55,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:55,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:55,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:55,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480501519] [2025-03-04 15:08:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480501519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:55,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939852990] [2025-03-04 15:08:55,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:55,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:55,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:08:55,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:55,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:55,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:55,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:55,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:08:55,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:55,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939852990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:55,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:08:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50365210] [2025-03-04 15:08:55,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:55,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:55,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:55,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:55,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:55,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 372 flow. Second operand has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:55,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:55,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:55,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:55,987 INFO L124 PetriNetUnfolderBase]: 1744/3743 cut-off events. [2025-03-04 15:08:55,987 INFO L125 PetriNetUnfolderBase]: For 12928/12958 co-relation queries the response was YES. [2025-03-04 15:08:55,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11877 conditions, 3743 events. 1744/3743 cut-off events. For 12928/12958 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 23155 event pairs, 59 based on Foata normal form. 200/3940 useless extension candidates. Maximal degree in co-relation 11846. Up to 457 conditions per place. [2025-03-04 15:08:56,001 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 100 selfloop transitions, 17 changer transitions 17/144 dead transitions. [2025-03-04 15:08:56,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 1032 flow [2025-03-04 15:08:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 268 transitions. [2025-03-04 15:08:56,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-03-04 15:08:56,003 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 372 flow. Second operand 12 states and 268 transitions. [2025-03-04 15:08:56,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 1032 flow [2025-03-04 15:08:56,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 144 transitions, 995 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:56,013 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 429 flow [2025-03-04 15:08:56,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=429, PETRI_PLACES=87, PETRI_TRANSITIONS=52} [2025-03-04 15:08:56,013 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-03-04 15:08:56,013 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 429 flow [2025-03-04 15:08:56,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:56,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:56,014 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:56,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:56,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:08:56,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -58641131, now seen corresponding path program 1 times [2025-03-04 15:08:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902415584] [2025-03-04 15:08:56,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:56,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:08:56,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:08:56,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:56,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902415584] [2025-03-04 15:08:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902415584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231623841] [2025-03-04 15:08:56,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:56,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:56,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:08:56,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:08:56,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:08:56,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:56,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:56,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:08:56,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:56,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231623841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:56,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 15:08:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477032042] [2025-03-04 15:08:56,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:56,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:08:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:56,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:08:56,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:08:56,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:56,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 429 flow. Second operand has 16 states, 16 states have (on average 14.25) internal successors, (228), 16 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:56,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:56,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:56,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:57,049 INFO L124 PetriNetUnfolderBase]: 2554/5409 cut-off events. [2025-03-04 15:08:57,049 INFO L125 PetriNetUnfolderBase]: For 19397/19439 co-relation queries the response was YES. [2025-03-04 15:08:57,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17144 conditions, 5409 events. 2554/5409 cut-off events. For 19397/19439 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 33758 event pairs, 119 based on Foata normal form. 192/5588 useless extension candidates. Maximal degree in co-relation 17105. Up to 647 conditions per place. [2025-03-04 15:08:57,065 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 120 selfloop transitions, 24 changer transitions 25/179 dead transitions. [2025-03-04 15:08:57,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 179 transitions, 1332 flow [2025-03-04 15:08:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:08:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:08:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 334 transitions. [2025-03-04 15:08:57,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-03-04 15:08:57,067 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 429 flow. Second operand 15 states and 334 transitions. [2025-03-04 15:08:57,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 179 transitions, 1332 flow [2025-03-04 15:08:57,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 179 transitions, 1319 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:57,080 INFO L231 Difference]: Finished difference. Result has 105 places, 60 transitions, 580 flow [2025-03-04 15:08:57,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=580, PETRI_PLACES=105, PETRI_TRANSITIONS=60} [2025-03-04 15:08:57,080 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-03-04 15:08:57,080 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 60 transitions, 580 flow [2025-03-04 15:08:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.25) internal successors, (228), 16 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:57,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:57,081 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:57,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:08:57,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:57,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -233061099, now seen corresponding path program 2 times [2025-03-04 15:08:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483325449] [2025-03-04 15:08:57,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:57,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:57,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:57,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:57,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483325449] [2025-03-04 15:08:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483325449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424918518] [2025-03-04 15:08:57,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:57,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:57,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:08:57,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:57,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:57,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:57,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:08:57,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:57,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424918518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:57,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-03-04 15:08:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42220549] [2025-03-04 15:08:57,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:57,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 15:08:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:57,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 15:08:57,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-04 15:08:57,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:57,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 60 transitions, 580 flow. Second operand has 28 states, 28 states have (on average 14.142857142857142) internal successors, (396), 28 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:57,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:57,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:59,200 INFO L124 PetriNetUnfolderBase]: 4336/9215 cut-off events. [2025-03-04 15:08:59,200 INFO L125 PetriNetUnfolderBase]: For 48451/48481 co-relation queries the response was YES. [2025-03-04 15:08:59,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29574 conditions, 9215 events. 4336/9215 cut-off events. For 48451/48481 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 57326 event pairs, 59 based on Foata normal form. 360/9572 useless extension candidates. Maximal degree in co-relation 29527. Up to 1177 conditions per place. [2025-03-04 15:08:59,242 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 212 selfloop transitions, 41 changer transitions 49/312 dead transitions. [2025-03-04 15:08:59,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 312 transitions, 2331 flow [2025-03-04 15:08:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:08:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 15:08:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 625 transitions. [2025-03-04 15:08:59,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975446428571429 [2025-03-04 15:08:59,249 INFO L175 Difference]: Start difference. First operand has 105 places, 60 transitions, 580 flow. Second operand 28 states and 625 transitions. [2025-03-04 15:08:59,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 312 transitions, 2331 flow [2025-03-04 15:08:59,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 312 transitions, 2251 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:08:59,287 INFO L231 Difference]: Finished difference. Result has 139 places, 76 transitions, 842 flow [2025-03-04 15:08:59,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=842, PETRI_PLACES=139, PETRI_TRANSITIONS=76} [2025-03-04 15:08:59,288 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2025-03-04 15:08:59,288 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 76 transitions, 842 flow [2025-03-04 15:08:59,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.142857142857142) internal successors, (396), 28 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:59,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:59,289 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:59,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:08:59,489 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 338949581, now seen corresponding path program 2 times [2025-03-04 15:08:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298262802] [2025-03-04 15:08:59,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:59,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-04 15:08:59,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:08:59,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:59,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298262802] [2025-03-04 15:08:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298262802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857909770] [2025-03-04 15:08:59,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:59,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:59,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:08:59,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-04 15:08:59,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:08:59,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:59,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:59,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:08:59,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:09:00,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:00,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857909770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:00,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 46 [2025-03-04 15:09:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472239612] [2025-03-04 15:09:00,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:09:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:00,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:09:00,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 15:09:00,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:09:00,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 76 transitions, 842 flow. Second operand has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 23 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:00,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:00,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:09:00,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:05,462 INFO L124 PetriNetUnfolderBase]: 26884/46200 cut-off events. [2025-03-04 15:09:05,462 INFO L125 PetriNetUnfolderBase]: For 114910/114910 co-relation queries the response was YES. [2025-03-04 15:09:05,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149987 conditions, 46200 events. 26884/46200 cut-off events. For 114910/114910 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 346507 event pairs, 525 based on Foata normal form. 612/46799 useless extension candidates. Maximal degree in co-relation 149937. Up to 6831 conditions per place. [2025-03-04 15:09:05,816 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 0 selfloop transitions, 0 changer transitions 633/633 dead transitions. [2025-03-04 15:09:05,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 633 transitions, 6983 flow [2025-03-04 15:09:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:09:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 15:09:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 458 transitions. [2025-03-04 15:09:05,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222826086956522 [2025-03-04 15:09:05,818 INFO L175 Difference]: Start difference. First operand has 139 places, 76 transitions, 842 flow. Second operand 23 states and 458 transitions. [2025-03-04 15:09:05,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 633 transitions, 6983 flow [2025-03-04 15:09:06,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 633 transitions, 5152 flow, removed 22 selfloop flow, removed 48 redundant places. [2025-03-04 15:09:06,105 INFO L231 Difference]: Finished difference. Result has 108 places, 0 transitions, 0 flow [2025-03-04 15:09:06,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=0, PETRI_PLACES=108, PETRI_TRANSITIONS=0} [2025-03-04 15:09:06,105 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 73 predicate places. [2025-03-04 15:09:06,105 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 0 transitions, 0 flow [2025-03-04 15:09:06,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 23 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:06,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 15:09:06,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 15:09:06,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:06,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:06,313 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:06,317 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:09:06,317 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:09:06,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:09:06 BasicIcfg [2025-03-04 15:09:06,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:09:06,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:09:06,320 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:09:06,321 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:09:06,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:50" (3/4) ... [2025-03-04 15:09:06,322 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:09:06,324 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 15:09:06,324 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 15:09:06,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 15:09:06,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 15:09:06,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 15:09:06,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 15:09:06,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:09:06,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:09:06,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:09:06,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:09:06,377 INFO L158 Benchmark]: Toolchain (without parser) took 17085.64ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 103.3MB in the beginning and 169.5MB in the end (delta: -66.2MB). Peak memory consumption was 876.4MB. Max. memory is 16.1GB. [2025-03-04 15:09:06,377 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:09:06,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.04ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 84.2MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:09:06,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.81ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 83.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:09:06,377 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:09:06,377 INFO L158 Benchmark]: IcfgBuilder took 310.15ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 60.4MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:09:06,377 INFO L158 Benchmark]: TraceAbstraction took 16299.37ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 60.2MB in the beginning and 175.3MB in the end (delta: -115.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-04 15:09:06,378 INFO L158 Benchmark]: Witness Printer took 55.85ms. Allocated memory is still 1.1GB. Free memory was 175.3MB in the beginning and 169.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:09:06,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.04ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 84.2MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.81ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 83.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 310.15ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 60.4MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16299.37ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 60.2MB in the beginning and 175.3MB in the end (delta: -115.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 55.85ms. Allocated memory is still 1.1GB. Free memory was 175.3MB in the beginning and 169.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2125 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2098 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3326 IncrementalHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 16 mSDtfsCounter, 3326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=842occurred in iteration=18, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 780 ConstructedInterpolants, 0 QuantifiedInterpolants, 2238 SizeOfPredicates, 37 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 402/1220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:09:06,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE